diff --git a/src/main/java/com/code/leet/doubleWeek/SolutionD63.java b/src/main/java/com/code/leet/doubleWeek/SolutionD63.java
new file mode 100644
index 0000000..ac85a49
--- /dev/null
+++ b/src/main/java/com/code/leet/doubleWeek/SolutionD63.java
@@ -0,0 +1,77 @@
+package com.code.leet.doubleWeek;
+
+import java.util.*;
+
+public class SolutionD63 {
+    public static void main(String[] args) {
+        SolutionD63 solution = new SolutionD63();
+//        solution.networkBecomesIdle(new int[][]{{0,1},{1,2}},new int[]{0,2,1});
+//        solution.networkBecomesIdle(new int[][]{{0, 1}, {0, 2}, {1, 2}}, new int[]{0, 10, 10});
+        solution.networkBecomesIdle(new int[][]{{5, 7}, {15, 18}, {12, 6}, {5, 1}, {11, 17}, {3, 9}, {6, 11}, {14, 7}, {19, 13}, {13, 3},
+                        {4, 12}, {9, 15}, {2, 10}, {18, 4}, {5, 14}, {17, 5}, {16, 2}, {7, 1}, {0, 16}, {10, 19}, {1, 8}},
+                new int[]{0, 2, 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1});
+    }
+
+    public int minMovesToSeat(int[] seats, int[] students) {
+        Arrays.sort(seats);
+        Arrays.sort(students);
+        int count = 0;
+        for (int i = 0; i < seats.length; i++) {
+            count += Math.abs(seats[i] - students[i]);
+        }
+        return count;
+    }
+
+    public boolean winnerOfGame(String colors) {
+        int count = 0;
+        for (int i = 2; i < colors.length(); i++) {
+            if (colors.charAt(i - 2) == 'A' && colors.charAt(i - 1) == 'A' && colors.charAt(i) == 'A') {
+                count++;
+            }
+            if (colors.charAt(i - 2) == 'B' && colors.charAt(i - 1) == 'B' && colors.charAt(i) == 'B') {
+                count--;
+            }
+        }
+        return count > 0;
+    }
+
+    public int networkBecomesIdle(int[][] edges, int[] patience) {
+        int size = patience.length;
+        int[] steps = new int[size];
+        Map<Integer, List<Integer>> map = new HashMap<>();
+        for (int[] edge : edges) {
+            List<Integer> list = map.getOrDefault(edge[0], new ArrayList<>());
+            list.add(edge[1]);
+            map.put(edge[0], list);
+            list = map.getOrDefault(edge[1], new ArrayList<>());
+            list.add(edge[0]);
+            map.put(edge[1], list);
+        }
+        Queue<Integer> queue = new LinkedList<>();
+        List<Integer> vals = map.get(0);
+        int step = 1;
+        for (Integer val : vals) {
+            queue.add(val);
+            steps[val] = step;
+        }
+        while (!queue.isEmpty()) {
+            step++;
+            int length = queue.size();
+            for (int i = 0; i < length; i++) {
+                int key = queue.poll();
+                vals = map.get(key);
+                for (Integer val : vals) {
+                    if (steps[val] == 0) {
+                        queue.add(val);
+                        steps[val] = step;
+                    }
+                }
+            }
+        }
+        int max = 0;
+        for (int i = 1; i < size; i++) {
+            max = Math.max(max, steps[i] * 2 + (steps[i] * 2 - 1) / patience[i] * patience[i]);
+        }
+        return max + 1;
+    }
+}
diff --git a/src/main/java/leetcode/editor/cn/doc/all.json b/src/main/java/leetcode/editor/cn/doc/all.json
index 8ab5c98..e9af11c 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.4703055473153367,"acs":15854,"articleLive":2,"columnArticles":141,"formTitle":"[282]给表达式添加运算符","frequency":0.0,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"","submitted":33710,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.5210157522690249,"acs":2579103,"articleLive":2,"columnArticles":14464,"formTitle":"[1]两数之和","frequency":0.0,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"ac","submitted":4950144,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.409299675708605,"acs":1026621,"articleLive":2,"columnArticles":7286,"formTitle":"[2]两数相加","frequency":0.0,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"ac","submitted":2508238,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.3811622946972901,"acs":1275127,"articleLive":2,"columnArticles":7614,"formTitle":"[3]无重复字符的最长子串","frequency":0.0,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"ac","submitted":3345365,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.40902059157649046,"acs":527475,"articleLive":2,"columnArticles":3929,"formTitle":"[4]寻找两个正序数组的中位数","frequency":0.0,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"ac","submitted":1289605,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.35562777581952765,"acs":756687,"articleLive":2,"columnArticles":4094,"formTitle":"[5]最长回文子串","frequency":0.0,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"ac","submitted":2127750,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5074978952272746,"acs":310439,"articleLive":2,"columnArticles":2517,"formTitle":"[6]Z 字形变换","frequency":0.0,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"ac","submitted":611705,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.35234055299881417,"acs":853953,"articleLive":2,"columnArticles":5377,"formTitle":"[7]整数反转","frequency":0.0,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","questionId":"7","status":"ac","submitted":2423658,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.21729267991122417,"acs":355008,"articleLive":2,"columnArticles":2729,"formTitle":"[8]字符串转换整数 (atoi)","frequency":0.0,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","submitted":1633778,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5835237848059026,"acs":786911,"articleLive":2,"columnArticles":5008,"formTitle":"[9]回文数","frequency":0.0,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","submitted":1348550,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.3159600940920196,"acs":208867,"articleLive":2,"columnArticles":1256,"formTitle":"[10]正则表达式匹配","frequency":0.0,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"ac","submitted":661055,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.6269665259052135,"acs":548449,"articleLive":2,"columnArticles":3111,"formTitle":"[11]盛最多水的容器","frequency":0.0,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"ac","submitted":874766,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.6647306406973139,"acs":231531,"articleLive":2,"columnArticles":1807,"formTitle":"[12]整数转罗马数字","frequency":0.0,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"ac","submitted":348308,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.6317789872232115,"acs":477563,"articleLive":2,"columnArticles":3953,"formTitle":"[13]罗马数字转整数","frequency":0.0,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"ac","submitted":755902,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.41040115850061404,"acs":637937,"articleLive":2,"columnArticles":3983,"formTitle":"[14]最长公共前缀","frequency":0.0,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"","submitted":1554423,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.33700678275126283,"acs":675032,"articleLive":2,"columnArticles":3189,"formTitle":"[15]三数之和","frequency":0.0,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"ac","submitted":2003022,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.45909559769690655,"acs":266157,"articleLive":2,"columnArticles":1460,"formTitle":"[16]最接近的三数之和","frequency":0.0,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","submitted":579742,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.5733136452553325,"acs":347885,"articleLive":2,"columnArticles":3133,"formTitle":"[17]电话号码的字母组合","frequency":0.0,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"ac","submitted":606797,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.3981991830766094,"acs":226561,"articleLive":2,"columnArticles":1557,"formTitle":"[18]四数之和","frequency":0.0,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"ac","submitted":568964,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.4298719699033367,"acs":533386,"articleLive":2,"columnArticles":3985,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":0.0,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"ac","submitted":1240802,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.4451193234450632,"acs":801505,"articleLive":2,"columnArticles":5676,"formTitle":"[20]有效的括号","frequency":0.0,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"ac","submitted":1800652,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6676019999125403,"acs":732792,"articleLive":2,"columnArticles":3550,"formTitle":"[21]合并两个有序链表","frequency":0.0,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"ac","submitted":1097648,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.77262869486423,"acs":359824,"articleLive":2,"columnArticles":2703,"formTitle":"[22]括号生成","frequency":0.0,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"ac","submitted":465714,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5601314638784866,"acs":333700,"articleLive":2,"columnArticles":2157,"formTitle":"[23]合并K个升序链表","frequency":0.0,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"ac","submitted":595753,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7034207810548042,"acs":323767,"articleLive":2,"columnArticles":2563,"formTitle":"[24]两两交换链表中的节点","frequency":0.0,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"ac","submitted":460275,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6578174134124312,"acs":235967,"articleLive":2,"columnArticles":2240,"formTitle":"[25]K 个一组翻转链表","frequency":0.0,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"ac","submitted":358712,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5387234968234063,"acs":832101,"articleLive":2,"columnArticles":4624,"formTitle":"[26]删除有序数组中的重复项","frequency":0.0,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"ac","submitted":1544579,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5971232846911175,"acs":494061,"articleLive":2,"columnArticles":4166,"formTitle":"[27]移除元素","frequency":0.0,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"ac","submitted":827402,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.40547135928316697,"acs":480027,"articleLive":2,"columnArticles":3290,"formTitle":"[28]实现 strStr()","frequency":0.0,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"ac","submitted":1183874,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.21976925643678819,"acs":130408,"articleLive":2,"columnArticles":1040,"formTitle":"[29]两数相除","frequency":0.0,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"ac","submitted":593386,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.35927266307705885,"acs":81404,"articleLive":2,"columnArticles":603,"formTitle":"[30]串联所有单词的子串","frequency":0.0,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"notac","submitted":226580,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.37307584899592955,"acs":220430,"articleLive":2,"columnArticles":1782,"formTitle":"[31]下一个排列","frequency":0.0,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"ac","submitted":590845,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.35680095768345715,"acs":195523,"articleLive":2,"columnArticles":1320,"formTitle":"[32]最长有效括号","frequency":0.0,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","submitted":547989,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.42797572580415394,"acs":375538,"articleLive":2,"columnArticles":2479,"formTitle":"[33]搜索旋转排序数组","frequency":0.0,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"ac","submitted":877475,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.4233889150060922,"acs":353042,"articleLive":2,"columnArticles":3379,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":0.0,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"ac","submitted":833848,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.46282771436902137,"acs":526996,"articleLive":2,"columnArticles":4037,"formTitle":"[35]搜索插入位置","frequency":0.0,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"ac","submitted":1138644,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.640195849418476,"acs":208289,"articleLive":2,"columnArticles":1472,"formTitle":"[36]有效的数独","frequency":0.0,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"ac","submitted":325352,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6708483918774862,"acs":103206,"articleLive":2,"columnArticles":875,"formTitle":"[37]解数独","frequency":0.0,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","submitted":153844,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.595695465384388,"acs":241819,"articleLive":2,"columnArticles":2592,"formTitle":"[38]外观数列","frequency":0.0,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","questionId":"38","status":"ac","submitted":405944,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.727694766483168,"acs":344220,"articleLive":2,"columnArticles":2000,"formTitle":"[39]组合总和","frequency":0.0,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"ac","submitted":473028,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.6218227976951461,"acs":205255,"articleLive":2,"columnArticles":1426,"formTitle":"[40]组合总和 II","frequency":0.0,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"ac","submitted":330086,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.41976144824323314,"acs":168572,"articleLive":2,"columnArticles":1441,"formTitle":"[41]缺失的第一个正数","frequency":0.0,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"ac","submitted":401590,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.582460182397347,"acs":333706,"articleLive":2,"columnArticles":2482,"formTitle":"[42]接雨水","frequency":0.0,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"ac","submitted":572925,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.4490887218823164,"acs":173593,"articleLive":2,"columnArticles":1169,"formTitle":"[43]字符串相乘","frequency":0.0,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"ac","submitted":386545,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.3282247423074717,"acs":85816,"articleLive":2,"columnArticles":559,"formTitle":"[44]通配符匹配","frequency":0.0,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","submitted":261455,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.4306323175373979,"acs":209283,"articleLive":2,"columnArticles":1672,"formTitle":"[45]跳跃游戏 II","frequency":0.0,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"ac","submitted":485990,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7832379731107718,"acs":432439,"articleLive":2,"columnArticles":2765,"formTitle":"[46]全排列","frequency":0.0,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"ac","submitted":552117,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.638307526024056,"acs":220871,"articleLive":2,"columnArticles":1520,"formTitle":"[47]全排列 II","frequency":0.0,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"ac","submitted":346026,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7352779803900052,"acs":227820,"articleLive":2,"columnArticles":1914,"formTitle":"[48]旋转图像","frequency":0.0,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"ac","submitted":309842,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6655743100024543,"acs":238643,"articleLive":2,"columnArticles":1348,"formTitle":"[49]字母异位词分组","frequency":0.0,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"ac","submitted":358552,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.37636845183049555,"acs":221401,"articleLive":2,"columnArticles":1313,"formTitle":"[50]Pow(x, n)","frequency":0.0,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"ac","submitted":588256,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7388273360595813,"acs":156641,"articleLive":2,"columnArticles":1568,"formTitle":"[51]N 皇后","frequency":0.0,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"ac","submitted":212013,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.8223215655337146,"acs":75050,"articleLive":2,"columnArticles":619,"formTitle":"[52]N皇后 II","frequency":0.0,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","submitted":91266,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.5528895363805911,"acs":704368,"articleLive":2,"columnArticles":3871,"formTitle":"[53]最大子序和","frequency":0.0,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"ac","submitted":1273976,"title":"最大子序和","titleSlug":"maximum-subarray"},{"acceptance":0.48168514147122093,"acs":193241,"articleLive":2,"columnArticles":2041,"formTitle":"[54]螺旋矩阵","frequency":0.0,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","submitted":401177,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.4326998665659878,"acs":334657,"articleLive":2,"columnArticles":2571,"formTitle":"[55]跳跃游戏","frequency":0.0,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"ac","submitted":773416,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.4701185167622643,"acs":309322,"articleLive":2,"columnArticles":2375,"formTitle":"[56]合并区间","frequency":0.0,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"ac","submitted":657966,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.4115994023727115,"acs":87881,"articleLive":2,"columnArticles":941,"formTitle":"[57]插入区间","frequency":0.0,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","submitted":213511,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.37718408212596427,"acs":252785,"articleLive":2,"columnArticles":2715,"formTitle":"[58]最后一个单词的长度","frequency":0.0,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"ac","submitted":670190,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.7894810166452645,"acs":130337,"articleLive":2,"columnArticles":1605,"formTitle":"[59]螺旋矩阵 II","frequency":0.0,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","submitted":165092,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5243627496089077,"acs":91172,"articleLive":2,"columnArticles":967,"formTitle":"[60]排列序列","frequency":0.0,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","submitted":173872,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.4176333188170553,"acs":200431,"articleLive":2,"columnArticles":2037,"formTitle":"[61]旋转链表","frequency":0.0,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"ac","submitted":479921,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.6625392302609845,"acs":320881,"articleLive":2,"columnArticles":2474,"formTitle":"[62]不同路径","frequency":0.0,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"ac","submitted":484320,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.3921694764394593,"acs":185935,"articleLive":2,"columnArticles":1752,"formTitle":"[63]不同路径 II","frequency":0.0,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","submitted":474119,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6883219536431319,"acs":274308,"articleLive":2,"columnArticles":2117,"formTitle":"[64]最小路径和","frequency":0.0,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"ac","submitted":398517,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.26961554456818076,"acs":46678,"articleLive":2,"columnArticles":648,"formTitle":"[65]有效数字","frequency":0.0,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"ac","submitted":173128,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.45709556815580077,"acs":357366,"articleLive":2,"columnArticles":3227,"formTitle":"[66]加一","frequency":0.0,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"ac","submitted":781819,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.542681388358674,"acs":197879,"articleLive":2,"columnArticles":1809,"formTitle":"[67]二进制求和","frequency":0.0,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","submitted":364632,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.5242962881435215,"acs":38109,"articleLive":2,"columnArticles":577,"formTitle":"[68]文本左右对齐","frequency":0.0,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"ac","submitted":72686,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.39190171179539746,"acs":395314,"articleLive":2,"columnArticles":1983,"formTitle":"[69]Sqrt(x)","frequency":0.0,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","submitted":1008707,"title":"Sqrt(x)","titleSlug":"sqrtx"},{"acceptance":0.5303698499342449,"acs":588806,"articleLive":2,"columnArticles":3663,"formTitle":"[70]爬楼梯","frequency":0.0,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"ac","submitted":1110180,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.421793037672866,"acs":95526,"articleLive":2,"columnArticles":838,"formTitle":"[71]简化路径","frequency":0.0,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"ac","submitted":226476,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6141182636870444,"acs":180439,"articleLive":2,"columnArticles":1258,"formTitle":"[72]编辑距离","frequency":0.0,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"ac","submitted":293818,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6046644090725026,"acs":135882,"articleLive":2,"columnArticles":997,"formTitle":"[73]矩阵置零","frequency":0.0,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"ac","submitted":224723,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.46169566226552516,"acs":173056,"articleLive":2,"columnArticles":1731,"formTitle":"[74]搜索二维矩阵","frequency":0.0,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"ac","submitted":374827,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5966616058685045,"acs":275490,"articleLive":2,"columnArticles":1895,"formTitle":"[75]颜色分类","frequency":0.0,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","submitted":461719,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.42739143337619945,"acs":190102,"articleLive":2,"columnArticles":1296,"formTitle":"[76]最小覆盖子串","frequency":0.0,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","submitted":444796,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.7700796994425804,"acs":226291,"articleLive":2,"columnArticles":1327,"formTitle":"[77]组合","frequency":0.0,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"ac","submitted":293854,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8016656330736378,"acs":319293,"articleLive":2,"columnArticles":2083,"formTitle":"[78]子集","frequency":0.0,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"ac","submitted":398287,"title":"子集","titleSlug":"subsets"},{"acceptance":0.4587210314688464,"acs":229194,"articleLive":2,"columnArticles":1443,"formTitle":"[79]单词搜索","frequency":0.0,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"ac","submitted":499637,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6168952849029776,"acs":150119,"articleLive":2,"columnArticles":1342,"formTitle":"[80]删除有序数组中的重复项 II","frequency":0.0,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"ac","submitted":243346,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.4149243124623701,"acs":126115,"articleLive":2,"columnArticles":1005,"formTitle":"[81]搜索旋转排序数组 II","frequency":0.0,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"ac","submitted":303947,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5309188744088702,"acs":185691,"articleLive":2,"columnArticles":1713,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":0.0,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"ac","submitted":349754,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.5384702445844395,"acs":323521,"articleLive":2,"columnArticles":1973,"formTitle":"[83]删除排序链表中的重复元素","frequency":0.0,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"ac","submitted":600815,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.4335118873249915,"acs":186463,"articleLive":2,"columnArticles":1185,"formTitle":"[84]柱状图中最大的矩形","frequency":0.0,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"ac","submitted":430122,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5158291027323028,"acs":99473,"articleLive":2,"columnArticles":701,"formTitle":"[85]最大矩形","frequency":0.0,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"ac","submitted":192841,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6326967444912585,"acs":121486,"articleLive":2,"columnArticles":1119,"formTitle":"[86]分隔链表","frequency":0.0,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"ac","submitted":192013,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.48684789404218864,"acs":42051,"articleLive":2,"columnArticles":314,"formTitle":"[87]扰乱字符串","frequency":0.0,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"ac","submitted":86374,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.5174476126831766,"acs":476977,"articleLive":2,"columnArticles":3333,"formTitle":"[88]合并两个有序数组","frequency":0.0,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"ac","submitted":921788,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7100379686758425,"acs":59842,"articleLive":2,"columnArticles":488,"formTitle":"[89]格雷编码","frequency":0.0,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"ac","submitted":84280,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6337637008309254,"acs":141027,"articleLive":2,"columnArticles":1243,"formTitle":"[90]子集 II","frequency":0.0,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"ac","submitted":222523,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.3098337836731352,"acs":166496,"articleLive":2,"columnArticles":1542,"formTitle":"[91]解码方法","frequency":0.0,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"ac","submitted":537372,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5491374631627535,"acs":216526,"articleLive":2,"columnArticles":2062,"formTitle":"[92]反转链表 II","frequency":0.0,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"ac","submitted":394302,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5412491212593216,"acs":157064,"articleLive":2,"columnArticles":1355,"formTitle":"[93]复原 IP 地址","frequency":0.0,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"ac","submitted":290188,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.7556743267076663,"acs":577144,"articleLive":2,"columnArticles":2361,"formTitle":"[94]二叉树的中序遍历","frequency":0.0,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","questionId":"94","status":"ac","submitted":763747,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.702606300568084,"acs":102036,"articleLive":2,"columnArticles":637,"formTitle":"[95]不同的二叉搜索树 II","frequency":0.0,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","submitted":145225,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.6995093945282171,"acs":166677,"articleLive":2,"columnArticles":1317,"formTitle":"[96]不同的二叉搜索树","frequency":0.0,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","submitted":238277,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.4557993183684444,"acs":62723,"articleLive":2,"columnArticles":556,"formTitle":"[97]交错字符串","frequency":0.0,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","submitted":137611,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.3504499865609527,"acs":355951,"articleLive":2,"columnArticles":1973,"formTitle":"[98]验证二叉搜索树","frequency":0.0,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"ac","submitted":1015697,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6113930953479593,"acs":72875,"articleLive":2,"columnArticles":599,"formTitle":"[99]恢复二叉搜索树","frequency":0.0,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","questionId":"99","status":"","submitted":119195,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.6019834413842492,"acs":254701,"articleLive":2,"columnArticles":1912,"formTitle":"[100]相同的树","frequency":0.0,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","submitted":423103,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.5642370960495169,"acs":420698,"articleLive":2,"columnArticles":2306,"formTitle":"[101]对称二叉树","frequency":0.0,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"","submitted":745605,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6421107330926229,"acs":406537,"articleLive":2,"columnArticles":2554,"formTitle":"[102]二叉树的层序遍历","frequency":0.0,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"ac","submitted":633126,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5717679980141012,"acs":177355,"articleLive":2,"columnArticles":1612,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":0.0,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"ac","submitted":310187,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7661829958427931,"acs":525446,"articleLive":2,"columnArticles":2603,"formTitle":"[104]二叉树的最大深度","frequency":0.0,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"","submitted":685797,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7047806377512803,"acs":254041,"articleLive":2,"columnArticles":1455,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":0.0,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"","submitted":360454,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.7216031851360318,"acs":135932,"articleLive":2,"columnArticles":901,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":0.0,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"","submitted":188375,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.6976865725111372,"acs":165538,"articleLive":2,"columnArticles":1324,"formTitle":"[107]二叉树的层序遍历 II","frequency":0.0,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","submitted":237267,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7606037477219272,"acs":195320,"articleLive":2,"columnArticles":1209,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":0.0,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"ac","submitted":256796,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7631547366652532,"acs":95389,"articleLive":2,"columnArticles":733,"formTitle":"[109]有序链表转换二叉搜索树","frequency":0.0,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"ac","submitted":124993,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5638043091647894,"acs":261546,"articleLive":2,"columnArticles":1496,"formTitle":"[110]平衡二叉树","frequency":0.0,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"ac","submitted":463895,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.4868452044055558,"acs":276975,"articleLive":2,"columnArticles":1824,"formTitle":"[111]二叉树的最小深度","frequency":0.0,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","submitted":568918,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.526366207201161,"acs":275289,"articleLive":2,"columnArticles":1728,"formTitle":"[112]路径总和","frequency":0.0,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"","submitted":522999,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.627690968354452,"acs":183137,"articleLive":2,"columnArticles":1283,"formTitle":"[113]路径总和 II","frequency":0.0,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","submitted":291763,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.7261185997847424,"acs":181481,"articleLive":2,"columnArticles":1362,"formTitle":"[114]二叉树展开为链表","frequency":0.0,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","submitted":249933,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5216304013691915,"acs":62785,"articleLive":2,"columnArticles":690,"formTitle":"[115]不同的子序列","frequency":0.0,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","submitted":120363,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7046303825060983,"acs":162919,"articleLive":2,"columnArticles":1241,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":0.0,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"ac","submitted":231212,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6152207448762212,"acs":92125,"articleLive":2,"columnArticles":784,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":0.0,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"ac","submitted":149743,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.73155155632362,"acs":220971,"articleLive":2,"columnArticles":1780,"formTitle":"[118]杨辉三角","frequency":0.0,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"ac","submitted":302058,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6681499051662871,"acs":147603,"articleLive":2,"columnArticles":1225,"formTitle":"[119]杨辉三角 II","frequency":0.0,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"ac","submitted":220913,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6815888910942257,"acs":182004,"articleLive":2,"columnArticles":1600,"formTitle":"[120]三角形最小路径和","frequency":0.0,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"ac","submitted":267029,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5733240522489202,"acs":575728,"articleLive":2,"columnArticles":3451,"formTitle":"[121]买卖股票的最佳时机","frequency":0.0,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"ac","submitted":1004193,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6898186302875146,"acs":472076,"articleLive":2,"columnArticles":2690,"formTitle":"[122]买卖股票的最佳时机 II","frequency":0.0,"frontendQuestionId":"122","leaf":true,"level":2,"nodeType":"def","questionId":"122","status":"ac","submitted":684348,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5372666066780216,"acs":133745,"articleLive":2,"columnArticles":830,"formTitle":"[123]买卖股票的最佳时机 III","frequency":0.0,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"","submitted":248936,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.444961367074118,"acs":163263,"articleLive":2,"columnArticles":1109,"formTitle":"[124]二叉树中的最大路径和","frequency":0.0,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"ac","submitted":366915,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.472749124557257,"acs":282426,"articleLive":2,"columnArticles":1860,"formTitle":"[125]验证回文串","frequency":0.0,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","submitted":597412,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.3966875144776465,"acs":37675,"articleLive":2,"columnArticles":332,"formTitle":"[126]单词接龙 II","frequency":0.0,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","submitted":94974,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.46878982324103086,"acs":125075,"articleLive":2,"columnArticles":662,"formTitle":"[127]单词接龙","frequency":0.0,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","submitted":266804,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5433796335112676,"acs":174984,"articleLive":2,"columnArticles":1143,"formTitle":"[128]最长连续序列","frequency":0.0,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","questionId":"128","status":"","submitted":322029,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6829975503674449,"acs":122958,"articleLive":2,"columnArticles":1131,"formTitle":"[129]求根节点到叶节点数字之和","frequency":0.0,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","submitted":180027,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.4455044379700522,"acs":131504,"articleLive":2,"columnArticles":1195,"formTitle":"[130]被围绕的区域","frequency":0.0,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"ac","submitted":295180,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7229932910821776,"acs":136324,"articleLive":2,"columnArticles":893,"formTitle":"[131]分割回文串","frequency":0.0,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","submitted":188555,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.4923572082402386,"acs":50023,"articleLive":2,"columnArticles":443,"formTitle":"[132]分割回文串 II","frequency":0.0,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","submitted":101599,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6762165327672346,"acs":73901,"articleLive":2,"columnArticles":531,"formTitle":"[133]克隆图","frequency":0.0,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"ac","submitted":109286,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.5758340758340759,"acs":127963,"articleLive":2,"columnArticles":989,"formTitle":"[134]加油站","frequency":0.0,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"ac","submitted":222222,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.4860376960641015,"acs":101421,"articleLive":2,"columnArticles":813,"formTitle":"[135]分发糖果","frequency":0.0,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"ac","submitted":208669,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7191267688081864,"acs":511046,"articleLive":2,"columnArticles":2318,"formTitle":"[136]只出现一次的数字","frequency":0.0,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"ac","submitted":710648,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7199441249672053,"acs":101533,"articleLive":2,"columnArticles":764,"formTitle":"[137]只出现一次的数字 II","frequency":0.0,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"ac","submitted":141029,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6617173192387046,"acs":114178,"articleLive":2,"columnArticles":865,"formTitle":"[138]复制带随机指针的链表","frequency":0.0,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"ac","submitted":172548,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.516120820431828,"acs":198690,"articleLive":2,"columnArticles":1235,"formTitle":"[139]单词拆分","frequency":0.0,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"ac","submitted":384968,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.49131225009087603,"acs":54064,"articleLive":2,"columnArticles":553,"formTitle":"[140]单词拆分 II","frequency":0.0,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","submitted":110040,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.5125198476157312,"acs":541632,"articleLive":2,"columnArticles":2788,"formTitle":"[141]环形链表","frequency":0.0,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"ac","submitted":1056802,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5528248156068607,"acs":304005,"articleLive":2,"columnArticles":1779,"formTitle":"[142]环形链表 II","frequency":0.0,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"ac","submitted":549912,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6216840173219765,"acs":130065,"articleLive":2,"columnArticles":1103,"formTitle":"[143]重排链表","frequency":0.0,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"ac","submitted":209214,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7039830100844336,"acs":422972,"articleLive":2,"columnArticles":1877,"formTitle":"[144]二叉树的前序遍历","frequency":0.0,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","questionId":"144","status":"ac","submitted":600827,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.7507650922983957,"acs":308120,"articleLive":2,"columnArticles":1589,"formTitle":"[145]二叉树的后序遍历","frequency":0.0,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","questionId":"145","status":"ac","submitted":410408,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5260927542217428,"acs":239479,"articleLive":2,"columnArticles":1406,"formTitle":"[146]LRU 缓存机制","frequency":0.0,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","submitted":455203,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.6817526800624899,"acs":101243,"articleLive":2,"columnArticles":794,"formTitle":"[147]对链表进行插入排序","frequency":0.0,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"ac","submitted":148504,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6671152579037011,"acs":214643,"articleLive":2,"columnArticles":1267,"formTitle":"[148]排序链表","frequency":0.0,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"ac","submitted":321748,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.3424541140721646,"acs":47559,"articleLive":2,"columnArticles":521,"formTitle":"[149]直线上最多的点数","frequency":0.0,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"ac","submitted":138877,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.535551912048918,"acs":135229,"articleLive":2,"columnArticles":1066,"formTitle":"[150]逆波兰表达式求值","frequency":0.0,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"ac","submitted":252504,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.48426056574615334,"acs":172974,"articleLive":2,"columnArticles":1451,"formTitle":"[151]翻转字符串里的单词","frequency":0.0,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","submitted":357192,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.421526111621858,"acs":187988,"articleLive":2,"columnArticles":1263,"formTitle":"[152]乘积最大子数组","frequency":0.0,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","submitted":445970,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5669930423515903,"acs":215302,"articleLive":2,"columnArticles":1521,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":0.0,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"ac","submitted":379726,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.531614177243355,"acs":114683,"articleLive":2,"columnArticles":902,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":0.0,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"ac","submitted":215726,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5736958070016068,"acs":292403,"articleLive":2,"columnArticles":1625,"formTitle":"[155]最小栈","frequency":0.0,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"ac","submitted":509683,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7249592169657423,"acs":6666,"articleLive":2,"columnArticles":118,"formTitle":"[156]上下翻转二叉树","frequency":0.0,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"lock","submitted":9195,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5340583858042358,"acs":5598,"articleLive":2,"columnArticles":83,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"lock","submitted":10482,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5919170984455958,"acs":2856,"articleLive":2,"columnArticles":66,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":0.0,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","questionId":"158","status":"lock","submitted":4825,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5475778253046814,"acs":16130,"articleLive":2,"columnArticles":194,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":0.0,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","questionId":"159","status":"lock","submitted":29457,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6148020320594693,"acs":342730,"articleLive":2,"columnArticles":2002,"formTitle":"[160]相交链表","frequency":0.0,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"ac","submitted":557464,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.33656703373536095,"acs":7702,"articleLive":2,"columnArticles":105,"formTitle":"[161]相隔为 1 的编辑距离","frequency":0.0,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"lock","submitted":22884,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.4971224527563474,"acs":163862,"articleLive":2,"columnArticles":1110,"formTitle":"[162]寻找峰值","frequency":0.0,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"ac","submitted":329621,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.32684337013688136,"acs":9384,"articleLive":2,"columnArticles":145,"formTitle":"[163]缺失的区间","frequency":0.0,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"lock","submitted":28711,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6097558480878006,"acs":59614,"articleLive":2,"columnArticles":491,"formTitle":"[164]最大间距","frequency":0.0,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","submitted":97767,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.5192124161954524,"acs":87047,"articleLive":2,"columnArticles":931,"formTitle":"[165]比较版本号","frequency":0.0,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"ac","submitted":167652,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.33118514819306716,"acs":41780,"articleLive":2,"columnArticles":381,"formTitle":"[166]分数到小数","frequency":0.0,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","submitted":126153,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5866787768695125,"acs":300359,"articleLive":2,"columnArticles":1973,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":0.0,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"ac","submitted":511965,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.43256815648119995,"acs":85363,"articleLive":2,"columnArticles":763,"formTitle":"[168]Excel表列名称","frequency":0.0,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"ac","submitted":197340,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.6646413402548372,"acs":394345,"articleLive":2,"columnArticles":2227,"formTitle":"[169]多数元素","frequency":0.0,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","submitted":593320,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.4195757633406259,"acs":8822,"articleLive":2,"columnArticles":89,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":0.0,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"lock","submitted":21026,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7181148416103555,"acs":108291,"articleLive":2,"columnArticles":922,"formTitle":"[171]Excel 表列序号","frequency":0.0,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"ac","submitted":150799,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.4403745630018604,"acs":92081,"articleLive":2,"columnArticles":599,"formTitle":"[172]阶乘后的零","frequency":0.0,"frontendQuestionId":"172","leaf":true,"level":2,"nodeType":"def","questionId":"172","status":"","submitted":209097,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8046539657031696,"acs":76109,"articleLive":2,"columnArticles":638,"formTitle":"[173]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"ac","submitted":94586,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.48086282222028603,"acs":38633,"articleLive":2,"columnArticles":411,"formTitle":"[174]地下城游戏","frequency":0.0,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","submitted":80341,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7393393723822349,"acs":309086,"articleLive":2,"columnArticles":1481,"formTitle":"[175]组合两个表","frequency":0.0,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","submitted":418057,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.35581157279522424,"acs":255815,"articleLive":2,"columnArticles":1028,"formTitle":"[176]第二高的薪水","frequency":0.0,"frontendQuestionId":"176","leaf":true,"level":2,"nodeType":"def","questionId":"176","status":"","submitted":718962,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.46297190923428866,"acs":130334,"articleLive":2,"columnArticles":503,"formTitle":"[177]第N高的薪水","frequency":0.0,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","submitted":281516,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6034737381221129,"acs":121364,"articleLive":2,"columnArticles":679,"formTitle":"[178]分数排名","frequency":0.0,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","submitted":201109,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.40966300446861476,"acs":122937,"articleLive":2,"columnArticles":976,"formTitle":"[179]最大数","frequency":0.0,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"ac","submitted":300093,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.486901084672486,"acs":88746,"articleLive":2,"columnArticles":523,"formTitle":"[180]连续出现的数字","frequency":0.0,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","submitted":182267,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.7018569071799567,"acs":166345,"articleLive":2,"columnArticles":683,"formTitle":"[181]超过经理收入的员工","frequency":0.0,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","submitted":237007,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7967135905909292,"acs":183711,"articleLive":2,"columnArticles":598,"formTitle":"[182]查找重复的电子邮箱","frequency":0.0,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","submitted":230586,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.6768792099580058,"acs":152641,"articleLive":2,"columnArticles":553,"formTitle":"[183]从不订购的客户","frequency":0.0,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","submitted":225507,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.4773714458698933,"acs":104077,"articleLive":2,"columnArticles":681,"formTitle":"[184]部门工资最高的员工","frequency":0.0,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","submitted":218021,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.4970643632324431,"acs":72046,"articleLive":2,"columnArticles":640,"formTitle":"[185]部门工资前三高的所有员工","frequency":0.0,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","submitted":144943,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7567858892699657,"acs":7723,"articleLive":2,"columnArticles":118,"formTitle":"[186]翻转字符串里的单词 II","frequency":0.0,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"lock","submitted":10205,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.5211815763684726,"acs":74456,"articleLive":2,"columnArticles":543,"formTitle":"[187]重复的DNA序列","frequency":0.0,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"ac","submitted":142860,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.3929310441250489,"acs":91338,"articleLive":2,"columnArticles":707,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":0.0,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"","submitted":232453,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.4500346280740402,"acs":352198,"articleLive":2,"columnArticles":1757,"formTitle":"[189]旋转数组","frequency":0.0,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"ac","submitted":782602,"title":"旋转数组","titleSlug":"rotate-array"},{"acceptance":0.6987243060412773,"acs":133863,"articleLive":2,"columnArticles":839,"formTitle":"[190]颠倒二进制位","frequency":0.0,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"ac","submitted":191582,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7493650073484646,"acs":193244,"articleLive":2,"columnArticles":1216,"formTitle":"[191]位1的个数","frequency":0.0,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"ac","submitted":257877,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.35631567834462147,"acs":21938,"articleLive":2,"columnArticles":178,"formTitle":"[192]统计词频","frequency":0.0,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","submitted":61569,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.3252977808530618,"acs":26327,"articleLive":2,"columnArticles":140,"formTitle":"[193]有效电话号码","frequency":0.0,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","submitted":80932,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.3449260920112938,"acs":10384,"articleLive":2,"columnArticles":71,"formTitle":"[194]转置文件","frequency":0.0,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","submitted":30105,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.43626402993051844,"acs":35915,"articleLive":2,"columnArticles":143,"formTitle":"[195]第十行","frequency":0.0,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","submitted":82324,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6653598395697787,"acs":103186,"articleLive":2,"columnArticles":397,"formTitle":"[196]删除重复的电子邮箱","frequency":0.0,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","submitted":155083,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5339928659012373,"acs":95809,"articleLive":2,"columnArticles":514,"formTitle":"[197]上升的温度","frequency":0.0,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","submitted":179420,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.5161479833217223,"acs":397116,"articleLive":2,"columnArticles":2737,"formTitle":"[198]打家劫舍","frequency":0.0,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"ac","submitted":769384,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6526930423905238,"acs":144533,"articleLive":2,"columnArticles":1611,"formTitle":"[199]二叉树的右视图","frequency":0.0,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"ac","submitted":221441,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5579341899506053,"acs":337168,"articleLive":2,"columnArticles":2152,"formTitle":"[200]岛屿数量","frequency":0.0,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"ac","submitted":604315,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5244847915688423,"acs":50264,"articleLive":2,"columnArticles":329,"formTitle":"[201]数字范围按位与","frequency":0.0,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"ac","submitted":95835,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.619436066418367,"acs":173133,"articleLive":2,"columnArticles":1412,"formTitle":"[202]快乐数","frequency":0.0,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"ac","submitted":279501,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5168483636450211,"acs":238801,"articleLive":2,"columnArticles":1688,"formTitle":"[203]移除链表元素","frequency":0.0,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"ac","submitted":462033,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.37789666450397147,"acs":170657,"articleLive":2,"columnArticles":738,"formTitle":"[204]计数质数","frequency":0.0,"frontendQuestionId":"204","leaf":true,"level":2,"nodeType":"def","questionId":"204","status":"","submitted":451597,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.5005472217637913,"acs":115253,"articleLive":2,"columnArticles":885,"formTitle":"[205]同构字符串","frequency":0.0,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"ac","submitted":230254,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7234114693380397,"acs":727553,"articleLive":2,"columnArticles":7429,"formTitle":"[206]反转链表","frequency":0.0,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"ac","submitted":1005725,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.542961211435338,"acs":144893,"articleLive":2,"columnArticles":955,"formTitle":"[207]课程表","frequency":0.0,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","submitted":266857,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.7167206483666261,"acs":146712,"articleLive":2,"columnArticles":994,"formTitle":"[208]实现 Trie (前缀树)","frequency":0.0,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"ac","submitted":204699,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.47328901000465606,"acs":200250,"articleLive":2,"columnArticles":1416,"formTitle":"[209]长度最小的子数组","frequency":0.0,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"ac","submitted":423103,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.542922716516238,"acs":91312,"articleLive":2,"columnArticles":686,"formTitle":"[210]课程表 II","frequency":0.0,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","submitted":168186,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.4830024874408623,"acs":29709,"articleLive":2,"columnArticles":329,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":0.0,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"","submitted":61509,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.4628738881406604,"acs":62550,"articleLive":2,"columnArticles":576,"formTitle":"[212]单词搜索 II","frequency":0.0,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"ac","submitted":135134,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.433291938742792,"acs":170269,"articleLive":2,"columnArticles":1561,"formTitle":"[213]打家劫舍 II","frequency":0.0,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"ac","submitted":392966,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.3717381008761544,"acs":31397,"articleLive":2,"columnArticles":309,"formTitle":"[214]最短回文串","frequency":0.0,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","submitted":84460,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.6463550269873093,"acs":450386,"articleLive":2,"columnArticles":2338,"formTitle":"[215]数组中的第K个最大元素","frequency":0.0,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"ac","submitted":696809,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7368128336065988,"acs":102011,"articleLive":2,"columnArticles":1050,"formTitle":"[216]组合总和 III","frequency":0.0,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","submitted":138449,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5577530909761949,"acs":377808,"articleLive":2,"columnArticles":1766,"formTitle":"[217]存在重复元素","frequency":0.0,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"ac","submitted":677375,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5423832923832924,"acs":31788,"articleLive":2,"columnArticles":282,"formTitle":"[218]天际线问题","frequency":0.0,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"ac","submitted":58608,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.4247582248819896,"acs":112569,"articleLive":2,"columnArticles":904,"formTitle":"[219]存在重复元素 II","frequency":0.0,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"ac","submitted":265019,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.2866703921922371,"acs":65149,"articleLive":2,"columnArticles":426,"formTitle":"[220]存在重复元素 III","frequency":0.0,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"ac","submitted":227261,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.4772671550105629,"acs":142102,"articleLive":2,"columnArticles":1009,"formTitle":"[221]最大正方形","frequency":0.0,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","submitted":297741,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7821741133118378,"acs":118867,"articleLive":2,"columnArticles":893,"formTitle":"[222]完全二叉树的节点个数","frequency":0.0,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","submitted":151970,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.52338336089267,"acs":41464,"articleLive":2,"columnArticles":516,"formTitle":"[223]矩形面积","frequency":0.0,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"ac","submitted":79223,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.41782844306523703,"acs":72169,"articleLive":2,"columnArticles":662,"formTitle":"[224]基本计算器","frequency":0.0,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"ac","submitted":172724,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.6754677083027402,"acs":137994,"articleLive":2,"columnArticles":4765,"formTitle":"[225]用队列实现栈","frequency":0.0,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"ac","submitted":204294,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7882325018873546,"acs":312185,"articleLive":2,"columnArticles":1887,"formTitle":"[226]翻转二叉树","frequency":0.0,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"ac","submitted":396057,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.43774044338883594,"acs":87728,"articleLive":2,"columnArticles":708,"formTitle":"[227]基本计算器 II","frequency":0.0,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"ac","submitted":200411,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5796484551054134,"acs":57875,"articleLive":2,"columnArticles":654,"formTitle":"[228]汇总区间","frequency":0.0,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","submitted":99845,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.4649154327489003,"acs":37521,"articleLive":2,"columnArticles":320,"formTitle":"[229]求众数 II","frequency":0.0,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"","submitted":80705,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.742166460729335,"acs":140550,"articleLive":2,"columnArticles":889,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":0.0,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"ac","submitted":189378,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5044191284710111,"acs":170646,"articleLive":2,"columnArticles":1229,"formTitle":"[231]2 的幂","frequency":0.0,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"ac","submitted":338302,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6910821137625262,"acs":162962,"articleLive":2,"columnArticles":1288,"formTitle":"[232]用栈实现队列","frequency":0.0,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"ac","submitted":235807,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.4770871361321933,"acs":34762,"articleLive":2,"columnArticles":417,"formTitle":"[233]数字 1 的个数","frequency":0.0,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"ac","submitted":72863,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.49738940476545446,"acs":316942,"articleLive":2,"columnArticles":2025,"formTitle":"[234]回文链表","frequency":0.0,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"ac","submitted":637211,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.6662299138533894,"acs":173389,"articleLive":2,"columnArticles":997,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":0.0,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"","submitted":260254,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.681002732565047,"acs":263672,"articleLive":2,"columnArticles":1416,"formTitle":"[236]二叉树的最近公共祖先","frequency":0.0,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","submitted":387182,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.8479755538579068,"acs":212010,"articleLive":2,"columnArticles":1021,"formTitle":"[237]删除链表中的节点","frequency":0.0,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"ac","submitted":250019,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7236121930220163,"acs":141197,"articleLive":2,"columnArticles":893,"formTitle":"[238]除自身以外数组的乘积","frequency":0.0,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","submitted":195128,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.49695778693171083,"acs":197250,"articleLive":2,"columnArticles":1353,"formTitle":"[239]滑动窗口最大值","frequency":0.0,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"ac","submitted":396915,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.47873537822762857,"acs":172260,"articleLive":2,"columnArticles":780,"formTitle":"[240]搜索二维矩阵 II","frequency":0.0,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"","submitted":359823,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7381869896320763,"acs":32182,"articleLive":2,"columnArticles":290,"formTitle":"[241]为运算表达式设计优先级","frequency":0.0,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","submitted":43596,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6459156971067261,"acs":297678,"articleLive":2,"columnArticles":1722,"formTitle":"[242]有效的字母异位词","frequency":0.0,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"ac","submitted":460862,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6568584394671351,"acs":8974,"articleLive":2,"columnArticles":105,"formTitle":"[243]最短单词距离","frequency":0.0,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"lock","submitted":13662,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.5513291549600173,"acs":5102,"articleLive":2,"columnArticles":59,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"lock","submitted":9254,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.6009054740019207,"acs":4380,"articleLive":2,"columnArticles":60,"formTitle":"[245]最短单词距离 III","frequency":0.0,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"lock","submitted":7289,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.4754417247527962,"acs":5866,"articleLive":2,"columnArticles":108,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"lock","submitted":12338,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5246097245699513,"acs":5276,"articleLive":2,"columnArticles":92,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"lock","submitted":10057,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.46552924791086353,"acs":2674,"articleLive":2,"columnArticles":52,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"lock","submitted":5744,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.6384615384615384,"acs":5893,"articleLive":2,"columnArticles":102,"formTitle":"[249]移位字符串分组","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"lock","submitted":9230,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6347716447184085,"acs":4531,"articleLive":2,"columnArticles":77,"formTitle":"[250]统计同值子树","frequency":0.0,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"lock","submitted":7138,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5441976761288425,"acs":3700,"articleLive":2,"columnArticles":69,"formTitle":"[251]展开二维向量","frequency":0.0,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"lock","submitted":6799,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.564571060382916,"acs":12267,"articleLive":2,"columnArticles":159,"formTitle":"[252]会议室","frequency":0.0,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"lock","submitted":21728,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.5017422672499808,"acs":32686,"articleLive":2,"columnArticles":352,"formTitle":"[253]会议室 II","frequency":0.0,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"lock","submitted":65145,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5691656721275903,"acs":5246,"articleLive":2,"columnArticles":77,"formTitle":"[254]因子的组合","frequency":0.0,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"lock","submitted":9217,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.4756790903348073,"acs":5271,"articleLive":2,"columnArticles":62,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"lock","submitted":11081,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.6411140440661531,"acs":11901,"articleLive":2,"columnArticles":187,"formTitle":"[256]粉刷房子","frequency":0.0,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"lock","submitted":18563,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6830852477870266,"acs":144922,"articleLive":2,"columnArticles":1075,"formTitle":"[257]二叉树的所有路径","frequency":0.0,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"ac","submitted":212158,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6922258092662071,"acs":79336,"articleLive":2,"columnArticles":657,"formTitle":"[258]各位相加","frequency":0.0,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","submitted":114610,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5650294695481336,"acs":7190,"articleLive":2,"columnArticles":85,"formTitle":"[259]较小的三数之和","frequency":0.0,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"lock","submitted":12725,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7233246539673839,"acs":52781,"articleLive":2,"columnArticles":449,"formTitle":"[260]只出现一次的数字 III","frequency":0.0,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"ac","submitted":72970,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.4944552417971876,"acs":8650,"articleLive":2,"columnArticles":119,"formTitle":"[261]以图判树","frequency":0.0,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"lock","submitted":17494,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.43430640618713395,"acs":38860,"articleLive":2,"columnArticles":377,"formTitle":"[262]行程和用户","frequency":0.0,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","submitted":89476,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.515272002606013,"acs":107562,"articleLive":2,"columnArticles":840,"formTitle":"[263]丑数","frequency":0.0,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"ac","submitted":208748,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.5801278931971582,"acs":101335,"articleLive":2,"columnArticles":617,"formTitle":"[264]丑数 II","frequency":0.0,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","submitted":174677,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5903225806451613,"acs":6954,"articleLive":2,"columnArticles":155,"formTitle":"[265]粉刷房子 II","frequency":0.0,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"lock","submitted":11780,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6749802058590657,"acs":6820,"articleLive":2,"columnArticles":103,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"lock","submitted":10104,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.4471985540924348,"acs":3464,"articleLive":2,"columnArticles":77,"formTitle":"[267]回文排列 II","frequency":0.0,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"lock","submitted":7746,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6260113704247044,"acs":154047,"articleLive":2,"columnArticles":1122,"formTitle":"[268]丢失的数字","frequency":0.0,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"ac","submitted":246077,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.33842225927469777,"acs":6495,"articleLive":2,"columnArticles":108,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"lock","submitted":19192,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.5544096331809566,"acs":9945,"articleLive":2,"columnArticles":140,"formTitle":"[270]最接近的二叉搜索树值","frequency":0.0,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"lock","submitted":17938,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.5543163981825692,"acs":2684,"articleLive":2,"columnArticles":46,"formTitle":"[271]字符串的编码与解码","frequency":0.0,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"lock","submitted":4842,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.6487488415199258,"acs":3500,"articleLive":2,"columnArticles":76,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":0.0,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"lock","submitted":5395,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.3668453055755952,"acs":28476,"articleLive":2,"columnArticles":350,"formTitle":"[273]整数转换英文表示","frequency":0.0,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"ac","submitted":77624,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.44009169762545425,"acs":54137,"articleLive":2,"columnArticles":564,"formTitle":"[274]H 指数","frequency":0.0,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"ac","submitted":123013,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.4620997308963499,"acs":51172,"articleLive":2,"columnArticles":419,"formTitle":"[275]H 指数 II","frequency":0.0,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"ac","submitted":110738,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.4926379523875052,"acs":7160,"articleLive":2,"columnArticles":131,"formTitle":"[276]栅栏涂色","frequency":0.0,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"lock","submitted":14534,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.5703243407093058,"acs":7526,"articleLive":2,"columnArticles":85,"formTitle":"[277]搜寻名人","frequency":0.0,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"lock","submitted":13196,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.45338410660487777,"acs":190974,"articleLive":2,"columnArticles":1090,"formTitle":"[278]第一个错误的版本","frequency":0.0,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"ac","submitted":421219,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6324597033579004,"acs":206469,"articleLive":2,"columnArticles":1214,"formTitle":"[279]完全平方数","frequency":0.0,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"ac","submitted":326454,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6851248642779587,"acs":5679,"articleLive":2,"columnArticles":71,"formTitle":"[280]摆动排序","frequency":0.0,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"lock","submitted":8289,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7598482637875693,"acs":2604,"articleLive":2,"columnArticles":65,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"lock","submitted":3427,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.6391914445496261,"acs":504393,"articleLive":2,"columnArticles":3432,"formTitle":"[283]移动零","frequency":0.0,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"ac","submitted":789111,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.7711596805151384,"acs":24910,"articleLive":2,"columnArticles":210,"formTitle":"[284]窥探迭代器","frequency":0.0,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"ac","submitted":32302,"title":"窥探迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6353889497573956,"acs":8119,"articleLive":2,"columnArticles":104,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"lock","submitted":12778,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5096779831345305,"acs":11665,"articleLive":2,"columnArticles":150,"formTitle":"[286]墙与门","frequency":0.0,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"lock","submitted":22887,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.6591304347826087,"acs":181541,"articleLive":2,"columnArticles":1241,"formTitle":"[287]寻找重复数","frequency":0.0,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","submitted":275425,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.4342843208973421,"acs":3562,"articleLive":2,"columnArticles":55,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"lock","submitted":8202,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7535096126740711,"acs":53460,"articleLive":2,"columnArticles":831,"formTitle":"[289]生命游戏","frequency":0.0,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","submitted":70948,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.4564736038394415,"acs":83699,"articleLive":2,"columnArticles":1113,"formTitle":"[290]单词规律","frequency":0.0,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","submitted":183360,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.5314250155569384,"acs":2562,"articleLive":2,"columnArticles":56,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"lock","submitted":4821,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.7083627479266549,"acs":115393,"articleLive":2,"columnArticles":770,"formTitle":"[292]Nim 游戏","frequency":0.0,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"ac","submitted":162901,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7121407121407122,"acs":4980,"articleLive":2,"columnArticles":84,"formTitle":"[293]翻转游戏","frequency":0.0,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"lock","submitted":6993,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5809931778518166,"acs":3662,"articleLive":2,"columnArticles":55,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"lock","submitted":6303,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.523362976245285,"acs":64796,"articleLive":2,"columnArticles":507,"formTitle":"[295]数据流的中位数","frequency":0.0,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"ac","submitted":123807,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.6206211180124224,"acs":2498,"articleLive":2,"columnArticles":46,"formTitle":"[296]最佳的碰头地点","frequency":0.0,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"lock","submitted":4025,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.5605799319638748,"acs":106948,"articleLive":2,"columnArticles":768,"formTitle":"[297]二叉树的序列化与反序列化","frequency":0.0,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"ac","submitted":190781,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5780145951581143,"acs":4990,"articleLive":2,"columnArticles":82,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"lock","submitted":8633,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.5046939851110086,"acs":30643,"articleLive":2,"columnArticles":363,"formTitle":"[299]猜数字游戏","frequency":0.0,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"","submitted":60716,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5170310395150427,"acs":368457,"articleLive":2,"columnArticles":2038,"formTitle":"[300]最长递增子序列","frequency":0.0,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"ac","submitted":712640,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5239370397471625,"acs":33653,"articleLive":2,"columnArticles":237,"formTitle":"[301]删除无效的括号","frequency":0.0,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"","submitted":64231,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.656441717791411,"acs":2033,"articleLive":2,"columnArticles":39,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"lock","submitted":3097,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.7267990337463528,"acs":130278,"articleLive":2,"columnArticles":799,"formTitle":"[303]区域和检索 - 数组不可变","frequency":0.0,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","submitted":179249,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.5478537415256773,"acs":64083,"articleLive":2,"columnArticles":571,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":0.0,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","submitted":116971,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.38341695273303406,"acs":4356,"articleLive":2,"columnArticles":65,"formTitle":"[305]岛屿数量 II","frequency":0.0,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"lock","submitted":11361,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.3379274938788405,"acs":17114,"articleLive":2,"columnArticles":256,"formTitle":"[306]累加数","frequency":0.0,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","submitted":50644,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.539149589480008,"acs":24231,"articleLive":2,"columnArticles":232,"formTitle":"[307]区域和检索 - 数组可修改","frequency":0.0,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"ac","submitted":44943,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6106931757119828,"acs":2273,"articleLive":2,"columnArticles":43,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"lock","submitted":3722,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.6090391796272051,"acs":119555,"articleLive":2,"columnArticles":949,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":0.0,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"","submitted":196301,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.37950309494007306,"acs":22133,"articleLive":2,"columnArticles":214,"formTitle":"[310]最小高度树","frequency":0.0,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","submitted":58321,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7617336152219873,"acs":3603,"articleLive":2,"columnArticles":45,"formTitle":"[311]稀疏矩阵的乘法","frequency":0.0,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"lock","submitted":4730,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6831337445103074,"acs":56931,"articleLive":2,"columnArticles":386,"formTitle":"[312]戳气球","frequency":0.0,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","submitted":83338,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6282337471714268,"acs":41089,"articleLive":2,"columnArticles":356,"formTitle":"[313]超级丑数","frequency":0.0,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"ac","submitted":65404,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5466965021787775,"acs":4642,"articleLive":2,"columnArticles":87,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"lock","submitted":8491,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.4179374260549494,"acs":50868,"articleLive":2,"columnArticles":481,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":0.0,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"ac","submitted":121712,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.4762047562591534,"acs":68283,"articleLive":2,"columnArticles":539,"formTitle":"[316]去除重复字母","frequency":0.0,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"ac","submitted":143390,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.4840977569467693,"acs":4338,"articleLive":2,"columnArticles":64,"formTitle":"[317]离建筑物最近的距离","frequency":0.0,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"lock","submitted":8961,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.686092050209205,"acs":20497,"articleLive":2,"columnArticles":181,"formTitle":"[318]最大单词长度乘积","frequency":0.0,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","submitted":29875,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5188255535941725,"acs":23219,"articleLive":2,"columnArticles":229,"formTitle":"[319]灯泡开关","frequency":0.0,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"ac","submitted":44753,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.677397415552029,"acs":2988,"articleLive":2,"columnArticles":50,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"lock","submitted":4411,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.42396393546346095,"acs":26803,"articleLive":2,"columnArticles":232,"formTitle":"[321]拼接最大数","frequency":0.0,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","submitted":63220,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.4451038405769096,"acs":310958,"articleLive":2,"columnArticles":1841,"formTitle":"[322]零钱兑换","frequency":0.0,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"ac","submitted":698619,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.6320878869371174,"acs":11047,"articleLive":2,"columnArticles":152,"formTitle":"[323]无向图中连通分量的数目","frequency":0.0,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"lock","submitted":17477,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.37854735721887195,"acs":25611,"articleLive":2,"columnArticles":169,"formTitle":"[324]摆动排序 II","frequency":0.0,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"ac","submitted":67656,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.536936834311101,"acs":9427,"articleLive":2,"columnArticles":106,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":0.0,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"lock","submitted":17557,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.5045290690595402,"acs":136741,"articleLive":2,"columnArticles":584,"formTitle":"[326]3的幂","frequency":0.0,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"ac","submitted":271027,"title":"3的幂","titleSlug":"power-of-three"},{"acceptance":0.4207813347802496,"acs":24816,"articleLive":2,"columnArticles":206,"formTitle":"[327]区间和的个数","frequency":0.0,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","submitted":58976,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6558388302716519,"acs":130346,"articleLive":2,"columnArticles":1073,"formTitle":"[328]奇偶链表","frequency":0.0,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"ac","submitted":198747,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.4865460321255647,"acs":56976,"articleLive":2,"columnArticles":501,"formTitle":"[329]矩阵中的最长递增路径","frequency":0.0,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","submitted":117103,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5334269268566615,"acs":18998,"articleLive":2,"columnArticles":150,"formTitle":"[330]按要求补齐数组","frequency":0.0,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","submitted":35615,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.47989800254993625,"acs":45168,"articleLive":2,"columnArticles":508,"formTitle":"[331]验证二叉树的前序序列化","frequency":0.0,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"ac","submitted":94120,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.449654292810633,"acs":40191,"articleLive":2,"columnArticles":331,"formTitle":"[332]重新安排行程","frequency":0.0,"frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","questionId":"332","status":"","submitted":89382,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.47001176009408074,"acs":4796,"articleLive":2,"columnArticles":81,"formTitle":"[333]最大 BST 子树","frequency":0.0,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"lock","submitted":10204,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.4120275064605142,"acs":47035,"articleLive":2,"columnArticles":310,"formTitle":"[334]递增的三元子序列","frequency":0.0,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","submitted":114155,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.370048309178744,"acs":3064,"articleLive":2,"columnArticles":38,"formTitle":"[335]路径交叉","frequency":0.0,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"","submitted":8280,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.4013605442176871,"acs":22243,"articleLive":2,"columnArticles":193,"formTitle":"[336]回文对","frequency":0.0,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","submitted":55419,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6079869563220502,"acs":132377,"articleLive":2,"columnArticles":937,"formTitle":"[337]打家劫舍 III","frequency":0.0,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","submitted":217730,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7868949778355205,"acs":161714,"articleLive":2,"columnArticles":1392,"formTitle":"[338]比特位计数","frequency":0.0,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"","submitted":205509,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8098515809851581,"acs":3765,"articleLive":2,"columnArticles":58,"formTitle":"[339]嵌套列表权重和","frequency":0.0,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"lock","submitted":4649,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.4939793695804052,"acs":12020,"articleLive":2,"columnArticles":178,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":0.0,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","questionId":"340","status":"lock","submitted":24333,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.7271222410865874,"acs":51393,"articleLive":2,"columnArticles":490,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":0.0,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"ac","submitted":70680,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5162122761847658,"acs":87817,"articleLive":2,"columnArticles":774,"formTitle":"[342]4的幂","frequency":0.0,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"ac","submitted":170118,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.6064766783383045,"acs":112237,"articleLive":2,"columnArticles":1064,"formTitle":"[343]整数拆分","frequency":0.0,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"ac","submitted":185064,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.7694621021385214,"acs":375606,"articleLive":2,"columnArticles":1980,"formTitle":"[344]反转字符串","frequency":0.0,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"ac","submitted":488141,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5392767280082885,"acs":109306,"articleLive":2,"columnArticles":1039,"formTitle":"[345]反转字符串中的元音字母","frequency":0.0,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"ac","submitted":202690,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7057356608478803,"acs":12452,"articleLive":2,"columnArticles":135,"formTitle":"[346]数据流中的移动平均值","frequency":0.0,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"lock","submitted":17644,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.6222278004772432,"acs":205739,"articleLive":2,"columnArticles":1517,"formTitle":"[347]前 K 个高频元素","frequency":0.0,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"ac","submitted":330649,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.6004364165353376,"acs":4953,"articleLive":2,"columnArticles":80,"formTitle":"[348]设计井字棋","frequency":0.0,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"lock","submitted":8249,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.7379902450928886,"acs":217730,"articleLive":2,"columnArticles":1536,"formTitle":"[349]两个数组的交集","frequency":0.0,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"ac","submitted":295031,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5504096091627882,"acs":254505,"articleLive":2,"columnArticles":1425,"formTitle":"[350]两个数组的交集 II","frequency":0.0,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"ac","submitted":462392,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5904406928305196,"acs":5386,"articleLive":2,"columnArticles":100,"formTitle":"[351]安卓系统手势解锁","frequency":0.0,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"lock","submitted":9122,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.6795123226776492,"acs":20789,"articleLive":2,"columnArticles":343,"formTitle":"[352]将数据流变为多个不相交区间","frequency":0.0,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"ac","submitted":30594,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.4287624140565317,"acs":2245,"articleLive":2,"columnArticles":48,"formTitle":"[353]贪吃蛇","frequency":0.0,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"lock","submitted":5236,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.45416190390567807,"acs":70723,"articleLive":2,"columnArticles":547,"formTitle":"[354]俄罗斯套娃信封问题","frequency":0.0,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","submitted":155722,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.40808108436664237,"acs":26855,"articleLive":2,"columnArticles":440,"formTitle":"[355]设计推特","frequency":0.0,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","submitted":65808,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.35288966725043786,"acs":1612,"articleLive":2,"columnArticles":40,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"lock","submitted":4568,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.5206341902152315,"acs":24891,"articleLive":2,"columnArticles":390,"formTitle":"[357]计算各个位数不同的数字个数","frequency":0.0,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","submitted":47809,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.351638827607942,"acs":4463,"articleLive":2,"columnArticles":60,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.0,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"lock","submitted":12692,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.7265287903585776,"acs":4883,"articleLive":2,"columnArticles":58,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"lock","submitted":6721,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.6016649323621228,"acs":2891,"articleLive":2,"columnArticles":63,"formTitle":"[360]有序转化数组","frequency":0.0,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"lock","submitted":4805,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5670700528379069,"acs":3327,"articleLive":2,"columnArticles":65,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"lock","submitted":5867,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6913223140495868,"acs":3346,"articleLive":2,"columnArticles":63,"formTitle":"[362]敲击计数器","frequency":0.0,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"lock","submitted":4840,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.4894926892795833,"acs":33076,"articleLive":2,"columnArticles":214,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":0.0,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"ac","submitted":67572,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.7220062208398134,"acs":1857,"articleLive":2,"columnArticles":48,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"lock","submitted":2572,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.3658279909367181,"acs":34067,"articleLive":2,"columnArticles":484,"formTitle":"[365]水壶问题","frequency":0.0,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","submitted":93123,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7653532126375577,"acs":4312,"articleLive":2,"columnArticles":122,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.0,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"lock","submitted":5634,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.4386418312838747,"acs":78584,"articleLive":2,"columnArticles":630,"formTitle":"[367]有效的完全平方数","frequency":0.0,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","submitted":179153,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.4589930889685942,"acs":41974,"articleLive":2,"columnArticles":455,"formTitle":"[368]最大整除子集","frequency":0.0,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"ac","submitted":91448,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.61792839573654,"acs":4522,"articleLive":2,"columnArticles":131,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"lock","submitted":7318,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.7233995584988963,"acs":3277,"articleLive":2,"columnArticles":49,"formTitle":"[370]区间加法","frequency":0.0,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"lock","submitted":4530,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.6127467304432066,"acs":80961,"articleLive":2,"columnArticles":508,"formTitle":"[371]两整数之和","frequency":0.0,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"ac","submitted":132128,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5109437180216032,"acs":14380,"articleLive":2,"columnArticles":136,"formTitle":"[372]超级次方","frequency":0.0,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","submitted":28144,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.4161236306413541,"acs":20626,"articleLive":2,"columnArticles":211,"formTitle":"[373]查找和最小的K对数字","frequency":0.0,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"ac","submitted":49567,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5156488995091866,"acs":83943,"articleLive":2,"columnArticles":572,"formTitle":"[374]猜数字大小","frequency":0.0,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"ac","submitted":162791,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.4701083492670491,"acs":14752,"articleLive":2,"columnArticles":125,"formTitle":"[375]猜数字大小 II","frequency":0.0,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"","submitted":31380,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.46473528043172163,"acs":76903,"articleLive":2,"columnArticles":827,"formTitle":"[376]摆动序列","frequency":0.0,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"ac","submitted":165477,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5093062736920442,"acs":65700,"articleLive":2,"columnArticles":558,"formTitle":"[377]组合总和 Ⅳ","frequency":0.0,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"ac","submitted":128999,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6391223118813849,"acs":80392,"articleLive":2,"columnArticles":566,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":0.0,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"ac","submitted":125785,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6388446215139443,"acs":3207,"articleLive":2,"columnArticles":69,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"lock","submitted":5020,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.5034033991181129,"acs":35277,"articleLive":2,"columnArticles":221,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":0.0,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"ac","submitted":70077,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.44133508234951174,"acs":21196,"articleLive":2,"columnArticles":176,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":0.0,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","submitted":48027,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.6325678496868476,"acs":16059,"articleLive":2,"columnArticles":126,"formTitle":"[382]链表随机节点","frequency":0.0,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","submitted":25387,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.6026364873720824,"acs":71727,"articleLive":2,"columnArticles":786,"formTitle":"[383]赎金信","frequency":0.0,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"ac","submitted":119022,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.57970521043845,"acs":52781,"articleLive":2,"columnArticles":200,"formTitle":"[384]打乱数组","frequency":0.0,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"ac","submitted":91048,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.4181510710259301,"acs":7418,"articleLive":2,"columnArticles":86,"formTitle":"[385]迷你语法分析器","frequency":0.0,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"ac","submitted":17740,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7500414607449667,"acs":22613,"articleLive":2,"columnArticles":242,"formTitle":"[386]字典序排数","frequency":0.0,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","submitted":30149,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5345341217457251,"acs":225544,"articleLive":2,"columnArticles":1224,"formTitle":"[387]字符串中的第一个唯一字符","frequency":0.0,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"ac","submitted":421945,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5287336545079147,"acs":6146,"articleLive":2,"columnArticles":112,"formTitle":"[388]文件的最长绝对路径","frequency":0.0,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","submitted":11624,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6914952259750512,"acs":101609,"articleLive":2,"columnArticles":998,"formTitle":"[389]找不同","frequency":0.0,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","submitted":146941,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.4663046322952107,"acs":7127,"articleLive":2,"columnArticles":97,"formTitle":"[390]消除游戏","frequency":0.0,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","submitted":15284,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.3588663347376484,"acs":4685,"articleLive":2,"columnArticles":67,"formTitle":"[391]完美矩形","frequency":0.0,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","submitted":13055,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.5152066608432816,"acs":148633,"articleLive":2,"columnArticles":1592,"formTitle":"[392]判断子序列","frequency":0.0,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"ac","submitted":288492,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.3910739974035999,"acs":11146,"articleLive":2,"columnArticles":127,"formTitle":"[393]UTF-8 编码验证","frequency":0.0,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","submitted":28501,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.552933690615954,"acs":123396,"articleLive":2,"columnArticles":1315,"formTitle":"[394]字符串解码","frequency":0.0,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"ac","submitted":223166,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5205039451765104,"acs":52180,"articleLive":2,"columnArticles":431,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":0.0,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"","submitted":100249,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.42944129404108955,"acs":9239,"articleLive":2,"columnArticles":149,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","submitted":21514,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.3767233318148033,"acs":15712,"articleLive":2,"columnArticles":195,"formTitle":"[397]整数替换","frequency":0.0,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","submitted":41707,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6582398269568744,"acs":14607,"articleLive":2,"columnArticles":123,"formTitle":"[398]随机数索引","frequency":0.0,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","submitted":22191,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.5919086905624616,"acs":42473,"articleLive":2,"columnArticles":531,"formTitle":"[399]除法求值","frequency":0.0,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","submitted":71756,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.41729001923487924,"acs":19525,"articleLive":2,"columnArticles":201,"formTitle":"[400]第 N 位数字","frequency":0.0,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"ac","submitted":46790,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6140506185450005,"acs":54104,"articleLive":2,"columnArticles":658,"formTitle":"[401]二进制手表","frequency":0.0,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","submitted":88110,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.3271352423453576,"acs":81809,"articleLive":2,"columnArticles":592,"formTitle":"[402]移掉 K 位数字","frequency":0.0,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"ac","submitted":250077,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.45566945152179494,"acs":46142,"articleLive":2,"columnArticles":463,"formTitle":"[403]青蛙过河","frequency":0.0,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"ac","submitted":101262,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5844300129425374,"acs":102052,"articleLive":2,"columnArticles":1135,"formTitle":"[404]左叶子之和","frequency":0.0,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"ac","submitted":174618,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5618135392359287,"acs":45985,"articleLive":2,"columnArticles":463,"formTitle":"[405]数字转换为十六进制数","frequency":0.0,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"ac","submitted":81851,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7377731719954891,"acs":121028,"articleLive":2,"columnArticles":801,"formTitle":"[406]根据身高重建队列","frequency":0.0,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","submitted":164045,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.48301677526687925,"acs":10452,"articleLive":2,"columnArticles":130,"formTitle":"[407]接雨水 II","frequency":0.0,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"","submitted":21639,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.3246492985971944,"acs":3564,"articleLive":2,"columnArticles":83,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"lock","submitted":10978,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.5561471526804969,"acs":95679,"articleLive":2,"columnArticles":1339,"formTitle":"[409]最长回文串","frequency":0.0,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","submitted":172039,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5648532580005422,"acs":39590,"articleLive":2,"columnArticles":321,"formTitle":"[410]分割数组的最大值","frequency":0.0,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","submitted":70089,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.5049668874172185,"acs":915,"articleLive":2,"columnArticles":22,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"lock","submitted":1812,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.7082197090294985,"acs":102325,"articleLive":2,"columnArticles":590,"formTitle":"[412]Fizz Buzz","frequency":0.0,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"ac","submitted":144482,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6881592152852734,"acs":72682,"articleLive":2,"columnArticles":941,"formTitle":"[413]等差数列划分","frequency":0.0,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"ac","submitted":105618,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.39351735862562637,"acs":87959,"articleLive":2,"columnArticles":1146,"formTitle":"[414]第三大的数","frequency":0.0,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"ac","submitted":223520,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5386221666328141,"acs":151153,"articleLive":2,"columnArticles":1094,"formTitle":"[415]字符串相加","frequency":0.0,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","submitted":280629,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.5078735528349666,"acs":177095,"articleLive":2,"columnArticles":1004,"formTitle":"[416]分割等和子集","frequency":0.0,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"ac","submitted":348699,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.4813100992551563,"acs":27980,"articleLive":2,"columnArticles":330,"formTitle":"[417]太平洋大西洋水流问题","frequency":0.0,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"ac","submitted":58133,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.3612117220941719,"acs":2194,"articleLive":2,"columnArticles":34,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"lock","submitted":6074,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7555040556199305,"acs":12388,"articleLive":2,"columnArticles":158,"formTitle":"[419]甲板上的战舰","frequency":0.0,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","submitted":16397,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.20865521638040951,"acs":2782,"articleLive":2,"columnArticles":53,"formTitle":"[420]强密码检验器","frequency":0.0,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","submitted":13333,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6219125438400119,"acs":33337,"articleLive":2,"columnArticles":307,"formTitle":"[421]数组中两个数的最大异或值","frequency":0.0,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"ac","submitted":53604,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.42772361169987283,"acs":2018,"articleLive":2,"columnArticles":49,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"lock","submitted":4718,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.5689482470784641,"acs":8520,"articleLive":2,"columnArticles":138,"formTitle":"[423]从英文中重建数字","frequency":0.0,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","submitted":14975,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.5316515263114822,"acs":51970,"articleLive":2,"columnArticles":455,"formTitle":"[424]替换后的最长重复字符","frequency":0.0,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"ac","submitted":97752,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6165533786485405,"acs":1542,"articleLive":2,"columnArticles":31,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"lock","submitted":2501,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6695205479452054,"acs":7038,"articleLive":2,"columnArticles":115,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":0.0,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"lock","submitted":10512,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.6135523006361888,"acs":4147,"articleLive":2,"columnArticles":67,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","submitted":6759,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.65380859375,"acs":2678,"articleLive":2,"columnArticles":54,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"lock","submitted":4096,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.7001892625812595,"acs":59563,"articleLive":2,"columnArticles":478,"formTitle":"[429]N 叉树的层序遍历","frequency":0.0,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"ac","submitted":85067,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5878947578552322,"acs":44175,"articleLive":2,"columnArticles":674,"formTitle":"[430]扁平化多级双向链表","frequency":0.0,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"ac","submitted":75141,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7339449541284404,"acs":880,"articleLive":2,"columnArticles":29,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"771","status":"lock","submitted":1199,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.37930055637561033,"acs":6681,"articleLive":2,"columnArticles":86,"formTitle":"[432]全 O(1) 的数据结构","frequency":0.0,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","submitted":17614,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.5319646135870473,"acs":15935,"articleLive":2,"columnArticles":216,"formTitle":"[433]最小基因变化","frequency":0.0,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","submitted":29955,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.39906103286384975,"acs":63240,"articleLive":2,"columnArticles":875,"formTitle":"[434]字符串中的单词数","frequency":0.0,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"ac","submitted":158472,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5075017014168162,"acs":98433,"articleLive":2,"columnArticles":865,"formTitle":"[435]无重叠区间","frequency":0.0,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"ac","submitted":193956,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.48842427891193696,"acs":8924,"articleLive":2,"columnArticles":146,"formTitle":"[436]寻找右区间","frequency":0.0,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"ac","submitted":18271,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5742919888365283,"acs":125523,"articleLive":2,"columnArticles":1033,"formTitle":"[437]路径总和 III","frequency":0.0,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"ac","submitted":218570,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5188623778675732,"acs":97075,"articleLive":2,"columnArticles":853,"formTitle":"[438]找到字符串中所有字母异位词","frequency":0.0,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"ac","submitted":187092,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5908998578102783,"acs":2909,"articleLive":2,"columnArticles":68,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"lock","submitted":4923,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.3803487974467115,"acs":16684,"articleLive":2,"columnArticles":124,"formTitle":"[440]字典序的第K小数字","frequency":0.0,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","submitted":43865,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.4590090196728297,"acs":77556,"articleLive":2,"columnArticles":745,"formTitle":"[441]排列硬币","frequency":0.0,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"ac","submitted":168964,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6975167159319033,"acs":44127,"articleLive":2,"columnArticles":445,"formTitle":"[442]数组中重复的数据","frequency":0.0,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","submitted":63263,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.4773066322789451,"acs":56631,"articleLive":2,"columnArticles":694,"formTitle":"[443]压缩字符串","frequency":0.0,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"ac","submitted":118647,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.2523378141437756,"acs":3454,"articleLive":2,"columnArticles":54,"formTitle":"[444]序列重建","frequency":0.0,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"lock","submitted":13688,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5884995697741667,"acs":83441,"articleLive":2,"columnArticles":941,"formTitle":"[445]两数相加 II","frequency":0.0,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"ac","submitted":141786,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5512981455064194,"acs":19323,"articleLive":2,"columnArticles":173,"formTitle":"[446]等差数列划分 II - 子序列","frequency":0.0,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"ac","submitted":35050,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6628994227172941,"acs":48918,"articleLive":2,"columnArticles":378,"formTitle":"[447]回旋镖的数量","frequency":0.0,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"ac","submitted":73794,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6488809910358334,"acs":139488,"articleLive":2,"columnArticles":1102,"formTitle":"[448]找到所有数组中消失的数字","frequency":0.0,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","submitted":214967,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.558634782920446,"acs":15582,"articleLive":2,"columnArticles":137,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":0.0,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"","submitted":27893,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.4869748922100667,"acs":62007,"articleLive":2,"columnArticles":627,"formTitle":"[450]删除二叉搜索树中的节点","frequency":0.0,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","submitted":127331,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7116673150909956,"acs":82315,"articleLive":2,"columnArticles":955,"formTitle":"[451]根据字符出现频率排序","frequency":0.0,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"ac","submitted":115665,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5088779125397606,"acs":98389,"articleLive":2,"columnArticles":858,"formTitle":"[452]用最少数量的箭引爆气球","frequency":0.0,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"ac","submitted":193345,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.556446118703162,"acs":27770,"articleLive":2,"columnArticles":315,"formTitle":"[453]最小操作次数使数组元素相等","frequency":0.0,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"","submitted":49906,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.603556990285404,"acs":80022,"articleLive":2,"columnArticles":503,"formTitle":"[454]四数相加 II","frequency":0.0,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"ac","submitted":132584,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5769183378574656,"acs":154512,"articleLive":2,"columnArticles":1270,"formTitle":"[455]分发饼干","frequency":0.0,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"ac","submitted":267823,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.3625543385409746,"acs":57297,"articleLive":2,"columnArticles":463,"formTitle":"[456]132 模式","frequency":0.0,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"ac","submitted":158037,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.43614083274225435,"acs":28900,"articleLive":2,"columnArticles":332,"formTitle":"[457]环形数组是否存在循环","frequency":0.0,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"ac","submitted":66263,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.612193588937775,"acs":6818,"articleLive":2,"columnArticles":65,"formTitle":"[458]可怜的小猪","frequency":0.0,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","submitted":11137,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5112343861074439,"acs":80546,"articleLive":2,"columnArticles":647,"formTitle":"[459]重复的子字符串","frequency":0.0,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","submitted":157552,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.4375821120167349,"acs":34306,"articleLive":2,"columnArticles":405,"formTitle":"[460]LFU 缓存","frequency":0.0,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","submitted":78399,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8122958447280462,"acs":171089,"articleLive":2,"columnArticles":1365,"formTitle":"[461]汉明距离","frequency":0.0,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"ac","submitted":210624,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6054944588340198,"acs":14260,"articleLive":2,"columnArticles":133,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":0.0,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","submitted":23551,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7086603493797244,"acs":78375,"articleLive":2,"columnArticles":945,"formTitle":"[463]岛屿的周长","frequency":0.0,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","submitted":110596,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.3557455669842872,"acs":11275,"articleLive":2,"columnArticles":112,"formTitle":"[464]我能赢吗","frequency":0.0,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","submitted":31694,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.5302432610124918,"acs":1613,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.0,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"lock","submitted":3042,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.3740168854932426,"acs":11651,"articleLive":2,"columnArticles":181,"formTitle":"[466]统计重复个数","frequency":0.0,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","submitted":31151,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.4414941494149415,"acs":8829,"articleLive":2,"columnArticles":114,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":0.0,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","submitted":19998,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.2516684071808643,"acs":25304,"articleLive":2,"columnArticles":299,"formTitle":"[468]验证IP地址","frequency":0.0,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","submitted":100545,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.434331797235023,"acs":1508,"articleLive":2,"columnArticles":21,"formTitle":"[469]凸多边形","frequency":0.0,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"lock","submitted":3472,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.5470170684527613,"acs":64193,"articleLive":2,"columnArticles":337,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":0.0,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"ac","submitted":117351,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6171376481312671,"acs":1354,"articleLive":2,"columnArticles":25,"formTitle":"[471]编码最短长度的字符串","frequency":0.0,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"lock","submitted":2194,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.39849038519139757,"acs":6652,"articleLive":2,"columnArticles":81,"formTitle":"[472]连接词","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","submitted":16693,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.42025025738496874,"acs":21226,"articleLive":2,"columnArticles":182,"formTitle":"[473]火柴拼正方形","frequency":0.0,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","submitted":50508,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6123400049816402,"acs":76210,"articleLive":2,"columnArticles":608,"formTitle":"[474]一和零","frequency":0.0,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"ac","submitted":124457,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.33477348286375264,"acs":21851,"articleLive":2,"columnArticles":244,"formTitle":"[475]供暖器","frequency":0.0,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","submitted":65271,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7011580882352941,"acs":38143,"articleLive":2,"columnArticles":490,"formTitle":"[476]数字的补数","frequency":0.0,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"","submitted":54400,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6039292791676988,"acs":39009,"articleLive":2,"columnArticles":329,"formTitle":"[477]汉明距离总和","frequency":0.0,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"ac","submitted":64592,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.43812818169951706,"acs":6713,"articleLive":2,"columnArticles":49,"formTitle":"[478]在圆内随机生成点","frequency":0.0,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","submitted":15322,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.4198752711496746,"acs":3097,"articleLive":2,"columnArticles":25,"formTitle":"[479]最大回文数乘积","frequency":0.0,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"ac","submitted":7376,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.447902039830291,"acs":29665,"articleLive":2,"columnArticles":405,"formTitle":"[480]滑动窗口中位数","frequency":0.0,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"ac","submitted":66231,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.541737972998669,"acs":5698,"articleLive":2,"columnArticles":98,"formTitle":"[481]神奇字符串","frequency":0.0,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","submitted":10518,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.4722517689497295,"acs":40846,"articleLive":2,"columnArticles":435,"formTitle":"[482]密钥格式化","frequency":0.0,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"ac","submitted":86492,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5906129252216077,"acs":15591,"articleLive":2,"columnArticles":117,"formTitle":"[483]最小好进制","frequency":0.0,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"notac","submitted":26398,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6361674579197237,"acs":1474,"articleLive":2,"columnArticles":34,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"lock","submitted":2317,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6072137705850341,"acs":123854,"articleLive":2,"columnArticles":999,"formTitle":"[485]最大连续 1 的个数","frequency":0.0,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","submitted":203971,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5864370073783083,"acs":46576,"articleLive":2,"columnArticles":404,"formTitle":"[486]预测赢家","frequency":0.0,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"ac","submitted":79422,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5785596588155472,"acs":5969,"articleLive":2,"columnArticles":115,"formTitle":"[487]最大连续1的个数 II","frequency":0.0,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"lock","submitted":10317,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.3880171184022825,"acs":3536,"articleLive":2,"columnArticles":73,"formTitle":"[488]祖玛游戏","frequency":0.0,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"","submitted":9113,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.7205105633802817,"acs":1637,"articleLive":2,"columnArticles":24,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"lock","submitted":2272,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.48405160192798413,"acs":6829,"articleLive":2,"columnArticles":82,"formTitle":"[490]迷宫","frequency":0.0,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"lock","submitted":14108,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.5457576376131184,"acs":48126,"articleLive":2,"columnArticles":408,"formTitle":"[491]递增子序列","frequency":0.0,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"ac","submitted":88182,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.5523289970625263,"acs":19743,"articleLive":2,"columnArticles":185,"formTitle":"[492]构造矩形","frequency":0.0,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","submitted":35745,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.345899616907993,"acs":26636,"articleLive":2,"columnArticles":268,"formTitle":"[493]翻转对","frequency":0.0,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","submitted":77005,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.493040444635565,"acs":152491,"articleLive":2,"columnArticles":1050,"formTitle":"[494]目标和","frequency":0.0,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"ac","submitted":309287,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.5430989388731131,"acs":29071,"articleLive":2,"columnArticles":444,"formTitle":"[495]提莫攻击","frequency":0.0,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"","submitted":53528,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.687408100962014,"acs":104253,"articleLive":2,"columnArticles":1078,"formTitle":"[496]下一个更大元素 I","frequency":0.0,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"ac","submitted":151661,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.4040485829959514,"acs":2994,"articleLive":2,"columnArticles":36,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.0,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","submitted":7410,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.4692588299105576,"acs":44123,"articleLive":2,"columnArticles":456,"formTitle":"[498]对角线遍历","frequency":0.0,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","submitted":94027,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.37243607754987357,"acs":2651,"articleLive":2,"columnArticles":49,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"lock","submitted":7118,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.7094839034665934,"acs":30986,"articleLive":2,"columnArticles":483,"formTitle":"[500]键盘行","frequency":0.0,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"","submitted":43674,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5132977080373139,"acs":66470,"articleLive":2,"columnArticles":550,"formTitle":"[501]二叉搜索树中的众数","frequency":0.0,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","submitted":129496,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.44138957368769166,"acs":29363,"articleLive":2,"columnArticles":357,"formTitle":"[502]IPO","frequency":0.0,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"ac","submitted":66524,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6360755048824129,"acs":104158,"articleLive":2,"columnArticles":989,"formTitle":"[503]下一个更大元素 II","frequency":0.0,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"ac","submitted":163751,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5037867116423139,"acs":31065,"articleLive":2,"columnArticles":327,"formTitle":"[504]七进制数","frequency":0.0,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","submitted":61663,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.484201537147737,"acs":5670,"articleLive":2,"columnArticles":69,"formTitle":"[505]迷宫 II","frequency":0.0,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"lock","submitted":11710,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.5633121478012505,"acs":21892,"articleLive":2,"columnArticles":297,"formTitle":"[506]相对名次","frequency":0.0,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","submitted":38863,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.41260193556426267,"acs":29801,"articleLive":2,"columnArticles":236,"formTitle":"[507]完美数","frequency":0.0,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","submitted":72227,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6776806553475814,"acs":14808,"articleLive":2,"columnArticles":212,"formTitle":"[508]出现次数最多的子树元素和","frequency":0.0,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","submitted":21851,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6742435112664502,"acs":249046,"articleLive":2,"columnArticles":1510,"formTitle":"[509]斐波那契数","frequency":0.0,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"ac","submitted":369371,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6074921572245802,"acs":3292,"articleLive":2,"columnArticles":55,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":0.0,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"lock","submitted":5419,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7319456403728801,"acs":19551,"articleLive":2,"columnArticles":108,"formTitle":"[511]游戏玩法分析 I","frequency":0.0,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"lock","submitted":26711,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5377237103754825,"acs":18388,"articleLive":2,"columnArticles":150,"formTitle":"[512]游戏玩法分析 II","frequency":0.0,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"lock","submitted":34196,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7309497962808927,"acs":51847,"articleLive":2,"columnArticles":578,"formTitle":"[513]找树左下角的值","frequency":0.0,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","submitted":70931,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.5000506047264814,"acs":19763,"articleLive":2,"columnArticles":244,"formTitle":"[514]自由之路","frequency":0.0,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","submitted":39522,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.6448191505081518,"acs":39274,"articleLive":2,"columnArticles":427,"formTitle":"[515]在每个树行中找最大值","frequency":0.0,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","submitted":60907,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6543693245195726,"acs":87410,"articleLive":2,"columnArticles":629,"formTitle":"[516]最长回文子序列","frequency":0.0,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"ac","submitted":133579,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.5098895861466359,"acs":19257,"articleLive":2,"columnArticles":167,"formTitle":"[517]超级洗衣机","frequency":0.0,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"ac","submitted":37767,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.6576812133060671,"acs":109669,"articleLive":2,"columnArticles":690,"formTitle":"[518]零钱兑换 II","frequency":0.0,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"ac","submitted":166751,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.397588611272516,"acs":2737,"articleLive":2,"columnArticles":39,"formTitle":"[519]随机翻转矩阵","frequency":0.0,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","submitted":6884,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5639720544965208,"acs":40443,"articleLive":2,"columnArticles":653,"formTitle":"[520]检测大写字母","frequency":0.0,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"","submitted":71711,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7134335015192484,"acs":25593,"articleLive":2,"columnArticles":254,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":0.0,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","submitted":35873,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.3621487951173314,"acs":6883,"articleLive":2,"columnArticles":107,"formTitle":"[522]最长特殊序列 II","frequency":0.0,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","submitted":19006,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.2746504308343223,"acs":69199,"articleLive":2,"columnArticles":607,"formTitle":"[523]连续的子数组和","frequency":0.0,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"ac","submitted":251953,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.4957429445766746,"acs":72899,"articleLive":2,"columnArticles":759,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":0.0,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"ac","submitted":147050,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.535952024694558,"acs":45490,"articleLive":2,"columnArticles":518,"formTitle":"[525]连续数组","frequency":0.0,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"ac","submitted":84877,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7349939380579742,"acs":33343,"articleLive":2,"columnArticles":381,"formTitle":"[526]优美的排列","frequency":0.0,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"ac","submitted":45365,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.578368999421631,"acs":2000,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"lock","submitted":3458,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.47703817206724053,"acs":31755,"articleLive":2,"columnArticles":258,"formTitle":"[528]按权重随机选择","frequency":0.0,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"ac","submitted":66567,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.645071516406705,"acs":39868,"articleLive":2,"columnArticles":464,"formTitle":"[529]扫雷游戏","frequency":0.0,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","submitted":61804,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6211290272178994,"acs":79507,"articleLive":2,"columnArticles":642,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":0.0,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"ac","submitted":128004,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6587971738755816,"acs":3823,"articleLive":2,"columnArticles":78,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"lock","submitted":5803,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.37527661757162745,"acs":25607,"articleLive":2,"columnArticles":279,"formTitle":"[532]数组中的 k-diff 数对","frequency":0.0,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","submitted":68235,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5261813537675607,"acs":1648,"articleLive":2,"columnArticles":34,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"lock","submitted":3132,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.675250556792873,"acs":14553,"articleLive":2,"columnArticles":139,"formTitle":"[534]游戏玩法分析 III","frequency":0.0,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"lock","submitted":21552,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8423001639951331,"acs":15922,"articleLive":2,"columnArticles":104,"formTitle":"[535]TinyURL 的加密与解密","frequency":0.0,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","submitted":18903,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5388223032829599,"acs":3102,"articleLive":2,"columnArticles":50,"formTitle":"[536]从字符串生成二叉树","frequency":0.0,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"lock","submitted":5757,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.712289827023104,"acs":11777,"articleLive":2,"columnArticles":175,"formTitle":"[537]复数乘法","frequency":0.0,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","submitted":16534,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.701652021535961,"acs":110513,"articleLive":2,"columnArticles":843,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":0.0,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","submitted":157504,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5981650603930811,"acs":14213,"articleLive":2,"columnArticles":191,"formTitle":"[539]最小时间差","frequency":0.0,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","submitted":23761,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5824154531769336,"acs":39076,"articleLive":2,"columnArticles":410,"formTitle":"[540]有序数组中的单一元素","frequency":0.0,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"ac","submitted":67093,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6069655427936272,"acs":73719,"articleLive":2,"columnArticles":810,"formTitle":"[541]反转字符串 II","frequency":0.0,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"ac","submitted":121455,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.457990329738981,"acs":70378,"articleLive":2,"columnArticles":650,"formTitle":"[542]01 矩阵","frequency":0.0,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"ac","submitted":153667,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.5529353063506343,"acs":151820,"articleLive":2,"columnArticles":1245,"formTitle":"[543]二叉树的直径","frequency":0.0,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","submitted":274571,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.71124150710315,"acs":2303,"articleLive":2,"columnArticles":53,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"lock","submitted":3238,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.41913191076624634,"acs":3457,"articleLive":2,"columnArticles":79,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"lock","submitted":8248,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6285334772321614,"acs":15142,"articleLive":2,"columnArticles":121,"formTitle":"[546]移除盒子","frequency":0.0,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","submitted":24091,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6188464675087472,"acs":164667,"articleLive":2,"columnArticles":1156,"formTitle":"[547]省份数量","frequency":0.0,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"ac","submitted":266087,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.3548598949211909,"acs":1621,"articleLive":2,"columnArticles":40,"formTitle":"[548]将数组分割成和相等的子数组","frequency":0.0,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","questionId":"548","status":"lock","submitted":4568,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.48172757475083056,"acs":2175,"articleLive":2,"columnArticles":52,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"lock","submitted":4515,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.43823980897151626,"acs":12847,"articleLive":2,"columnArticles":180,"formTitle":"[550]游戏玩法分析 IV","frequency":0.0,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"lock","submitted":29315,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.5677418115085656,"acs":59090,"articleLive":2,"columnArticles":760,"formTitle":"[551]学生出勤记录 I","frequency":0.0,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"ac","submitted":104079,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5775810360133401,"acs":24073,"articleLive":2,"columnArticles":287,"formTitle":"[552]学生出勤记录 II","frequency":0.0,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"ac","submitted":41679,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6051963868872424,"acs":5963,"articleLive":2,"columnArticles":87,"formTitle":"[553]最优除法","frequency":0.0,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","submitted":9853,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5032490580461967,"acs":46080,"articleLive":2,"columnArticles":487,"formTitle":"[554]砖墙","frequency":0.0,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"ac","submitted":91565,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.34375,"acs":1111,"articleLive":2,"columnArticles":23,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"lock","submitted":3232,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.32589482987185153,"acs":14750,"articleLive":2,"columnArticles":215,"formTitle":"[556]下一个更大元素 III","frequency":0.0,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","submitted":45260,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7450964426591394,"acs":164714,"articleLive":2,"columnArticles":1364,"formTitle":"[557]反转字符串中的单词 III","frequency":0.0,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"ac","submitted":221064,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5046519641626465,"acs":2929,"articleLive":2,"columnArticles":39,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","questionId":"773","status":"","submitted":5804,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7282545896169129,"acs":61764,"articleLive":2,"columnArticles":552,"formTitle":"[559]N 叉树的最大深度","frequency":0.0,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","submitted":84811,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.4466393366144946,"acs":153183,"articleLive":2,"columnArticles":941,"formTitle":"[560]和为 K 的子数组","frequency":0.0,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","submitted":342968,"title":"和为 K 的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7749003643329969,"acs":90606,"articleLive":2,"columnArticles":755,"formTitle":"[561]数组拆分 I","frequency":0.0,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"ac","submitted":116926,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.4666746012854082,"acs":3921,"articleLive":2,"columnArticles":64,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.0,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"lock","submitted":8402,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.6063705163725618,"acs":32610,"articleLive":2,"columnArticles":327,"formTitle":"[563]二叉树的坡度","frequency":0.0,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","submitted":53779,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.1797144461378038,"acs":4481,"articleLive":2,"columnArticles":77,"formTitle":"[564]寻找最近的回文数","frequency":0.0,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"notac","submitted":24934,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6106970441263657,"acs":14421,"articleLive":2,"columnArticles":139,"formTitle":"[565]数组嵌套","frequency":0.0,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","submitted":23614,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.6878915727216923,"acs":70599,"articleLive":2,"columnArticles":656,"formTitle":"[566]重塑矩阵","frequency":0.0,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"ac","submitted":102631,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.4322724383921622,"acs":121070,"articleLive":2,"columnArticles":1098,"formTitle":"[567]字符串的排列","frequency":0.0,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"ac","submitted":280078,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.5087048832271762,"acs":1198,"articleLive":2,"columnArticles":26,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"lock","submitted":2355,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.5653776366523021,"acs":9971,"articleLive":2,"columnArticles":157,"formTitle":"[569]员工薪水中位数","frequency":0.0,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"lock","submitted":17636,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6611716966776566,"acs":13035,"articleLive":2,"columnArticles":114,"formTitle":"[570]至少有5名直接下属的经理","frequency":0.0,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"lock","submitted":19715,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.48778415126407476,"acs":6888,"articleLive":2,"columnArticles":96,"formTitle":"[571]给定数字的频率查询中位数","frequency":0.0,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"lock","submitted":14121,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.47338265962639214,"acs":85349,"articleLive":2,"columnArticles":743,"formTitle":"[572]另一棵树的子树","frequency":0.0,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"ac","submitted":180296,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6621621621621622,"acs":1029,"articleLive":2,"columnArticles":31,"formTitle":"[573]松鼠模拟","frequency":0.0,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"lock","submitted":1554,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.6482231446795585,"acs":12805,"articleLive":2,"columnArticles":114,"formTitle":"[574]当选者","frequency":0.0,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"lock","submitted":19754,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.6836764047816914,"acs":42779,"articleLive":2,"columnArticles":443,"formTitle":"[575]分糖果","frequency":0.0,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"","submitted":62572,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.4683973930782979,"acs":25945,"articleLive":2,"columnArticles":282,"formTitle":"[576]出界的路径数","frequency":0.0,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"ac","submitted":55391,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.7014836250057416,"acs":15272,"articleLive":2,"columnArticles":86,"formTitle":"[577]员工奖金","frequency":0.0,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"lock","submitted":21771,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.4959944614775987,"acs":10030,"articleLive":2,"columnArticles":113,"formTitle":"[578]查询回答率最高的问题","frequency":0.0,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"lock","submitted":20222,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.4104931794333683,"acs":7824,"articleLive":2,"columnArticles":132,"formTitle":"[579]查询员工的累计薪水","frequency":0.0,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"lock","submitted":19060,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5236797449478069,"acs":10184,"articleLive":2,"columnArticles":81,"formTitle":"[580]统计各专业学生人数","frequency":0.0,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"lock","submitted":19447,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.40508269103677,"acs":99910,"articleLive":2,"columnArticles":865,"formTitle":"[581]最短无序连续子数组","frequency":0.0,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"ac","submitted":246641,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.4087305288685757,"acs":8764,"articleLive":2,"columnArticles":134,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"lock","submitted":21442,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.619594373171827,"acs":51049,"articleLive":2,"columnArticles":494,"formTitle":"[583]两个字符串的删除操作","frequency":0.0,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"ac","submitted":82391,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7744482125979875,"acs":13930,"articleLive":2,"columnArticles":62,"formTitle":"[584]寻找用户推荐人","frequency":0.0,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"lock","submitted":17987,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.5947666689988106,"acs":8501,"articleLive":2,"columnArticles":102,"formTitle":"[585]2016年的投资","frequency":0.0,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"lock","submitted":14293,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7457412930293686,"acs":14753,"articleLive":2,"columnArticles":88,"formTitle":"[586]订单最多的客户","frequency":0.0,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"lock","submitted":19783,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.38497150997151,"acs":2162,"articleLive":2,"columnArticles":38,"formTitle":"[587]安装栅栏","frequency":0.0,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","submitted":5616,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.4258836944127708,"acs":1494,"articleLive":2,"columnArticles":29,"formTitle":"[588]设计内存文件系统","frequency":0.0,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"lock","submitted":3508,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7454524185529625,"acs":89215,"articleLive":2,"columnArticles":567,"formTitle":"[589]N 叉树的前序遍历","frequency":0.0,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","submitted":119679,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7614262131125812,"acs":63190,"articleLive":2,"columnArticles":466,"formTitle":"[590]N 叉树的后序遍历","frequency":0.0,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","submitted":82989,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.33969754253308126,"acs":1797,"articleLive":2,"columnArticles":41,"formTitle":"[591]标签验证器","frequency":0.0,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"ac","submitted":5290,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5226826734387625,"acs":4528,"articleLive":2,"columnArticles":111,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","submitted":8663,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.44271406848093964,"acs":8443,"articleLive":2,"columnArticles":136,"formTitle":"[593]有效的正方形","frequency":0.0,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","submitted":19071,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.518415980374978,"acs":29586,"articleLive":2,"columnArticles":272,"formTitle":"[594]最长和谐子序列","frequency":0.0,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","submitted":57070,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.796858133713052,"acs":104088,"articleLive":2,"columnArticles":239,"formTitle":"[595]大的国家","frequency":0.0,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","submitted":130623,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.4211990633758435,"acs":82205,"articleLive":2,"columnArticles":291,"formTitle":"[596]超过5名学生的课","frequency":0.0,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","submitted":195169,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.4417084791499768,"acs":10476,"articleLive":2,"columnArticles":84,"formTitle":"[597]好友申请 I：总体通过率","frequency":0.0,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"lock","submitted":23717,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5180677063522252,"acs":16344,"articleLive":2,"columnArticles":211,"formTitle":"[598]范围求和 II","frequency":0.0,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","submitted":31548,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5221463554141493,"acs":29212,"articleLive":2,"columnArticles":276,"formTitle":"[599]两个列表的最小索引总和","frequency":0.0,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"ac","submitted":55946,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.48140758660248895,"acs":19303,"articleLive":2,"columnArticles":230,"formTitle":"[600]不含连续1的非负整数","frequency":0.0,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"ac","submitted":40097,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.5012733046184802,"acs":31888,"articleLive":2,"columnArticles":378,"formTitle":"[601]体育馆的人流量","frequency":0.0,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","submitted":63614,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6294280018402085,"acs":8209,"articleLive":2,"columnArticles":88,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":0.0,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"lock","submitted":13042,"title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6706477521643893,"acs":12859,"articleLive":2,"columnArticles":113,"formTitle":"[603]连续空余座位","frequency":0.0,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"lock","submitted":19174,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.37393552311435524,"acs":2459,"articleLive":2,"columnArticles":56,"formTitle":"[604]迭代压缩字符串","frequency":0.0,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"lock","submitted":6576,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.3337088758256635,"acs":110187,"articleLive":2,"columnArticles":1269,"formTitle":"[605]种花问题","frequency":0.0,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","submitted":330189,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.5689764403088498,"acs":28739,"articleLive":2,"columnArticles":315,"formTitle":"[606]根据二叉树创建字符串","frequency":0.0,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","submitted":50510,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.659898750538561,"acs":12253,"articleLive":2,"columnArticles":86,"formTitle":"[607]销售员","frequency":0.0,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"lock","submitted":18568,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.6563325100076655,"acs":7706,"articleLive":2,"columnArticles":102,"formTitle":"[608]树节点","frequency":0.0,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"lock","submitted":11741,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.4845665337468616,"acs":6562,"articleLive":2,"columnArticles":102,"formTitle":"[609]在系统中查找重复文件","frequency":0.0,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","submitted":13542,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6648499655453236,"acs":10613,"articleLive":2,"columnArticles":73,"formTitle":"[610]判断三角形","frequency":0.0,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"lock","submitted":15963,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.5319151163642836,"acs":50808,"articleLive":2,"columnArticles":397,"formTitle":"[611]有效三角形的个数","frequency":0.0,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"ac","submitted":95519,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6685873773296119,"acs":7426,"articleLive":2,"columnArticles":65,"formTitle":"[612]平面上的最近距离","frequency":0.0,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"lock","submitted":11107,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8171587356721084,"acs":11763,"articleLive":2,"columnArticles":81,"formTitle":"[613]直线上的最近距离","frequency":0.0,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"lock","submitted":14395,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.3466728319811678,"acs":8247,"articleLive":2,"columnArticles":68,"formTitle":"[614]二级关注者","frequency":0.0,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"lock","submitted":23789,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.4250257711521687,"acs":5360,"articleLive":2,"columnArticles":92,"formTitle":"[615]平均工资：部门与公司比较","frequency":0.0,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"lock","submitted":12611,"title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.46250691754288875,"acs":3343,"articleLive":2,"columnArticles":56,"formTitle":"[616]给字符串添加加粗标签","frequency":0.0,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"lock","submitted":7228,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7879385684926712,"acs":191317,"articleLive":2,"columnArticles":1261,"formTitle":"[617]合并二叉树","frequency":0.0,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"ac","submitted":242807,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6201324503311259,"acs":4682,"articleLive":2,"columnArticles":46,"formTitle":"[618]学生地理信息报告","frequency":0.0,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"lock","submitted":7550,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.4663170305321787,"acs":11470,"articleLive":2,"columnArticles":80,"formTitle":"[619]只出现一次的最大数字","frequency":0.0,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"lock","submitted":24597,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7735628397298633,"acs":93926,"articleLive":2,"columnArticles":311,"formTitle":"[620]有趣的电影","frequency":0.0,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","submitted":121420,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.571172953550283,"acs":78526,"articleLive":2,"columnArticles":501,"formTitle":"[621]任务调度器","frequency":0.0,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","submitted":137482,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.4377009939461452,"acs":66011,"articleLive":2,"columnArticles":426,"formTitle":"[622]设计循环队列","frequency":0.0,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"ac","submitted":150813,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.54590131708276,"acs":11108,"articleLive":2,"columnArticles":192,"formTitle":"[623]在二叉树中增加一行","frequency":0.0,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","submitted":20348,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.4205803741886216,"acs":2203,"articleLive":2,"columnArticles":50,"formTitle":"[624]数组列表中的最大距离","frequency":0.0,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"lock","submitted":5238,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.34312525499796004,"acs":2523,"articleLive":2,"columnArticles":55,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"lock","submitted":7353,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.6842310168755522,"acs":45695,"articleLive":2,"columnArticles":357,"formTitle":"[626]换座位","frequency":0.0,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","submitted":66783,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.8080276608538786,"acs":86000,"articleLive":2,"columnArticles":343,"formTitle":"[627]变更性别","frequency":0.0,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","submitted":106432,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5246552431032351,"acs":80618,"articleLive":2,"columnArticles":767,"formTitle":"[628]三个数的最大乘积","frequency":0.0,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"ac","submitted":153659,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.40664911767573364,"acs":4171,"articleLive":2,"columnArticles":58,"formTitle":"[629]K个逆序对数组","frequency":0.0,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"","submitted":10257,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.368107302533532,"acs":6422,"articleLive":2,"columnArticles":76,"formTitle":"[630]课程表 III","frequency":0.0,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","submitted":17446,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.2889300847457627,"acs":1091,"articleLive":2,"columnArticles":35,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"lock","submitted":3776,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5980339475930082,"acs":18920,"articleLive":2,"columnArticles":239,"formTitle":"[632]最小区间","frequency":0.0,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","submitted":31637,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.39758018068768947,"acs":94572,"articleLive":2,"columnArticles":770,"formTitle":"[633]平方数之和","frequency":0.0,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"ac","submitted":237869,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.4405144694533762,"acs":1370,"articleLive":2,"columnArticles":21,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"lock","submitted":3110,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.5521157225902393,"acs":4084,"articleLive":2,"columnArticles":68,"formTitle":"[635]设计日志存储系统","frequency":0.0,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"lock","submitted":7397,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.5526888926118277,"acs":9897,"articleLive":2,"columnArticles":113,"formTitle":"[636]函数的独占时间","frequency":0.0,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"ac","submitted":17907,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.690060562878518,"acs":75543,"articleLive":2,"columnArticles":654,"formTitle":"[637]二叉树的层平均值","frequency":0.0,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","submitted":109473,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.592335390946502,"acs":11515,"articleLive":2,"columnArticles":119,"formTitle":"[638]大礼包","frequency":0.0,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"","submitted":19440,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.37680807325733506,"acs":20163,"articleLive":2,"columnArticles":273,"formTitle":"[639]解码方法 II","frequency":0.0,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"ac","submitted":53510,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.42504973280805086,"acs":10897,"articleLive":2,"columnArticles":213,"formTitle":"[640]求解方程","frequency":0.0,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","submitted":25637,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5331066262536656,"acs":21634,"articleLive":2,"columnArticles":242,"formTitle":"[641]设计循环双端队列","frequency":0.0,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","submitted":40581,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.49009116131589375,"acs":2473,"articleLive":2,"columnArticles":56,"formTitle":"[642]设计搜索自动补全系统","frequency":0.0,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"lock","submitted":5046,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.4505286213723095,"acs":64176,"articleLive":2,"columnArticles":574,"formTitle":"[643]子数组最大平均数 I","frequency":0.0,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","submitted":142446,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.4022307424189613,"acs":1154,"articleLive":2,"columnArticles":24,"formTitle":"[644]子数组最大平均数 II","frequency":0.0,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"lock","submitted":2869,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.433569419328913,"acs":69052,"articleLive":2,"columnArticles":697,"formTitle":"[645]错误的集合","frequency":0.0,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"ac","submitted":159264,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5779033915724563,"acs":22492,"articleLive":2,"columnArticles":202,"formTitle":"[646]最长数对链","frequency":0.0,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","submitted":38920,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6567924212639592,"acs":125626,"articleLive":2,"columnArticles":925,"formTitle":"[647]回文子串","frequency":0.0,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","submitted":191272,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.5846944044351442,"acs":21515,"articleLive":2,"columnArticles":281,"formTitle":"[648]单词替换","frequency":0.0,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","submitted":36797,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.4817545943449141,"acs":29203,"articleLive":2,"columnArticles":309,"formTitle":"[649]Dota2 参议院","frequency":0.0,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","submitted":60618,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5671209911699526,"acs":49390,"articleLive":2,"columnArticles":656,"formTitle":"[650]只有两个键的键盘","frequency":0.0,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"ac","submitted":87089,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.5840898599784582,"acs":3796,"articleLive":2,"columnArticles":63,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"lock","submitted":6499,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.5714285714285714,"acs":33000,"articleLive":2,"columnArticles":238,"formTitle":"[652]寻找重复的子树","frequency":0.0,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"ac","submitted":57750,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.598292920050326,"acs":41847,"articleLive":2,"columnArticles":397,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"","submitted":69944,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.8109922075149445,"acs":60779,"articleLive":2,"columnArticles":616,"formTitle":"[654]最大二叉树","frequency":0.0,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","submitted":74944,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.5981895901433241,"acs":9516,"articleLive":2,"columnArticles":143,"formTitle":"[655]输出二叉树","frequency":0.0,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","submitted":15908,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.3081669691470054,"acs":849,"articleLive":2,"columnArticles":25,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"lock","submitted":2755,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.7833878078443296,"acs":82450,"articleLive":2,"columnArticles":629,"formTitle":"[657]机器人能否返回原点","frequency":0.0,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","submitted":105248,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.45473620599936215,"acs":27090,"articleLive":2,"columnArticles":241,"formTitle":"[658]找到 K 个最接近的元素","frequency":0.0,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","submitted":59573,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.5420528729944234,"acs":28480,"articleLive":2,"columnArticles":261,"formTitle":"[659]分割数组为连续子序列","frequency":0.0,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","submitted":52541,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.6560150375939849,"acs":698,"articleLive":2,"columnArticles":23,"formTitle":"[660]移除 9","frequency":0.0,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"lock","submitted":1064,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5611043852569276,"acs":16685,"articleLive":2,"columnArticles":214,"formTitle":"[661]图片平滑器","frequency":0.0,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","submitted":29736,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.40937346523538903,"acs":29174,"articleLive":2,"columnArticles":278,"formTitle":"[662]二叉树最大宽度","frequency":0.0,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","submitted":71265,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.46459143968871597,"acs":1791,"articleLive":2,"columnArticles":36,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"lock","submitted":3855,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.6535856868253733,"acs":22101,"articleLive":2,"columnArticles":190,"formTitle":"[664]奇怪的打印机","frequency":0.0,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"ac","submitted":33815,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.2708440514180251,"acs":75283,"articleLive":2,"columnArticles":943,"formTitle":"[665]非递减数列","frequency":0.0,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","questionId":"665","status":"","submitted":277957,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6188679245283019,"acs":2132,"articleLive":2,"columnArticles":76,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"lock","submitted":3445,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.6240881576905168,"acs":8042,"articleLive":2,"columnArticles":121,"formTitle":"[667]优美的排列 II","frequency":0.0,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","submitted":12886,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5083955913898957,"acs":6873,"articleLive":2,"columnArticles":68,"formTitle":"[668]乘法表中第k小的数","frequency":0.0,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","submitted":13519,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6656572982774253,"acs":36711,"articleLive":2,"columnArticles":309,"formTitle":"[669]修剪二叉搜索树","frequency":0.0,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","submitted":55150,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.4520731477999248,"acs":19233,"articleLive":2,"columnArticles":286,"formTitle":"[670]最大交换","frequency":0.0,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","submitted":42544,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.48573265014213035,"acs":53655,"articleLive":2,"columnArticles":672,"formTitle":"[671]二叉树中第二小的节点","frequency":0.0,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"ac","submitted":110462,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5473824707103663,"acs":3691,"articleLive":2,"columnArticles":42,"formTitle":"[672]灯泡开关 Ⅱ","frequency":0.0,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","submitted":6743,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.4355161619103087,"acs":47858,"articleLive":2,"columnArticles":418,"formTitle":"[673]最长递增子序列的个数","frequency":0.0,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"ac","submitted":109888,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.4972873206174271,"acs":93493,"articleLive":2,"columnArticles":774,"formTitle":"[674]最长连续递增序列","frequency":0.0,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","submitted":188006,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.40079692223138225,"acs":2917,"articleLive":2,"columnArticles":48,"formTitle":"[675]为高尔夫比赛砍树","frequency":0.0,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","submitted":7278,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5887470526059029,"acs":7241,"articleLive":2,"columnArticles":131,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","submitted":12299,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6179927667269439,"acs":15037,"articleLive":2,"columnArticles":253,"formTitle":"[677]键值映射","frequency":0.0,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","submitted":24332,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.3856527522087257,"acs":43782,"articleLive":2,"columnArticles":479,"formTitle":"[678]有效的括号字符串","frequency":0.0,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"ac","submitted":113527,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5415515629868107,"acs":26073,"articleLive":2,"columnArticles":263,"formTitle":"[679]24 点游戏","frequency":0.0,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","submitted":48145,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.40169133192389006,"acs":87400,"articleLive":2,"columnArticles":829,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":0.0,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","submitted":217580,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5034735623311463,"acs":2609,"articleLive":2,"columnArticles":63,"formTitle":"[681]最近时刻","frequency":0.0,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"lock","submitted":5182,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6951520255029924,"acs":46229,"articleLive":2,"columnArticles":511,"formTitle":"[682]棒球比赛","frequency":0.0,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"ac","submitted":66502,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.43462210996697104,"acs":2237,"articleLive":2,"columnArticles":51,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"lock","submitted":5147,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.6658359889291976,"acs":60384,"articleLive":2,"columnArticles":609,"formTitle":"[684]冗余连接","frequency":0.0,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","submitted":90689,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.43098977864443827,"acs":20113,"articleLive":2,"columnArticles":253,"formTitle":"[685]冗余连接 II","frequency":0.0,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","submitted":46667,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.35630771750926554,"acs":17401,"articleLive":2,"columnArticles":196,"formTitle":"[686]重复叠加字符串匹配","frequency":0.0,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","submitted":48837,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.44144495860556443,"acs":38445,"articleLive":2,"columnArticles":273,"formTitle":"[687]最长同值路径","frequency":0.0,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","submitted":87089,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5107326030519851,"acs":8066,"articleLive":2,"columnArticles":106,"formTitle":"[688]“马”在棋盘上的概率","frequency":0.0,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","submitted":15793,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.48883009994121107,"acs":3326,"articleLive":2,"columnArticles":70,"formTitle":"[689]三个无重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","submitted":6804,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6478861872975248,"acs":56197,"articleLive":2,"columnArticles":570,"formTitle":"[690]员工的重要性","frequency":0.0,"frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","questionId":"690","status":"ac","submitted":86739,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.49225122349102773,"acs":3621,"articleLive":2,"columnArticles":48,"formTitle":"[691]贴纸拼词","frequency":0.0,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","submitted":7356,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5776729745463136,"acs":68471,"articleLive":2,"columnArticles":742,"formTitle":"[692]前K个高频单词","frequency":0.0,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"ac","submitted":118529,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6097192174378301,"acs":26210,"articleLive":2,"columnArticles":285,"formTitle":"[693]交替位二进制数","frequency":0.0,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","submitted":42987,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5352296450939458,"acs":4102,"articleLive":2,"columnArticles":79,"formTitle":"[694]不同岛屿的数量","frequency":0.0,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"lock","submitted":7664,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6653079755839176,"acs":131884,"articleLive":2,"columnArticles":1307,"formTitle":"[695]岛屿的最大面积","frequency":0.0,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"ac","submitted":198230,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6315637379441548,"acs":52452,"articleLive":2,"columnArticles":477,"formTitle":"[696]计数二进制子串","frequency":0.0,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","submitted":83051,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.6046989030466906,"acs":66867,"articleLive":2,"columnArticles":850,"formTitle":"[697]数组的度","frequency":0.0,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","submitted":110579,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.446556135654386,"acs":30193,"articleLive":2,"columnArticles":218,"formTitle":"[698]划分为k个相等的子集","frequency":0.0,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","submitted":67613,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.4780521262002744,"acs":2788,"articleLive":2,"columnArticles":41,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","submitted":5832,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.760757723904124,"acs":83252,"articleLive":2,"columnArticles":527,"formTitle":"[700]二叉搜索树中的搜索","frequency":0.0,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"","submitted":109433,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7230626389188479,"acs":77098,"articleLive":2,"columnArticles":571,"formTitle":"[701]二叉搜索树中的插入操作","frequency":0.0,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"","submitted":106627,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.742393509127789,"acs":4392,"articleLive":2,"columnArticles":77,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"786","status":"lock","submitted":5916,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5130542226284476,"acs":60623,"articleLive":2,"columnArticles":554,"formTitle":"[703]数据流中的第 K 大元素","frequency":0.0,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","submitted":118161,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.554968199140457,"acs":298680,"articleLive":2,"columnArticles":1480,"formTitle":"[704]二分查找","frequency":0.0,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"ac","submitted":538193,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6450082861877822,"acs":67722,"articleLive":2,"columnArticles":434,"formTitle":"[705]设计哈希集合","frequency":0.0,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"ac","submitted":104994,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6441353416476374,"acs":58673,"articleLive":2,"columnArticles":391,"formTitle":"[706]设计哈希映射","frequency":0.0,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"ac","submitted":91088,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.3225624508334199,"acs":65196,"articleLive":2,"columnArticles":449,"formTitle":"[707]设计链表","frequency":0.0,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"ac","submitted":202119,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.3404255319148936,"acs":2288,"articleLive":2,"columnArticles":51,"formTitle":"[708]循环有序列表的插入","frequency":0.0,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"850","status":"lock","submitted":6721,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7587064411121192,"acs":71087,"articleLive":2,"columnArticles":511,"formTitle":"[709]转换成小写字母","frequency":0.0,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","submitted":93695,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.3527170643673551,"acs":5277,"articleLive":2,"columnArticles":65,"formTitle":"[710]黑名单中的随机数","frequency":0.0,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","submitted":14961,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.559190031152648,"acs":718,"articleLive":2,"columnArticles":25,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"lock","submitted":1284,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6727616368511274,"acs":15306,"articleLive":2,"columnArticles":173,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":0.0,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","submitted":22751,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.41526486709393634,"acs":24168,"articleLive":2,"columnArticles":224,"formTitle":"[713]乘积小于K的子数组","frequency":0.0,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"ac","submitted":58199,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7220693489976903,"acs":101289,"articleLive":2,"columnArticles":677,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":0.0,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"","submitted":140276,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.41028396009209517,"acs":2673,"articleLive":2,"columnArticles":46,"formTitle":"[715]Range 模块","frequency":0.0,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","submitted":6515,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.46105670690047823,"acs":4049,"articleLive":2,"columnArticles":75,"formTitle":"[716]最大栈","frequency":0.0,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"lock","submitted":8782,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5115780653270381,"acs":31747,"articleLive":2,"columnArticles":382,"formTitle":"[717]1比特与2比特字符","frequency":0.0,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","submitted":62057,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5646395622406091,"acs":85439,"articleLive":2,"columnArticles":592,"formTitle":"[718]最长重复子数组","frequency":0.0,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","submitted":151316,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.36968393182194276,"acs":8936,"articleLive":2,"columnArticles":87,"formTitle":"[719]找出第 k 小的距离对","frequency":0.0,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","submitted":24172,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.48395113340765517,"acs":20837,"articleLive":2,"columnArticles":277,"formTitle":"[720]词典中最长的单词","frequency":0.0,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","submitted":43056,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.4692311420585812,"acs":29044,"articleLive":2,"columnArticles":338,"formTitle":"[721]账户合并","frequency":0.0,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","submitted":61897,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.32218612650487294,"acs":5058,"articleLive":2,"columnArticles":75,"formTitle":"[722]删除注释","frequency":0.0,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","submitted":15699,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7203663793103449,"acs":1337,"articleLive":2,"columnArticles":41,"formTitle":"[723]粉碎糖果","frequency":0.0,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"lock","submitted":1856,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.463293257292184,"acs":138994,"articleLive":2,"columnArticles":869,"formTitle":"[724]寻找数组的中心下标","frequency":0.0,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"","submitted":300013,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.6085210602217912,"acs":48947,"articleLive":2,"columnArticles":625,"formTitle":"[725]分隔链表","frequency":0.0,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"ac","submitted":80436,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5524447252053064,"acs":21863,"articleLive":2,"columnArticles":398,"formTitle":"[726]原子的数量","frequency":0.0,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"ac","submitted":39575,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.4100237330727349,"acs":2937,"articleLive":2,"columnArticles":50,"formTitle":"[727]最小窗口子序列","frequency":0.0,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"lock","submitted":7163,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7602421480587946,"acs":34033,"articleLive":2,"columnArticles":311,"formTitle":"[728]自除数","frequency":0.0,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","submitted":44766,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.5145756457564575,"acs":8367,"articleLive":2,"columnArticles":94,"formTitle":"[729]我的日程安排表 I","frequency":0.0,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","submitted":16260,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.49062693978895094,"acs":3952,"articleLive":2,"columnArticles":48,"formTitle":"[730]统计不同回文子序列","frequency":0.0,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","submitted":8055,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5040417858475315,"acs":4053,"articleLive":2,"columnArticles":43,"formTitle":"[731]我的日程安排表 II","frequency":0.0,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","submitted":8041,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6099429793300071,"acs":3423,"articleLive":2,"columnArticles":54,"formTitle":"[732]我的日程安排表 III","frequency":0.0,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","submitted":5612,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.580625372605604,"acs":67201,"articleLive":2,"columnArticles":574,"formTitle":"[733]图像渲染","frequency":0.0,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"ac","submitted":115739,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.4808314087759815,"acs":2082,"articleLive":2,"columnArticles":37,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"lock","submitted":4330,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.407534509202454,"acs":21257,"articleLive":2,"columnArticles":267,"formTitle":"[735]行星碰撞","frequency":0.0,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"ac","submitted":52160,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.46370370370370373,"acs":1565,"articleLive":2,"columnArticles":46,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","submitted":3375,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.46210413948523305,"acs":3896,"articleLive":2,"columnArticles":66,"formTitle":"[737]句子相似性 II","frequency":0.0,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"lock","submitted":8431,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.5015628205592363,"acs":41561,"articleLive":2,"columnArticles":591,"formTitle":"[738]单调递增的数字","frequency":0.0,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"ac","submitted":82863,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6802539936152878,"acs":214580,"articleLive":2,"columnArticles":1529,"formTitle":"[739]每日温度","frequency":0.0,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"ac","submitted":315441,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.6293455909035925,"acs":52028,"articleLive":2,"columnArticles":602,"formTitle":"[740]删除并获得点数","frequency":0.0,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","submitted":82670,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.3673825256975037,"acs":4003,"articleLive":2,"columnArticles":46,"formTitle":"[741]摘樱桃","frequency":0.0,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","submitted":10896,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.4950431723696834,"acs":1548,"articleLive":2,"columnArticles":45,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"lock","submitted":3127,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.52060006130434,"acs":57746,"articleLive":2,"columnArticles":527,"formTitle":"[743]网络延迟时间","frequency":0.0,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"ac","submitted":110922,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.45913269384492406,"acs":41355,"articleLive":2,"columnArticles":366,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":0.0,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","submitted":90072,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.39285227117719274,"acs":2880,"articleLive":2,"columnArticles":55,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","submitted":7331,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5888140659491681,"acs":137103,"articleLive":2,"columnArticles":1313,"formTitle":"[746]使用最小花费爬楼梯","frequency":0.0,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","submitted":232846,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.4168877261667368,"acs":45575,"articleLive":2,"columnArticles":405,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":0.0,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","submitted":109322,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.6018389923854222,"acs":12567,"articleLive":2,"columnArticles":176,"formTitle":"[748]最短补全词","frequency":0.0,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","submitted":20881,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.4990938745922436,"acs":1377,"articleLive":2,"columnArticles":32,"formTitle":"[749]隔离病毒","frequency":0.0,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","submitted":2759,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.7214234363767074,"acs":2007,"articleLive":2,"columnArticles":43,"formTitle":"[750]角矩形的数量","frequency":0.0,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"lock","submitted":2782,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5028797696184305,"acs":1397,"articleLive":2,"columnArticles":28,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","questionId":"752","status":"lock","submitted":2778,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5303524039224877,"acs":70146,"articleLive":2,"columnArticles":592,"formTitle":"[752]打开转盘锁","frequency":0.0,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"ac","submitted":132263,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.591372406261376,"acs":3249,"articleLive":2,"columnArticles":41,"formTitle":"[753]破解保险箱","frequency":0.0,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","submitted":5494,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.4310326377742108,"acs":8056,"articleLive":2,"columnArticles":95,"formTitle":"[754]到达终点数字","frequency":0.0,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","submitted":18690,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.49923547400611623,"acs":1306,"articleLive":2,"columnArticles":31,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"lock","submitted":2616,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.5647116444226766,"acs":4612,"articleLive":2,"columnArticles":68,"formTitle":"[756]金字塔转换矩阵","frequency":0.0,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","submitted":8167,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.41956967213114754,"acs":2457,"articleLive":2,"columnArticles":38,"formTitle":"[757]设置交集大小至少为2","frequency":0.0,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","submitted":5856,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.4624292670088169,"acs":3514,"articleLive":2,"columnArticles":67,"formTitle":"[758]字符串中的加粗单词","frequency":0.0,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","questionId":"760","status":"lock","submitted":7599,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6618830941547077,"acs":1891,"articleLive":2,"columnArticles":46,"formTitle":"[759]员工空闲时间","frequency":0.0,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"lock","submitted":2857,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.839058524173028,"acs":3957,"articleLive":2,"columnArticles":90,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"lock","submitted":4716,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.5908963191907839,"acs":2103,"articleLive":2,"columnArticles":34,"formTitle":"[761]特殊的二进制序列","frequency":0.0,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","submitted":3559,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.7005008608545938,"acs":17902,"articleLive":2,"columnArticles":143,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"767","status":"","submitted":25556,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7632969127293249,"acs":82504,"articleLive":2,"columnArticles":992,"formTitle":"[763]划分字母区间","frequency":0.0,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","submitted":108089,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.4935263653483992,"acs":4193,"articleLive":2,"columnArticles":54,"formTitle":"[764]最大加号标志","frequency":0.0,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","submitted":8496,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.6653844402968089,"acs":29233,"articleLive":2,"columnArticles":442,"formTitle":"[765]情侣牵手","frequency":0.0,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","submitted":43934,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7080956052428682,"acs":55104,"articleLive":2,"columnArticles":637,"formTitle":"[766]托普利茨矩阵","frequency":0.0,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","submitted":77820,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.47787147495747945,"acs":40178,"articleLive":2,"columnArticles":498,"formTitle":"[767]重构字符串","frequency":0.0,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","submitted":84077,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.5059574068861995,"acs":5393,"articleLive":2,"columnArticles":80,"formTitle":"[768]最多能完成排序的块 II","frequency":0.0,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","submitted":10659,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5877539634571575,"acs":12642,"articleLive":2,"columnArticles":150,"formTitle":"[769]最多能完成排序的块","frequency":0.0,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","submitted":21509,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.554368029739777,"acs":1193,"articleLive":2,"columnArticles":26,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","submitted":2152,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8512502635930789,"acs":153397,"articleLive":2,"columnArticles":1120,"formTitle":"[771]宝石与石头","frequency":0.0,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"ac","submitted":180202,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.4941167117188742,"acs":6215,"articleLive":2,"columnArticles":125,"formTitle":"[772]基本计算器 III","frequency":0.0,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"lock","submitted":12578,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7131417087875281,"acs":23421,"articleLive":2,"columnArticles":334,"formTitle":"[773]滑动谜题","frequency":0.0,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","submitted":32842,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5901725039205437,"acs":1129,"articleLive":2,"columnArticles":22,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.0,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"lock","submitted":1913,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.45905327573794097,"acs":5101,"articleLive":2,"columnArticles":81,"formTitle":"[775]全局倒置与局部倒置","frequency":0.0,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","submitted":11112,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5687898089171974,"acs":1786,"articleLive":2,"columnArticles":39,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"lock","submitted":3140,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.32378422086173037,"acs":5606,"articleLive":2,"columnArticles":61,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":0.0,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","submitted":17314,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5939677508615702,"acs":23612,"articleLive":2,"columnArticles":348,"formTitle":"[778]水位上升的泳池中游泳","frequency":0.0,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","submitted":39753,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.4363694867728516,"acs":18986,"articleLive":2,"columnArticles":236,"formTitle":"[779]第K个语法符号","frequency":0.0,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","submitted":43509,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.28551616538094826,"acs":3294,"articleLive":2,"columnArticles":50,"formTitle":"[780]到达终点","frequency":0.0,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","submitted":11537,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.6168550200688889,"acs":43339,"articleLive":2,"columnArticles":663,"formTitle":"[781]森林中的兔子","frequency":0.0,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","submitted":70258,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.4280453257790368,"acs":1511,"articleLive":2,"columnArticles":31,"formTitle":"[782]变为棋盘","frequency":0.0,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","submitted":3530,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5959955297349406,"acs":69862,"articleLive":2,"columnArticles":673,"formTitle":"[783]二叉搜索树节点最小距离","frequency":0.0,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"ac","submitted":117219,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6870031029532087,"acs":44502,"articleLive":2,"columnArticles":491,"formTitle":"[784]字母大小写全排列","frequency":0.0,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"ac","submitted":64777,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5124465899494574,"acs":40657,"articleLive":2,"columnArticles":407,"formTitle":"[785]判断二分图","frequency":0.0,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"ac","submitted":79339,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.47377718891465165,"acs":4291,"articleLive":2,"columnArticles":58,"formTitle":"[786]第 K 个最小的素数分数","frequency":0.0,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","submitted":9057,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.39098540213169375,"acs":42479,"articleLive":2,"columnArticles":403,"formTitle":"[787]K 站中转内最便宜的航班","frequency":0.0,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"ac","submitted":108646,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.6081698379835025,"acs":18506,"articleLive":2,"columnArticles":191,"formTitle":"[788]旋转数字","frequency":0.0,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","questionId":"804","status":"","submitted":30429,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6922568273490709,"acs":20938,"articleLive":2,"columnArticles":295,"formTitle":"[789]逃脱阻碍者","frequency":0.0,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"ac","submitted":30246,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.449045318610536,"acs":3904,"articleLive":2,"columnArticles":67,"formTitle":"[790]多米诺和托米诺平铺","frequency":0.0,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","submitted":8694,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6949532937037486,"acs":11457,"articleLive":2,"columnArticles":201,"formTitle":"[791]自定义字符串排序","frequency":0.0,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","submitted":16486,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.464880227365002,"acs":9160,"articleLive":2,"columnArticles":99,"formTitle":"[792]匹配子序列的单词数","frequency":0.0,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","submitted":19704,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.3931484502446982,"acs":5061,"articleLive":2,"columnArticles":68,"formTitle":"[793]阶乘函数后 K 个零","frequency":0.0,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","submitted":12873,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3408156667128539,"acs":7379,"articleLive":2,"columnArticles":106,"formTitle":"[794]有效的井字游戏","frequency":0.0,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","submitted":21651,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5332805594036546,"acs":8084,"articleLive":2,"columnArticles":89,"formTitle":"[795]区间子数组个数","frequency":0.0,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","submitted":15159,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5307101727447217,"acs":23779,"articleLive":2,"columnArticles":282,"formTitle":"[796]旋转字符串","frequency":0.0,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","submitted":44806,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.792907441936243,"acs":43801,"articleLive":2,"columnArticles":543,"formTitle":"[797]所有可能的路径","frequency":0.0,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"ac","submitted":55241,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.46479813146479815,"acs":1393,"articleLive":2,"columnArticles":35,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","submitted":2997,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.408937863483318,"acs":5344,"articleLive":2,"columnArticles":69,"formTitle":"[799]香槟塔","frequency":0.0,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","submitted":13068,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.70654296875,"acs":1447,"articleLive":2,"columnArticles":36,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"lock","submitted":2048,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.4194217256076489,"acs":7282,"articleLive":2,"columnArticles":88,"formTitle":"[801]使序列递增的最小交换次数","frequency":0.0,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","questionId":"819","status":"","submitted":17362,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5763846622032867,"acs":31251,"articleLive":2,"columnArticles":334,"formTitle":"[802]找到最终的安全状态","frequency":0.0,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"ac","submitted":54219,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.48200478825699594,"acs":12281,"articleLive":2,"columnArticles":125,"formTitle":"[803]打砖块","frequency":0.0,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","submitted":25479,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7714252535418441,"acs":39858,"articleLive":2,"columnArticles":401,"formTitle":"[804]唯一摩尔斯密码词","frequency":0.0,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","submitted":51668,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.2909071062111123,"acs":2665,"articleLive":2,"columnArticles":41,"formTitle":"[805]数组的均值分割","frequency":0.0,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","submitted":9161,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.656714244101369,"acs":13527,"articleLive":2,"columnArticles":152,"formTitle":"[806]写字符串需要的行数","frequency":0.0,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","submitted":20598,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.845751434811316,"acs":16652,"articleLive":2,"columnArticles":222,"formTitle":"[807]保持城市天际线","frequency":0.0,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","submitted":19689,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.4807671352293778,"acs":4412,"articleLive":2,"columnArticles":42,"formTitle":"[808]分汤","frequency":0.0,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","submitted":9177,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.41931093151850274,"acs":4929,"articleLive":2,"columnArticles":91,"formTitle":"[809]情感丰富的文字","frequency":0.0,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","submitted":11755,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7334832848196172,"acs":16631,"articleLive":2,"columnArticles":134,"formTitle":"[810]黑板异或游戏","frequency":0.0,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"ac","submitted":22674,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7047379981173517,"acs":15722,"articleLive":2,"columnArticles":200,"formTitle":"[811]子域名访问计数","frequency":0.0,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","questionId":"829","status":"","submitted":22309,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.6303719963031423,"acs":10913,"articleLive":2,"columnArticles":100,"formTitle":"[812]最大三角形面积","frequency":0.0,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","submitted":17312,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5505847264735892,"acs":7015,"articleLive":2,"columnArticles":83,"formTitle":"[813]最大平均值和的分组","frequency":0.0,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","submitted":12741,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.6991290097417378,"acs":23037,"articleLive":2,"columnArticles":358,"formTitle":"[814]二叉树剪枝","frequency":0.0,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","submitted":32951,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.433573452043707,"acs":26784,"articleLive":2,"columnArticles":317,"formTitle":"[815]公交路线","frequency":0.0,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"ac","submitted":61775,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.5113960113960114,"acs":3590,"articleLive":2,"columnArticles":65,"formTitle":"[816]模糊坐标","frequency":0.0,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","submitted":7020,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5912119496581457,"acs":13576,"articleLive":2,"columnArticles":166,"formTitle":"[817]链表组件","frequency":0.0,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"ac","submitted":22963,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.43340030729228224,"acs":3667,"articleLive":2,"columnArticles":45,"formTitle":"[818]赛车","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","submitted":8461,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.4214158716806546,"acs":22043,"articleLive":2,"columnArticles":250,"formTitle":"[819]最常见的单词","frequency":0.0,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","submitted":52307,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5077942394405079,"acs":55182,"articleLive":2,"columnArticles":603,"formTitle":"[820]单词的压缩编码","frequency":0.0,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","submitted":108670,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.6927165083298912,"acs":25156,"articleLive":2,"columnArticles":339,"formTitle":"[821]字符的最短距离","frequency":0.0,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","submitted":36315,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5024390243902439,"acs":2884,"articleLive":2,"columnArticles":41,"formTitle":"[822]翻转卡片游戏","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","submitted":5740,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.42852996662313164,"acs":2953,"articleLive":2,"columnArticles":54,"formTitle":"[823]带因子的二叉树","frequency":0.0,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","submitted":6891,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6157488344988346,"acs":16906,"articleLive":2,"columnArticles":239,"formTitle":"[824]山羊拉丁文","frequency":0.0,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","submitted":27456,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.3927819372952738,"acs":6715,"articleLive":2,"columnArticles":91,"formTitle":"[825]适龄的朋友","frequency":0.0,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"","submitted":17096,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.37494571249336484,"acs":7770,"articleLive":2,"columnArticles":116,"formTitle":"[826]安排工作以达到最大收益","frequency":0.0,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","submitted":20723,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.3895442586777561,"acs":9180,"articleLive":2,"columnArticles":183,"formTitle":"[827]最大人工岛","frequency":0.0,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","submitted":23566,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.49179829890643983,"acs":3238,"articleLive":2,"columnArticles":53,"formTitle":"[828]统计子串中的唯一字符","frequency":0.0,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"855","status":"","submitted":6584,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.3658597662771286,"acs":8766,"articleLive":2,"columnArticles":101,"formTitle":"[829]连续整数求和","frequency":0.0,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","submitted":23960,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.543164115521958,"acs":52021,"articleLive":2,"columnArticles":582,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","submitted":95774,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.4056828003457217,"acs":7510,"articleLive":2,"columnArticles":73,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","submitted":18512,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.7958722185666757,"acs":85877,"articleLive":2,"columnArticles":919,"formTitle":"[832]翻转图像","frequency":0.0,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","submitted":107903,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.4312437645493848,"acs":5187,"articleLive":2,"columnArticles":78,"formTitle":"[833]字符串中的查找与替换","frequency":0.0,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","submitted":12028,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5283427087840762,"acs":13431,"articleLive":2,"columnArticles":132,"formTitle":"[834]树中距离之和","frequency":0.0,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","submitted":25421,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.574654622741764,"acs":4326,"articleLive":2,"columnArticles":49,"formTitle":"[835]图像重叠","frequency":0.0,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","submitted":7528,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.4795152621437988,"acs":37828,"articleLive":2,"columnArticles":657,"formTitle":"[836]矩形重叠","frequency":0.0,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","submitted":78888,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.3959404324765402,"acs":19409,"articleLive":2,"columnArticles":245,"formTitle":"[837]新21点","frequency":0.0,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","submitted":49020,"title":"新21点","titleSlug":"new-21-game"},{"acceptance":0.5010426803837064,"acs":7208,"articleLive":2,"columnArticles":124,"formTitle":"[838]推多米诺","frequency":0.0,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","submitted":14386,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5747578057046879,"acs":19163,"articleLive":2,"columnArticles":269,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","submitted":33341,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.36005418542571416,"acs":9037,"articleLive":2,"columnArticles":114,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","submitted":25099,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.6580521825326583,"acs":55764,"articleLive":2,"columnArticles":546,"formTitle":"[841]钥匙和房间","frequency":0.0,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"ac","submitted":84741,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.488137980794008,"acs":28415,"articleLive":2,"columnArticles":321,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":0.0,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","submitted":58211,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.3799132556248306,"acs":2803,"articleLive":2,"columnArticles":35,"formTitle":"[843]猜猜这个单词","frequency":0.0,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","submitted":7378,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5123547986917785,"acs":90861,"articleLive":2,"columnArticles":993,"formTitle":"[844]比较含退格的字符串","frequency":0.0,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"ac","submitted":177340,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.42128701848140726,"acs":37840,"articleLive":2,"columnArticles":557,"formTitle":"[845]数组中的最长山脉","frequency":0.0,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","submitted":89820,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5117774270851598,"acs":8756,"articleLive":2,"columnArticles":123,"formTitle":"[846]一手顺子","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","submitted":17109,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.6809028787438208,"acs":18733,"articleLive":2,"columnArticles":158,"formTitle":"[847]访问所有节点的最短路径","frequency":0.0,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"ac","submitted":27512,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.44931831653823356,"acs":9096,"articleLive":2,"columnArticles":97,"formTitle":"[848]字母移位","frequency":0.0,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","submitted":20244,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.42700039941419254,"acs":16036,"articleLive":2,"columnArticles":187,"formTitle":"[849]到最近的人的最大距离","frequency":0.0,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","submitted":37555,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.44920868605079134,"acs":2441,"articleLive":2,"columnArticles":42,"formTitle":"[850]矩形面积 II","frequency":0.0,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","submitted":5434,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.48208541320022186,"acs":4346,"articleLive":2,"columnArticles":72,"formTitle":"[851]喧闹和富有","frequency":0.0,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","submitted":9015,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.71572427705671,"acs":85859,"articleLive":2,"columnArticles":743,"formTitle":"[852]山脉数组的峰顶索引","frequency":0.0,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"ac","submitted":119961,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.3839749094574917,"acs":10284,"articleLive":2,"columnArticles":123,"formTitle":"[853]车队","frequency":0.0,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","submitted":26783,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.3598292001970767,"acs":4382,"articleLive":2,"columnArticles":68,"formTitle":"[854]相似度为 K 的字符串","frequency":0.0,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","submitted":12178,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.4086506346025384,"acs":4894,"articleLive":2,"columnArticles":58,"formTitle":"[855]考场就座","frequency":0.0,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","submitted":11976,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6270563929910475,"acs":16390,"articleLive":2,"columnArticles":218,"formTitle":"[856]括号的分数","frequency":0.0,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"ac","submitted":26138,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.46654360867558836,"acs":3033,"articleLive":2,"columnArticles":47,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":0.0,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","submitted":6501,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5558536118030274,"acs":2901,"articleLive":2,"columnArticles":49,"formTitle":"[858]镜面反射","frequency":0.0,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","submitted":5219,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.30233510414758463,"acs":28057,"articleLive":2,"columnArticles":365,"formTitle":"[859]亲密字符串","frequency":0.0,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","submitted":92801,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.586971343969766,"acs":90393,"articleLive":2,"columnArticles":776,"formTitle":"[860]柠檬水找零","frequency":0.0,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"ac","submitted":153999,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8085761181780878,"acs":31528,"articleLive":2,"columnArticles":441,"formTitle":"[861]翻转矩阵后的得分","frequency":0.0,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"ac","submitted":38992,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.19253097345132744,"acs":16317,"articleLive":2,"columnArticles":129,"formTitle":"[862]和至少为 K 的最短子数组","frequency":0.0,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","submitted":84750,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.604525549932696,"acs":35479,"articleLive":2,"columnArticles":564,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":0.0,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"ac","submitted":58689,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.45676241771394377,"acs":3053,"articleLive":2,"columnArticles":44,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.0,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","submitted":6684,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.6585824947513212,"acs":9097,"articleLive":2,"columnArticles":132,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.0,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","submitted":13813,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.224899958191483,"acs":7531,"articleLive":2,"columnArticles":85,"formTitle":"[866]回文素数","frequency":0.0,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","submitted":33486,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6701664737115254,"acs":83935,"articleLive":2,"columnArticles":753,"formTitle":"[867]转置矩阵","frequency":0.0,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","submitted":125245,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6248004257583821,"acs":16436,"articleLive":2,"columnArticles":237,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","submitted":26306,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.5512907608695652,"acs":6492,"articleLive":2,"columnArticles":97,"formTitle":"[869]重新排序得到 2 的幂","frequency":0.0,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"","submitted":11776,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.42977592317365954,"acs":15037,"articleLive":2,"columnArticles":192,"formTitle":"[870]优势洗牌","frequency":0.0,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"ac","submitted":34988,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.34291537058886623,"acs":9591,"articleLive":2,"columnArticles":128,"formTitle":"[871]最低加油次数","frequency":0.0,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","submitted":27969,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6519855518049493,"acs":60649,"articleLive":2,"columnArticles":725,"formTitle":"[872]叶子相似的树","frequency":0.0,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"ac","submitted":93022,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5117910348052642,"acs":15322,"articleLive":2,"columnArticles":113,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":0.0,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","submitted":29938,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.4160936591624401,"acs":20756,"articleLive":2,"columnArticles":229,"formTitle":"[874]模拟行走机器人","frequency":0.0,"frontendQuestionId":"874","leaf":true,"level":2,"nodeType":"def","questionId":"906","status":"","submitted":49883,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.4797936279985107,"acs":45103,"articleLive":2,"columnArticles":355,"formTitle":"[875]爱吃香蕉的珂珂","frequency":0.0,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","submitted":94005,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7063929570511766,"acs":154539,"articleLive":2,"columnArticles":1666,"formTitle":"[876]链表的中间结点","frequency":0.0,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"ac","submitted":218772,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7573552217643671,"acs":68371,"articleLive":2,"columnArticles":485,"formTitle":"[877]石子游戏","frequency":0.0,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"ac","submitted":90276,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.2812440252373972,"acs":4413,"articleLive":2,"columnArticles":62,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","submitted":15691,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5544225569718038,"acs":21531,"articleLive":2,"columnArticles":181,"formTitle":"[879]盈利计划","frequency":0.0,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"ac","submitted":38835,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.2528837248463417,"acs":6007,"articleLive":2,"columnArticles":78,"formTitle":"[880]索引处的解码字符串","frequency":0.0,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"ac","submitted":23754,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.5377682061099146,"acs":47194,"articleLive":2,"columnArticles":577,"formTitle":"[881]救生艇","frequency":0.0,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"ac","submitted":87759,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.4831763122476447,"acs":1795,"articleLive":2,"columnArticles":32,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","submitted":3715,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.6897312980951179,"acs":10935,"articleLive":2,"columnArticles":111,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","submitted":15854,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6617791141592622,"acs":19588,"articleLive":2,"columnArticles":255,"formTitle":"[884]两句话中的不常见单词","frequency":0.0,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","submitted":29599,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6926150658576291,"acs":4680,"articleLive":2,"columnArticles":71,"formTitle":"[885]螺旋矩阵 III","frequency":0.0,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","submitted":6757,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.42699548931162973,"acs":8709,"articleLive":2,"columnArticles":117,"formTitle":"[886]可能的二分法","frequency":0.0,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","submitted":20396,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.29143431809578696,"acs":51583,"articleLive":2,"columnArticles":338,"formTitle":"[887]鸡蛋掉落","frequency":0.0,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","submitted":176997,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6405542357608454,"acs":54736,"articleLive":2,"columnArticles":457,"formTitle":"[888]公平的糖果棒交换","frequency":0.0,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","submitted":85451,"title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"acceptance":0.676325149648651,"acs":15592,"articleLive":2,"columnArticles":149,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":0.0,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"925","status":"","submitted":23054,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.7268324714766478,"acs":8855,"articleLive":2,"columnArticles":121,"formTitle":"[890]查找和替换模式","frequency":0.0,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","submitted":12183,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.3304458304458304,"acs":2861,"articleLive":2,"columnArticles":39,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","submitted":8658,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6386660795987519,"acs":33362,"articleLive":2,"columnArticles":682,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","submitted":52237,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.7250773577290461,"acs":10779,"articleLive":2,"columnArticles":105,"formTitle":"[893]特殊等价字符串组","frequency":0.0,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","questionId":"929","status":"","submitted":14866,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7748635803555712,"acs":13206,"articleLive":2,"columnArticles":122,"formTitle":"[894]所有可能的满二叉树","frequency":0.0,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","submitted":17043,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.5466889175453236,"acs":7207,"articleLive":2,"columnArticles":83,"formTitle":"[895]最大频率栈","frequency":0.0,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","submitted":13183,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5867664682422742,"acs":59734,"articleLive":2,"columnArticles":718,"formTitle":"[896]单调数列","frequency":0.0,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","submitted":101802,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.7439388154440891,"acs":62351,"articleLive":2,"columnArticles":711,"formTitle":"[897]递增顺序搜索树","frequency":0.0,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"ac","submitted":83812,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.33804225528191023,"acs":5408,"articleLive":2,"columnArticles":37,"formTitle":"[898]子数组按位或操作","frequency":0.0,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","submitted":15998,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5365480290853425,"acs":4206,"articleLive":2,"columnArticles":47,"formTitle":"[899]有序队列","frequency":0.0,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","submitted":7839,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.4939006680220738,"acs":3401,"articleLive":2,"columnArticles":50,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","submitted":6886,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.5462180073126143,"acs":19122,"articleLive":2,"columnArticles":235,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"ac","submitted":35008,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.32926709296606,"acs":3347,"articleLive":2,"columnArticles":78,"formTitle":"[902]最大为 N 的数字组合","frequency":0.0,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","submitted":10165,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.5311428055605705,"acs":2942,"articleLive":2,"columnArticles":43,"formTitle":"[903]DI 序列的有效排列","frequency":0.0,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","submitted":5539,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.45292999956816515,"acs":20977,"articleLive":2,"columnArticles":291,"formTitle":"[904]水果成篮","frequency":0.0,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","submitted":46314,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.7004587817063798,"acs":58323,"articleLive":2,"columnArticles":605,"formTitle":"[905]按奇偶排序数组","frequency":0.0,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","submitted":83264,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.2777009181235065,"acs":2208,"articleLive":2,"columnArticles":40,"formTitle":"[906]超级回文数","frequency":0.0,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","submitted":7951,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.3177759290072102,"acs":11459,"articleLive":2,"columnArticles":129,"formTitle":"[907]子数组的最小值之和","frequency":0.0,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"ac","submitted":36060,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.69872843173247,"acs":20936,"articleLive":2,"columnArticles":192,"formTitle":"[908]最小差值 I","frequency":0.0,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","submitted":29963,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.4596534863344733,"acs":16263,"articleLive":2,"columnArticles":193,"formTitle":"[909]蛇梯棋","frequency":0.0,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"ac","submitted":35381,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.31929555895865236,"acs":6672,"articleLive":2,"columnArticles":69,"formTitle":"[910]最小差值 II","frequency":0.0,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","submitted":20896,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.42663656884875845,"acs":4536,"articleLive":2,"columnArticles":69,"formTitle":"[911]在线选举","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","submitted":10632,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.5599895237889284,"acs":233057,"articleLive":2,"columnArticles":1069,"formTitle":"[912]排序数组","frequency":0.0,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"ac","submitted":416181,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.40008352474420544,"acs":1916,"articleLive":2,"columnArticles":34,"formTitle":"[913]猫和老鼠","frequency":0.0,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","submitted":4789,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.3888049249467862,"acs":49136,"articleLive":2,"columnArticles":620,"formTitle":"[914]卡牌分组","frequency":0.0,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"950","status":"ac","submitted":126377,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.4693715589504489,"acs":9463,"articleLive":2,"columnArticles":116,"formTitle":"[915]分割数组","frequency":0.0,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","submitted":20161,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.44196798233508144,"acs":6405,"articleLive":2,"columnArticles":76,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","submitted":14492,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5702077586373194,"acs":29559,"articleLive":2,"columnArticles":436,"formTitle":"[917]仅仅反转字母","frequency":0.0,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","submitted":51839,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.3581584632647251,"acs":21386,"articleLive":2,"columnArticles":230,"formTitle":"[918]环形子数组的最大和","frequency":0.0,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","submitted":59711,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.634368433341116,"acs":5434,"articleLive":2,"columnArticles":103,"formTitle":"[919]完全二叉树插入器","frequency":0.0,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","submitted":8566,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.48348813209494323,"acs":1874,"articleLive":2,"columnArticles":20,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","submitted":3876,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.7383138418572177,"acs":21149,"articleLive":2,"columnArticles":313,"formTitle":"[921]使括号有效的最少添加","frequency":0.0,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"ac","submitted":28645,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7139823457631417,"acs":90106,"articleLive":2,"columnArticles":829,"formTitle":"[922]按奇偶排序数组 II","frequency":0.0,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"ac","submitted":126202,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.33888619332578573,"acs":6286,"articleLive":2,"columnArticles":83,"formTitle":"[923]三数之和的多种可能","frequency":0.0,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","submitted":18549,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.3592790539003866,"acs":6319,"articleLive":2,"columnArticles":94,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.0,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","submitted":17588,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.3876887945501498,"acs":50593,"articleLive":2,"columnArticles":680,"formTitle":"[925]长按键入","frequency":0.0,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","submitted":130499,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.5232851571461344,"acs":6843,"articleLive":2,"columnArticles":125,"formTitle":"[926]将字符串翻转到单调递增","frequency":0.0,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","submitted":13077,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.3373975809598127,"acs":3459,"articleLive":2,"columnArticles":70,"formTitle":"[927]三等分","frequency":0.0,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","submitted":10252,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.4194156456173421,"acs":2225,"articleLive":2,"columnArticles":43,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","submitted":5305,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6443628552874769,"acs":25799,"articleLive":2,"columnArticles":233,"formTitle":"[929]独特的电子邮件地址","frequency":0.0,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","submitted":40038,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.5449658812926483,"acs":33862,"articleLive":2,"columnArticles":343,"formTitle":"[930]和相同的二元子数组","frequency":0.0,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"ac","submitted":62136,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6654571616253245,"acs":21274,"articleLive":2,"columnArticles":272,"formTitle":"[931]下降路径最小和","frequency":0.0,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","submitted":31969,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6326096523397389,"acs":8625,"articleLive":2,"columnArticles":83,"formTitle":"[932]漂亮数组","frequency":0.0,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","submitted":13634,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.7253452364346492,"acs":36400,"articleLive":2,"columnArticles":314,"formTitle":"[933]最近的请求次数","frequency":0.0,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","submitted":50183,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.4731047937569677,"acs":23765,"articleLive":2,"columnArticles":272,"formTitle":"[934]最短的桥","frequency":0.0,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","submitted":50232,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.47484349640621376,"acs":6144,"articleLive":2,"columnArticles":80,"formTitle":"[935]骑士拨号器","frequency":0.0,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","submitted":12939,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.3789346246973366,"acs":1565,"articleLive":2,"columnArticles":26,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","submitted":4130,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.5870663686716548,"acs":12083,"articleLive":2,"columnArticles":128,"formTitle":"[937]重新排列日志文件","frequency":0.0,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","submitted":20582,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8188109071646585,"acs":97382,"articleLive":2,"columnArticles":804,"formTitle":"[938]二叉搜索树的范围和","frequency":0.0,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"ac","submitted":118931,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.4531635168447001,"acs":5515,"articleLive":2,"columnArticles":63,"formTitle":"[939]最小面积矩形","frequency":0.0,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","submitted":12170,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.42150356992860144,"acs":5018,"articleLive":2,"columnArticles":66,"formTitle":"[940]不同的子序列 II","frequency":0.0,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"notac","submitted":11905,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.39270448498909327,"acs":62290,"articleLive":2,"columnArticles":617,"formTitle":"[941]有效的山脉数组","frequency":0.0,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","submitted":158618,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7303905797567725,"acs":22702,"articleLive":2,"columnArticles":214,"formTitle":"[942]增减字符串匹配","frequency":0.0,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","submitted":31082,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.46874221668742216,"acs":1882,"articleLive":2,"columnArticles":43,"formTitle":"[943]最短超级串","frequency":0.0,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","submitted":4015,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6895960673975615,"acs":21323,"articleLive":2,"columnArticles":181,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","submitted":30921,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.48608087198236316,"acs":35498,"articleLive":2,"columnArticles":537,"formTitle":"[945]使数组唯一的最小增量","frequency":0.0,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","submitted":73029,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.6246207887593805,"acs":27384,"articleLive":2,"columnArticles":301,"formTitle":"[946]验证栈序列","frequency":0.0,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"ac","submitted":43841,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6124953078078078,"acs":26107,"articleLive":2,"columnArticles":339,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"","submitted":42624,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.3916312708070256,"acs":6823,"articleLive":2,"columnArticles":98,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","submitted":17422,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.37107084600802365,"acs":8417,"articleLive":2,"columnArticles":120,"formTitle":"[949]给定数字能组成的最大时间","frequency":0.0,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","submitted":22683,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7750805247859219,"acs":9866,"articleLive":2,"columnArticles":148,"formTitle":"[950]按递增顺序显示卡牌","frequency":0.0,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","submitted":12729,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6635597245309902,"acs":11177,"articleLive":2,"columnArticles":169,"formTitle":"[951]翻转等价二叉树","frequency":0.0,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","submitted":16844,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.3521833314331319,"acs":3089,"articleLive":2,"columnArticles":59,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","submitted":8771,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.5531113986589813,"acs":14106,"articleLive":2,"columnArticles":170,"formTitle":"[953]验证外星语词典","frequency":0.0,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","submitted":25503,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.3010195412064571,"acs":7086,"articleLive":2,"columnArticles":106,"formTitle":"[954]二倍数对数组","frequency":0.0,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","submitted":23540,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.3295050309990853,"acs":3242,"articleLive":2,"columnArticles":51,"formTitle":"[955]删列造序 II","frequency":0.0,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","submitted":9839,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.43782439446366783,"acs":4049,"articleLive":2,"columnArticles":52,"formTitle":"[956]最高的广告牌","frequency":0.0,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","submitted":9248,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.361033696478338,"acs":14250,"articleLive":2,"columnArticles":140,"formTitle":"[957]N 天后的牢房","frequency":0.0,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","submitted":39470,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5361999657885734,"acs":25077,"articleLive":2,"columnArticles":232,"formTitle":"[958]二叉树的完全性检验","frequency":0.0,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","submitted":46768,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7427956339464441,"acs":19667,"articleLive":2,"columnArticles":305,"formTitle":"[959]由斜杠划分区域","frequency":0.0,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","submitted":26477,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5551257253384912,"acs":2009,"articleLive":2,"columnArticles":33,"formTitle":"[960]删列造序 III","frequency":0.0,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","submitted":3619,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6768761820819332,"acs":36862,"articleLive":2,"columnArticles":305,"formTitle":"[961]重复 N 次的元素","frequency":0.0,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","submitted":54459,"title":"重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.4433458831232608,"acs":13542,"articleLive":2,"columnArticles":135,"formTitle":"[962]最大宽度坡","frequency":0.0,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","submitted":30545,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.503966679888933,"acs":2541,"articleLive":2,"columnArticles":33,"formTitle":"[963]最小面积矩形 II","frequency":0.0,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","submitted":5042,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.43215339233038347,"acs":1465,"articleLive":2,"columnArticles":27,"formTitle":"[964]表示数字的最少运算符","frequency":0.0,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","submitted":3390,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6839434652204281,"acs":33293,"articleLive":2,"columnArticles":394,"formTitle":"[965]单值二叉树","frequency":0.0,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","submitted":48678,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.4040271966527197,"acs":3090,"articleLive":2,"columnArticles":50,"formTitle":"[966]元音拼写检查器","frequency":0.0,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","submitted":7648,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.46396207165576425,"acs":7731,"articleLive":2,"columnArticles":153,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","submitted":16663,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.4987241618039759,"acs":25213,"articleLive":2,"columnArticles":331,"formTitle":"[968]监控二叉树","frequency":0.0,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"","submitted":50555,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6510061463332492,"acs":15464,"articleLive":2,"columnArticles":198,"formTitle":"[969]煎饼排序","frequency":0.0,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","submitted":23754,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.4138240574506284,"acs":11064,"articleLive":2,"columnArticles":127,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","submitted":26736,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.4405648267008986,"acs":6864,"articleLive":2,"columnArticles":108,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":0.0,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","submitted":15580,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.41127747690347244,"acs":1291,"articleLive":2,"columnArticles":28,"formTitle":"[972]相等的有理数","frequency":0.0,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","submitted":3139,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.6413842567688721,"acs":67963,"articleLive":2,"columnArticles":638,"formTitle":"[973]最接近原点的 K 个点","frequency":0.0,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"ac","submitted":105963,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.46626192541196876,"acs":37632,"articleLive":2,"columnArticles":386,"formTitle":"[974]和可被 K 整除的子数组","frequency":0.0,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","submitted":80710,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.4474212034383954,"acs":3123,"articleLive":2,"columnArticles":47,"formTitle":"[975]奇偶跳","frequency":0.0,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","submitted":6980,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.5971498706001266,"acs":53762,"articleLive":2,"columnArticles":502,"formTitle":"[976]三角形的最大周长","frequency":0.0,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"ac","submitted":90031,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7097559699420011,"acs":176341,"articleLive":2,"columnArticles":1381,"formTitle":"[977]有序数组的平方","frequency":0.0,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"ac","submitted":248453,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.4733498520952267,"acs":43365,"articleLive":2,"columnArticles":600,"formTitle":"[978]最长湍流子数组","frequency":0.0,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","submitted":91613,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7132673599463267,"acs":8505,"articleLive":2,"columnArticles":133,"formTitle":"[979]在二叉树中分配硬币","frequency":0.0,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","submitted":11924,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7348504218869855,"acs":14370,"articleLive":2,"columnArticles":213,"formTitle":"[980]不同路径 III","frequency":0.0,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","submitted":19555,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5321849952705731,"acs":21380,"articleLive":2,"columnArticles":314,"formTitle":"[981]基于时间的键值存储","frequency":0.0,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"ac","submitted":40174,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5451832907075874,"acs":2558,"articleLive":2,"columnArticles":29,"formTitle":"[982]按位与为零的三元组","frequency":0.0,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","submitted":4692,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6341582324148287,"acs":32519,"articleLive":2,"columnArticles":455,"formTitle":"[983]最低票价","frequency":0.0,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","submitted":51279,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.4175395075339949,"acs":9089,"articleLive":2,"columnArticles":145,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":0.0,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","submitted":21768,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.6005456824717941,"acs":16288,"articleLive":2,"columnArticles":187,"formTitle":"[985]查询后的偶数和","frequency":0.0,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","questionId":"1027","status":"","submitted":27122,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6787598430312638,"acs":26118,"articleLive":2,"columnArticles":253,"formTitle":"[986]区间列表的交集","frequency":0.0,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"ac","submitted":38479,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5327455919395466,"acs":23265,"articleLive":2,"columnArticles":412,"formTitle":"[987]二叉树的垂序遍历","frequency":0.0,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"ac","submitted":43670,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.49864872025859786,"acs":9410,"articleLive":2,"columnArticles":112,"formTitle":"[988]从叶结点开始的最小字符串","frequency":0.0,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","submitted":18871,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.4713844395635792,"acs":52796,"articleLive":2,"columnArticles":596,"formTitle":"[989]数组形式的整数加法","frequency":0.0,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","submitted":112002,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.5030748462576872,"acs":33540,"articleLive":2,"columnArticles":503,"formTitle":"[990]等式方程的可满足性","frequency":0.0,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","submitted":66670,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5203579683518047,"acs":8780,"articleLive":2,"columnArticles":110,"formTitle":"[991]坏了的计算器","frequency":0.0,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","submitted":16873,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.4528193765281174,"acs":23706,"articleLive":2,"columnArticles":273,"formTitle":"[992]K 个不同整数的子数组","frequency":0.0,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","submitted":52352,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5570271537111525,"acs":51100,"articleLive":2,"columnArticles":809,"formTitle":"[993]二叉树的堂兄弟节点","frequency":0.0,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"ac","submitted":91737,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5094692627273311,"acs":55551,"articleLive":2,"columnArticles":1411,"formTitle":"[994]腐烂的橘子","frequency":0.0,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"ac","submitted":109037,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5396530514899707,"acs":21496,"articleLive":2,"columnArticles":251,"formTitle":"[995]K 连续位的最小翻转次数","frequency":0.0,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","submitted":39833,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.4940239043824701,"acs":4340,"articleLive":2,"columnArticles":88,"formTitle":"[996]正方形数组的数目","frequency":0.0,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","submitted":8785,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5102385067404078,"acs":36903,"articleLive":2,"columnArticles":401,"formTitle":"[997]找到小镇的法官","frequency":0.0,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","submitted":72325,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6150276066255902,"acs":7686,"articleLive":2,"columnArticles":111,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","submitted":12497,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6906404832469853,"acs":30527,"articleLive":2,"columnArticles":572,"formTitle":"[999]可以被一步捕获的棋子数","frequency":0.0,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","submitted":44201,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.41024759284731777,"acs":3579,"articleLive":2,"columnArticles":41,"formTitle":"[1000]合并石头的最低成本","frequency":0.0,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","submitted":8724,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.2920928946640863,"acs":2113,"articleLive":2,"columnArticles":54,"formTitle":"[1001]网格照明","frequency":0.0,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","submitted":7234,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7354251453954885,"acs":57283,"articleLive":2,"columnArticles":604,"formTitle":"[1002]查找共用字符","frequency":0.0,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","submitted":77891,"title":"查找共用字符","titleSlug":"find-common-characters"},{"acceptance":0.5770775263381679,"acs":12215,"articleLive":2,"columnArticles":187,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"ac","submitted":21167,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5970262052480798,"acs":67938,"articleLive":2,"columnArticles":717,"formTitle":"[1004]最大连续1的个数 III","frequency":0.0,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"ac","submitted":113794,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5303321660627897,"acs":26200,"articleLive":2,"columnArticles":423,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":0.0,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","submitted":49403,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.6273665727353829,"acs":44304,"articleLive":2,"columnArticles":605,"formTitle":"[1006]笨阶乘","frequency":0.0,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"ac","submitted":70619,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.4653436236677692,"acs":6331,"articleLive":2,"columnArticles":86,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","submitted":13605,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7226932462053849,"acs":17474,"articleLive":2,"columnArticles":222,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":0.0,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","submitted":24179,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5926909020965571,"acs":15407,"articleLive":2,"columnArticles":214,"formTitle":"[1009]十进制整数的反码","frequency":0.0,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","submitted":25995,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.45262104158019384,"acs":18538,"articleLive":2,"columnArticles":247,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":0.0,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","questionId":"1055","status":"","submitted":40957,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.626301652892562,"acs":60626,"articleLive":2,"columnArticles":582,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":0.0,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"ac","submitted":96800,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.3345991103395899,"acs":3084,"articleLive":2,"columnArticles":65,"formTitle":"[1012]至少有 1 位重复的数字","frequency":0.0,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","submitted":9217,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.3970092386539888,"acs":47098,"articleLive":2,"columnArticles":924,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":0.0,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1062","status":"","submitted":118632,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5512510318522102,"acs":38732,"articleLive":2,"columnArticles":458,"formTitle":"[1014]最佳观光组合","frequency":0.0,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","submitted":70262,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.35487858077650136,"acs":4881,"articleLive":2,"columnArticles":42,"formTitle":"[1015]可被 K 整除的最小整数","frequency":0.0,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","submitted":13754,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.582275662435983,"acs":5230,"articleLive":2,"columnArticles":81,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.0,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1065","status":"","submitted":8982,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.560441292356186,"acs":3556,"articleLive":2,"columnArticles":57,"formTitle":"[1017]负二进制转换","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","submitted":6345,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.5163547294525765,"acs":44059,"articleLive":2,"columnArticles":377,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","submitted":85327,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.5988988340595925,"acs":20341,"articleLive":2,"columnArticles":264,"formTitle":"[1019]链表中的下一个更大节点","frequency":0.0,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"ac","submitted":33964,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5370253708264131,"acs":9377,"articleLive":2,"columnArticles":139,"formTitle":"[1020]飞地的数量","frequency":0.0,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","submitted":17461,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7830202712753729,"acs":57902,"articleLive":2,"columnArticles":657,"formTitle":"[1021]删除最外层的括号","frequency":0.0,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"ac","submitted":73947,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7043284532145131,"acs":19917,"articleLive":2,"columnArticles":267,"formTitle":"[1022]从根到叶的二进制数之和","frequency":0.0,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","submitted":28278,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5641755634638197,"acs":7134,"articleLive":2,"columnArticles":156,"formTitle":"[1023]驼峰式匹配","frequency":0.0,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","submitted":12645,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5569704425308375,"acs":33504,"articleLive":2,"columnArticles":384,"formTitle":"[1024]视频拼接","frequency":0.0,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","submitted":60154,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7095886809813071,"acs":75579,"articleLive":2,"columnArticles":651,"formTitle":"[1025]除数博弈","frequency":0.0,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","submitted":106511,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6713671770077894,"acs":9998,"articleLive":2,"columnArticles":170,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","submitted":14892,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.4343181818181818,"acs":13377,"articleLive":2,"columnArticles":120,"formTitle":"[1027]最长等差数列","frequency":0.0,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"ac","submitted":30800,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7318939502802126,"acs":20373,"articleLive":2,"columnArticles":426,"formTitle":"[1028]从先序遍历还原二叉树","frequency":0.0,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","submitted":27836,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6562354221738455,"acs":16881,"articleLive":2,"columnArticles":182,"formTitle":"[1029]两地调度","frequency":0.0,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"ac","submitted":25724,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7105336931001858,"acs":40553,"articleLive":2,"columnArticles":444,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":0.0,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","submitted":57074,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.567290915435617,"acs":4877,"articleLive":2,"columnArticles":74,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","submitted":8597,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.3981872167526176,"acs":2548,"articleLive":2,"columnArticles":42,"formTitle":"[1032]字符流","frequency":0.0,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","submitted":6399,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.3908609600966493,"acs":11000,"articleLive":2,"columnArticles":168,"formTitle":"[1033]移动石子直到连续","frequency":0.0,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","questionId":"1103","status":"","submitted":28143,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.4327626010003848,"acs":4499,"articleLive":2,"columnArticles":99,"formTitle":"[1034]边框着色","frequency":0.0,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","submitted":10396,"title":"边框着色","titleSlug":"coloring-a-border"},{"acceptance":0.6337865867711454,"acs":35750,"articleLive":2,"columnArticles":388,"formTitle":"[1035]不相交的线","frequency":0.0,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"ac","submitted":56407,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.3000643323223968,"acs":3265,"articleLive":2,"columnArticles":55,"formTitle":"[1036]逃离大迷宫","frequency":0.0,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","submitted":10881,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.43825819301104474,"acs":9682,"articleLive":2,"columnArticles":113,"formTitle":"[1037]有效的回旋镖","frequency":0.0,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","submitted":22092,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.7935463756819954,"acs":25453,"articleLive":2,"columnArticles":320,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":0.0,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","submitted":32075,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5546875,"acs":4544,"articleLive":2,"columnArticles":61,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","submitted":8192,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.5209886229894076,"acs":2656,"articleLive":2,"columnArticles":31,"formTitle":"[1040]移动石子直到连续 II","frequency":0.0,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","submitted":5098,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.48304907761921334,"acs":6939,"articleLive":2,"columnArticles":115,"formTitle":"[1041]困于环中的机器人","frequency":0.0,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","submitted":14365,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5302660089438016,"acs":11502,"articleLive":2,"columnArticles":152,"formTitle":"[1042]不邻接植花","frequency":0.0,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","submitted":21691,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.690952976935455,"acs":7729,"articleLive":2,"columnArticles":101,"formTitle":"[1043]分隔数组以得到最大和","frequency":0.0,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","submitted":11186,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.20905797101449275,"acs":5770,"articleLive":2,"columnArticles":73,"formTitle":"[1044]最长重复子串","frequency":0.0,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"","submitted":27600,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6400871787163686,"acs":8517,"articleLive":2,"columnArticles":106,"formTitle":"[1045]买下所有产品的客户","frequency":0.0,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"lock","submitted":13306,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6599028408068611,"acs":66018,"articleLive":2,"columnArticles":916,"formTitle":"[1046]最后一块石头的重量","frequency":0.0,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","submitted":100042,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.7246755716119219,"acs":106715,"articleLive":2,"columnArticles":986,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":0.0,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"ac","submitted":147259,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.45554888468110655,"acs":9864,"articleLive":2,"columnArticles":137,"formTitle":"[1048]最长字符串链","frequency":0.0,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","submitted":21653,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6452939248577302,"acs":43316,"articleLive":2,"columnArticles":404,"formTitle":"[1049]最后一块石头的重量 II","frequency":0.0,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"ac","submitted":67126,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.758200251805712,"acs":11442,"articleLive":2,"columnArticles":54,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":0.0,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1136","status":"lock","submitted":15091,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7534990347490348,"acs":31225,"articleLive":2,"columnArticles":371,"formTitle":"[1051]高度检查器","frequency":0.0,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","submitted":41440,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5813765475299852,"acs":48181,"articleLive":2,"columnArticles":750,"formTitle":"[1052]爱生气的书店老板","frequency":0.0,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","submitted":82874,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.4583205167640726,"acs":5960,"articleLive":2,"columnArticles":96,"formTitle":"[1053]交换一次的先前排列","frequency":0.0,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","submitted":13004,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.3763252555850057,"acs":7951,"articleLive":2,"columnArticles":108,"formTitle":"[1054]距离相等的条形码","frequency":0.0,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","submitted":21128,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5882352941176471,"acs":4710,"articleLive":2,"columnArticles":88,"formTitle":"[1055]形成字符串的最短路径","frequency":0.0,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"lock","submitted":8007,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.41030902945436987,"acs":3399,"articleLive":2,"columnArticles":66,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"lock","submitted":8284,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.46603716113310995,"acs":3060,"articleLive":2,"columnArticles":39,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"lock","submitted":6566,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.342360756259581,"acs":1340,"articleLive":2,"columnArticles":31,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"lock","submitted":3914,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.36307153098613987,"acs":2279,"articleLive":2,"columnArticles":37,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"511","status":"lock","submitted":6277,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.5300447346149196,"acs":4384,"articleLive":2,"columnArticles":64,"formTitle":"[1060]有序数组中的缺失元素","frequency":0.0,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"lock","submitted":8271,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.606113158465207,"acs":2796,"articleLive":2,"columnArticles":60,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"lock","submitted":4613,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.5430308699719364,"acs":3483,"articleLive":2,"columnArticles":48,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"lock","submitted":6414,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.7065548780487805,"acs":1854,"articleLive":2,"columnArticles":40,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"lock","submitted":2624,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.650954896383584,"acs":4806,"articleLive":2,"columnArticles":68,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"lock","submitted":7383,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5426545535120763,"acs":2449,"articleLive":2,"columnArticles":69,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"lock","submitted":4513,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.47478701358507946,"acs":2062,"articleLive":2,"columnArticles":42,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"lock","submitted":4343,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.42333163525216505,"acs":831,"articleLive":2,"columnArticles":26,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"lock","submitted":1963,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.8642894461859979,"acs":13234,"articleLive":2,"columnArticles":64,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"lock","submitted":15312,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8190197512801756,"acs":11196,"articleLive":2,"columnArticles":55,"formTitle":"[1069]产品销售分析 II","frequency":0.0,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"lock","submitted":13670,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.48095005495176457,"acs":7877,"articleLive":2,"columnArticles":71,"formTitle":"[1070]产品销售分析 III","frequency":0.0,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"lock","submitted":16378,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5866668920975214,"acs":34699,"articleLive":2,"columnArticles":673,"formTitle":"[1071]字符串的最大公因子","frequency":0.0,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"ac","submitted":59146,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5799198187205856,"acs":3327,"articleLive":2,"columnArticles":55,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":0.0,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1147","status":"","submitted":5737,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.3341618337475835,"acs":2420,"articleLive":2,"columnArticles":54,"formTitle":"[1073]负二进制数相加","frequency":0.0,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","submitted":7242,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6694394213381555,"acs":18510,"articleLive":2,"columnArticles":186,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":0.0,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"ac","submitted":27650,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6943136544730171,"acs":9585,"articleLive":2,"columnArticles":72,"formTitle":"[1075]项目员工 I","frequency":0.0,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"lock","submitted":13805,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.49614903244440167,"acs":10307,"articleLive":2,"columnArticles":88,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"lock","submitted":20774,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7204301075268817,"acs":7571,"articleLive":2,"columnArticles":87,"formTitle":"[1077]项目员工 III","frequency":0.0,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"lock","submitted":10509,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.6220025241901557,"acs":11828,"articleLive":2,"columnArticles":187,"formTitle":"[1078]Bigram 分词","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","submitted":19016,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.7344983818770227,"acs":11348,"articleLive":2,"columnArticles":188,"formTitle":"[1079]活字印刷","frequency":0.0,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","submitted":15450,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.49093847396975643,"acs":4253,"articleLive":2,"columnArticles":93,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","submitted":8663,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.5707204610951009,"acs":14853,"articleLive":2,"columnArticles":149,"formTitle":"[1081]不同字符的最小子序列","frequency":0.0,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"ac","submitted":26025,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7607516210136297,"acs":11498,"articleLive":2,"columnArticles":92,"formTitle":"[1082]销售分析 I ","frequency":0.0,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"lock","submitted":15114,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.5278914280011975,"acs":10580,"articleLive":2,"columnArticles":96,"formTitle":"[1083]销售分析 II","frequency":0.0,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"lock","submitted":20042,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5369994271728376,"acs":10312,"articleLive":2,"columnArticles":94,"formTitle":"[1084]销售分析III","frequency":0.0,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"lock","submitted":19203,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.773231031543052,"acs":3628,"articleLive":2,"columnArticles":73,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"lock","submitted":4692,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.690913971279023,"acs":5148,"articleLive":2,"columnArticles":80,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"lock","submitted":7451,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.5343065693430656,"acs":1830,"articleLive":2,"columnArticles":54,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"lock","submitted":3425,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.4510055626872058,"acs":1054,"articleLive":2,"columnArticles":34,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"lock","submitted":2337,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.5850055657510755,"acs":19445,"articleLive":2,"columnArticles":292,"formTitle":"[1089]复写零","frequency":0.0,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","submitted":33239,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5450637825845812,"acs":3931,"articleLive":2,"columnArticles":80,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","submitted":7212,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.3786640717684853,"acs":28407,"articleLive":2,"columnArticles":289,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":0.0,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"ac","submitted":75019,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.4898072646404744,"acs":2643,"articleLive":2,"columnArticles":52,"formTitle":"[1092]最短公共超序列","frequency":0.0,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","submitted":5396,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.3789074510607769,"acs":3697,"articleLive":2,"columnArticles":59,"formTitle":"[1093]大样本统计","frequency":0.0,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","submitted":9757,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.6081576638394565,"acs":27032,"articleLive":2,"columnArticles":379,"formTitle":"[1094]拼车","frequency":0.0,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","submitted":44449,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.3727656686024587,"acs":19770,"articleLive":2,"columnArticles":386,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","submitted":53036,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5480925986305837,"acs":1681,"articleLive":2,"columnArticles":47,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","submitted":3067,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.5201872440023405,"acs":6223,"articleLive":2,"columnArticles":111,"formTitle":"[1097]游戏玩法分析 V","frequency":0.0,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"lock","submitted":11963,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.4728159702163168,"acs":7366,"articleLive":2,"columnArticles":103,"formTitle":"[1098]小众书籍","frequency":0.0,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"lock","submitted":15579,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5807220302633147,"acs":4874,"articleLive":2,"columnArticles":91,"formTitle":"[1099]小于 K 的两数之和","frequency":0.0,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"lock","submitted":8393,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.7003949339507013,"acs":5143,"articleLive":2,"columnArticles":101,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":0.0,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1084","status":"lock","submitted":7343,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6673130193905817,"acs":2409,"articleLive":2,"columnArticles":54,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1085","status":"lock","submitted":3610,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.3700069589422408,"acs":5317,"articleLive":2,"columnArticles":68,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"lock","submitted":14370,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6366234926306387,"acs":35635,"articleLive":2,"columnArticles":1104,"formTitle":"[1103]分糖果 II","frequency":0.0,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","submitted":55975,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.7609607218683652,"acs":28673,"articleLive":2,"columnArticles":672,"formTitle":"[1104]二叉树寻路","frequency":0.0,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"ac","submitted":37680,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5591664867199309,"acs":5179,"articleLive":2,"columnArticles":68,"formTitle":"[1105]填充书架","frequency":0.0,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","submitted":9262,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.5774456521739131,"acs":4250,"articleLive":2,"columnArticles":125,"formTitle":"[1106]解析布尔表达式","frequency":0.0,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","submitted":7360,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.41199582540364665,"acs":6711,"articleLive":2,"columnArticles":94,"formTitle":"[1107]每日新用户统计","frequency":0.0,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"lock","submitted":16289,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.8394996938686259,"acs":67186,"articleLive":2,"columnArticles":685,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","submitted":80031,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.5770628683693517,"acs":58745,"articleLive":2,"columnArticles":589,"formTitle":"[1109]航班预订统计","frequency":0.0,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"ac","submitted":101800,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6298708528167446,"acs":11315,"articleLive":2,"columnArticles":204,"formTitle":"[1110]删点成林","frequency":0.0,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","submitted":17964,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7713319292871275,"acs":24172,"articleLive":2,"columnArticles":399,"formTitle":"[1111]有效括号的嵌套深度","frequency":0.0,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"","submitted":31338,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.6453139525057043,"acs":7636,"articleLive":2,"columnArticles":87,"formTitle":"[1112]每位学生的最高成绩","frequency":0.0,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"lock","submitted":11833,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5408991570402747,"acs":6930,"articleLive":2,"columnArticles":48,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"lock","submitted":12812,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.6537353546382229,"acs":77837,"articleLive":2,"columnArticles":583,"formTitle":"[1114]按序打印","frequency":0.0,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","submitted":119065,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5614457831325301,"acs":43338,"articleLive":2,"columnArticles":480,"formTitle":"[1115]交替打印FooBar","frequency":0.0,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","submitted":77190,"title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5200136845706466,"acs":22800,"articleLive":2,"columnArticles":372,"formTitle":"[1116]打印零与奇偶数","frequency":0.0,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","submitted":43845,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.5212695943520402,"acs":17425,"articleLive":2,"columnArticles":252,"formTitle":"[1117]H2O 生成","frequency":0.0,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","submitted":33428,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.6431693989071038,"acs":2354,"articleLive":2,"columnArticles":37,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"lock","submitted":3660,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8668260733964029,"acs":8338,"articleLive":2,"columnArticles":146,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"lock","submitted":9619,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.6103836434642775,"acs":2657,"articleLive":2,"columnArticles":49,"formTitle":"[1120]子树的最大平均值","frequency":0.0,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"lock","submitted":4353,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5752351097178683,"acs":1101,"articleLive":2,"columnArticles":18,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"lock","submitted":1914,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.7068799341570916,"acs":65274,"articleLive":2,"columnArticles":873,"formTitle":"[1122]数组的相对排序","frequency":0.0,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","submitted":92341,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7026070441988951,"acs":8139,"articleLive":2,"columnArticles":105,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.0,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","submitted":11584,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.31837686335788873,"acs":12836,"articleLive":2,"columnArticles":133,"formTitle":"[1124]表现良好的最长时间段","frequency":0.0,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"ac","submitted":40317,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.4913806992105687,"acs":3050,"articleLive":2,"columnArticles":50,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","submitted":6207,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6932397237006002,"acs":6122,"articleLive":2,"columnArticles":94,"formTitle":"[1126]查询活跃业务","frequency":0.0,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"lock","submitted":8831,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.4132929883138564,"acs":3961,"articleLive":2,"columnArticles":74,"formTitle":"[1127]用户购买平台","frequency":0.0,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"lock","submitted":9584,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.5449898948478369,"acs":37213,"articleLive":2,"columnArticles":480,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":0.0,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","submitted":68282,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.3800855222968845,"acs":6222,"articleLive":2,"columnArticles":111,"formTitle":"[1129]颜色交替的最短路径","frequency":0.0,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","submitted":16370,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6292170591979631,"acs":5931,"articleLive":2,"columnArticles":104,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.0,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"ac","submitted":9426,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.4556719280129813,"acs":3089,"articleLive":2,"columnArticles":46,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","submitted":6779,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.3899407309845242,"acs":4737,"articleLive":2,"columnArticles":54,"formTitle":"[1132]报告的记录 II","frequency":0.0,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"lock","submitted":12148,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6480422349318082,"acs":2946,"articleLive":2,"columnArticles":63,"formTitle":"[1133]最大唯一数","frequency":0.0,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"lock","submitted":4546,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7764705882352941,"acs":3168,"articleLive":2,"columnArticles":53,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"lock","submitted":4080,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.536342123056119,"acs":6346,"articleLive":2,"columnArticles":73,"formTitle":"[1135]最低成本联通所有城市","frequency":0.0,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"lock","submitted":11832,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5691651432053626,"acs":2802,"articleLive":2,"columnArticles":49,"formTitle":"[1136]平行课程","frequency":0.0,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"lock","submitted":4923,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.6083891542182279,"acs":79744,"articleLive":2,"columnArticles":879,"formTitle":"[1137]第 N 个泰波那契数","frequency":0.0,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"ac","submitted":131074,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.4329701230228471,"acs":6159,"articleLive":2,"columnArticles":139,"formTitle":"[1138]字母板上的路径","frequency":0.0,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","submitted":14225,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.47850524077168466,"acs":9450,"articleLive":2,"columnArticles":154,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":0.0,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","submitted":19749,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.651772845200346,"acs":6783,"articleLive":2,"columnArticles":96,"formTitle":"[1140]石子游戏 II","frequency":0.0,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","submitted":10407,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.509832816708166,"acs":10033,"articleLive":2,"columnArticles":65,"formTitle":"[1141]查询近30天活跃用户数","frequency":0.0,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1245","status":"lock","submitted":19679,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.37056595721982183,"acs":6947,"articleLive":2,"columnArticles":50,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1246","status":"lock","submitted":18747,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6371331166497027,"acs":168386,"articleLive":2,"columnArticles":1136,"formTitle":"[1143]最长公共子序列","frequency":0.0,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"ac","submitted":264287,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.44205843350301577,"acs":10334,"articleLive":2,"columnArticles":146,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":0.0,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"notac","submitted":23377,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.4689445387662705,"acs":6629,"articleLive":2,"columnArticles":107,"formTitle":"[1145]二叉树着色游戏","frequency":0.0,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","submitted":14136,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.287301802412251,"acs":4240,"articleLive":2,"columnArticles":62,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","submitted":14758,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5617900643218832,"acs":4105,"articleLive":2,"columnArticles":82,"formTitle":"[1147]段式回文","frequency":0.0,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","submitted":7307,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7147819727580218,"acs":7819,"articleLive":2,"columnArticles":35,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"lock","submitted":10939,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.442135761589404,"acs":5341,"articleLive":2,"columnArticles":47,"formTitle":"[1149]文章浏览 II","frequency":0.0,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"lock","submitted":12080,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.6052935885905179,"acs":4711,"articleLive":2,"columnArticles":83,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":0.0,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1102","status":"lock","submitted":7783,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.4867511520737327,"acs":4225,"articleLive":2,"columnArticles":62,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":0.0,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"lock","submitted":8680,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.3876750700280112,"acs":1384,"articleLive":2,"columnArticles":33,"formTitle":"[1152]用户网站访问行为分析","frequency":0.0,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"lock","submitted":3570,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.3710869565217391,"acs":1707,"articleLive":2,"columnArticles":24,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"lock","submitted":4600,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.5698123620309051,"acs":14455,"articleLive":2,"columnArticles":224,"formTitle":"[1154]一年中的第几天","frequency":0.0,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","submitted":25368,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.4784118136032468,"acs":9784,"articleLive":2,"columnArticles":126,"formTitle":"[1155]掷骰子的N种方法","frequency":0.0,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","submitted":20451,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.43048590696870137,"acs":4979,"articleLive":2,"columnArticles":83,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.0,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","submitted":11566,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.32046734821614853,"acs":3072,"articleLive":2,"columnArticles":46,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":0.0,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","submitted":9586,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5501100220044008,"acs":5500,"articleLive":2,"columnArticles":61,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"lock","submitted":9998,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.48780799182943957,"acs":3821,"articleLive":2,"columnArticles":84,"formTitle":"[1159]市场分析 II","frequency":0.0,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"lock","submitted":7833,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6870380406581875,"acs":59582,"articleLive":2,"columnArticles":911,"formTitle":"[1160]拼写单词","frequency":0.0,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1112","status":"","submitted":86723,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6337631184407796,"acs":10568,"articleLive":2,"columnArticles":175,"formTitle":"[1161]最大层内元素和","frequency":0.0,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","submitted":16675,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.4695194222803309,"acs":38425,"articleLive":2,"columnArticles":494,"formTitle":"[1162]地图分析","frequency":0.0,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","submitted":81839,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.2674785746504285,"acs":5930,"articleLive":2,"columnArticles":102,"formTitle":"[1163]按字典序排在最后的子串","frequency":0.0,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","submitted":22170,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6076473712161444,"acs":5721,"articleLive":2,"columnArticles":85,"formTitle":"[1164]指定日期的产品价格","frequency":0.0,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"lock","submitted":9415,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.837329520457545,"acs":7613,"articleLive":2,"columnArticles":113,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"lock","submitted":9092,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.4841184867951463,"acs":2713,"articleLive":2,"columnArticles":48,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"lock","submitted":5604,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.43475032485613513,"acs":2342,"articleLive":2,"columnArticles":35,"formTitle":"[1167]连接棒材的最低费用","frequency":0.0,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"lock","submitted":5387,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5688793718772306,"acs":1594,"articleLive":2,"columnArticles":27,"formTitle":"[1168]水资源分配优化","frequency":0.0,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"lock","submitted":2802,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.3225406513757093,"acs":6764,"articleLive":2,"columnArticles":81,"formTitle":"[1169]查询无效交易","frequency":0.0,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","submitted":20971,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6167191011235955,"acs":13722,"articleLive":2,"columnArticles":216,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":0.0,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","questionId":"1273","status":"","submitted":22250,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.47484769999635207,"acs":13017,"articleLive":2,"columnArticles":154,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":0.0,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"ac","submitted":27413,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.2675193465176268,"acs":2489,"articleLive":2,"columnArticles":55,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","submitted":9304,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.7574822297044519,"acs":8099,"articleLive":2,"columnArticles":74,"formTitle":"[1173]即时食物配送 I","frequency":0.0,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"lock","submitted":10692,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.619095859187033,"acs":4889,"articleLive":2,"columnArticles":61,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"lock","submitted":7897,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.4916028483138519,"acs":7318,"articleLive":2,"columnArticles":114,"formTitle":"[1175]质数排列","frequency":0.0,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","submitted":14886,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.45075403016120646,"acs":4334,"articleLive":2,"columnArticles":61,"formTitle":"[1176]健身计划评估","frequency":0.0,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"lock","submitted":9615,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.2656041352573767,"acs":6166,"articleLive":2,"columnArticles":95,"formTitle":"[1177]构建回文串检测","frequency":0.0,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","submitted":23215,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.46191115086463924,"acs":18591,"articleLive":2,"columnArticles":184,"formTitle":"[1178]猜字谜","frequency":0.0,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","submitted":40248,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.6366553494534614,"acs":30753,"articleLive":2,"columnArticles":185,"formTitle":"[1179]重新格式化部门表","frequency":0.0,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","submitted":48304,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7762636273538157,"acs":3133,"articleLive":2,"columnArticles":69,"formTitle":"[1180]统计只含单一字母的子串","frequency":0.0,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1131","status":"lock","submitted":4036,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.37285180572851806,"acs":1497,"articleLive":2,"columnArticles":28,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"lock","submitted":4015,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.39778683750728017,"acs":2049,"articleLive":2,"columnArticles":42,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"lock","submitted":5151,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.599444958371878,"acs":648,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"lock","submitted":1081,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5850859586351339,"acs":13409,"articleLive":2,"columnArticles":262,"formTitle":"[1184]公交站间的距离","frequency":0.0,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","submitted":22918,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6077175609493569,"acs":11292,"articleLive":2,"columnArticles":205,"formTitle":"[1185]一周中的第几天","frequency":0.0,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","submitted":18581,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.3941142527409117,"acs":7513,"articleLive":2,"columnArticles":107,"formTitle":"[1186]删除一次得到子数组最大和","frequency":0.0,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","submitted":19063,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.4414691943127962,"acs":1863,"articleLive":2,"columnArticles":32,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","submitted":4220,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.693968253968254,"acs":3279,"articleLive":2,"columnArticles":66,"formTitle":"[1188]设计有限阻塞队列","frequency":0.0,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"lock","submitted":4725,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6456327108266929,"acs":20985,"articleLive":2,"columnArticles":328,"formTitle":"[1189]“气球” 的最大数量","frequency":0.0,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","submitted":32503,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6508463850656542,"acs":45254,"articleLive":2,"columnArticles":615,"formTitle":"[1190]反转每对括号间的子串","frequency":0.0,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"ac","submitted":69531,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.26744030945711617,"acs":6015,"articleLive":2,"columnArticles":96,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","submitted":22491,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.49866201279813843,"acs":4286,"articleLive":2,"columnArticles":50,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","submitted":8595,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.6010799136069115,"acs":5566,"articleLive":2,"columnArticles":73,"formTitle":"[1193]每月交易 I","frequency":0.0,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"lock","submitted":9260,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5060051472690877,"acs":3539,"articleLive":2,"columnArticles":63,"formTitle":"[1194]锦标赛优胜者","frequency":0.0,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"lock","submitted":6994,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6369740989447719,"acs":13944,"articleLive":2,"columnArticles":265,"formTitle":"[1195]交替打印字符串","frequency":0.0,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","submitted":21891,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6940164098459075,"acs":3468,"articleLive":2,"columnArticles":59,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.0,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"lock","submitted":4997,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.37043517954960437,"acs":4869,"articleLive":2,"columnArticles":61,"formTitle":"[1197]进击的骑士","frequency":0.0,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"lock","submitted":13144,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7464059804485337,"acs":3894,"articleLive":2,"columnArticles":57,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"lock","submitted":5217,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.43812907045589106,"acs":740,"articleLive":2,"columnArticles":17,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"lock","submitted":1689,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6854413450515858,"acs":17938,"articleLive":2,"columnArticles":253,"formTitle":"[1200]最小绝对差","frequency":0.0,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","submitted":26170,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.247324127788218,"acs":6054,"articleLive":2,"columnArticles":87,"formTitle":"[1201]丑数 III","frequency":0.0,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","submitted":24478,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.5032545264102948,"acs":26906,"articleLive":2,"columnArticles":296,"formTitle":"[1202]交换字符串中的元素","frequency":0.0,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","submitted":53464,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6218001228752816,"acs":12145,"articleLive":2,"columnArticles":144,"formTitle":"[1203]项目管理","frequency":0.0,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","submitted":19532,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7260785576303928,"acs":5638,"articleLive":2,"columnArticles":82,"formTitle":"[1204]最后一个能进入电梯的人","frequency":0.0,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1327","status":"lock","submitted":7765,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.4678732248008313,"acs":5403,"articleLive":2,"columnArticles":83,"formTitle":"[1205]每月交易II","frequency":0.0,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"lock","submitted":11548,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6126698429504147,"acs":6944,"articleLive":2,"columnArticles":90,"formTitle":"[1206]设计跳表","frequency":0.0,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","submitted":11334,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7305186502185905,"acs":59988,"articleLive":2,"columnArticles":834,"formTitle":"[1207]独一无二的出现次数","frequency":0.0,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","submitted":82117,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.49693430961906054,"acs":47575,"articleLive":2,"columnArticles":614,"formTitle":"[1208]尽可能使字符串相等","frequency":0.0,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","submitted":95737,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5289467969598263,"acs":12179,"articleLive":2,"columnArticles":159,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":0.0,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"ac","submitted":23025,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.4488626790227464,"acs":2664,"articleLive":2,"columnArticles":54,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":0.0,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","submitted":5935,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6558539395550829,"acs":7400,"articleLive":2,"columnArticles":62,"formTitle":"[1211]查询结果的质量和占比","frequency":0.0,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"lock","submitted":11283,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5095238095238095,"acs":5029,"articleLive":2,"columnArticles":99,"formTitle":"[1212]查询球队积分","frequency":0.0,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"lock","submitted":9870,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7754889178617992,"acs":5948,"articleLive":2,"columnArticles":126,"formTitle":"[1213]三个有序数组的交集","frequency":0.0,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"lock","submitted":7670,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6349981224183252,"acs":3382,"articleLive":2,"columnArticles":71,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":0.0,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"lock","submitted":5326,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.4121848739495798,"acs":1962,"articleLive":2,"columnArticles":40,"formTitle":"[1215]步进数","frequency":0.0,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"lock","submitted":4760,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5402843601895735,"acs":1482,"articleLive":2,"columnArticles":38,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"lock","submitted":2743,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6940911541755209,"acs":21884,"articleLive":2,"columnArticles":356,"formTitle":"[1217]玩筹码","frequency":0.0,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1329","status":"ac","submitted":31529,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.4227712246241077,"acs":8351,"articleLive":2,"columnArticles":114,"formTitle":"[1218]最长定差子序列","frequency":0.0,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"","submitted":19753,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6304075888668821,"acs":12095,"articleLive":2,"columnArticles":173,"formTitle":"[1219]黄金矿工","frequency":0.0,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","submitted":19186,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.526770060687795,"acs":3906,"articleLive":2,"columnArticles":75,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","submitted":7415,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.8439258614803475,"acs":76631,"articleLive":2,"columnArticles":1111,"formTitle":"[1221]分割平衡字符串","frequency":0.0,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"ac","submitted":90803,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6723350833143118,"acs":5891,"articleLive":2,"columnArticles":131,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.0,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","submitted":8762,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.4745383324006715,"acs":3392,"articleLive":2,"columnArticles":56,"formTitle":"[1223]掷骰子模拟","frequency":0.0,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","questionId":"1343","status":"","submitted":7148,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.3272828044894,"acs":4724,"articleLive":2,"columnArticles":70,"formTitle":"[1224]最大相等频率","frequency":0.0,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","submitted":14434,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5379685998077539,"acs":3358,"articleLive":2,"columnArticles":79,"formTitle":"[1225]报告系统状态的连续日期","frequency":0.0,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"lock","submitted":6242,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.5965017791810755,"acs":11902,"articleLive":2,"columnArticles":137,"formTitle":"[1226]哲学家进餐","frequency":0.0,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","submitted":19953,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6626989346310667,"acs":10077,"articleLive":2,"columnArticles":157,"formTitle":"[1227]飞机座位分配概率","frequency":0.0,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","submitted":15206,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5400593471810089,"acs":3094,"articleLive":2,"columnArticles":52,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"lock","submitted":5729,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.41906721536351166,"acs":2444,"articleLive":2,"columnArticles":45,"formTitle":"[1229]安排会议日程","frequency":0.0,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"lock","submitted":5832,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.495260663507109,"acs":3135,"articleLive":2,"columnArticles":63,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"lock","submitted":6330,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.5647362596827739,"acs":3062,"articleLive":2,"columnArticles":42,"formTitle":"[1231]分享巧克力","frequency":0.0,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"lock","submitted":5422,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.46953181339102457,"acs":33857,"articleLive":2,"columnArticles":422,"formTitle":"[1232]缀点成线","frequency":0.0,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","submitted":72108,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.4823043296005749,"acs":8054,"articleLive":2,"columnArticles":117,"formTitle":"[1233]删除子文件夹","frequency":0.0,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","submitted":16699,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.3440791387838231,"acs":5913,"articleLive":2,"columnArticles":90,"formTitle":"[1234]替换子串得到平衡字符串","frequency":0.0,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","submitted":17185,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.4633881364525241,"acs":6398,"articleLive":2,"columnArticles":111,"formTitle":"[1235]规划兼职工作","frequency":0.0,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","submitted":13807,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.562618595825427,"acs":1186,"articleLive":2,"columnArticles":32,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"lock","submitted":2108,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.7107709512825889,"acs":10169,"articleLive":2,"columnArticles":132,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","questionId":"1358","status":"","submitted":14307,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.6600167996640067,"acs":3143,"articleLive":2,"columnArticles":72,"formTitle":"[1238]循环码排列","frequency":0.0,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","submitted":4762,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.4910952239942468,"acs":34827,"articleLive":2,"columnArticles":385,"formTitle":"[1239]串联字符串的最大长度","frequency":0.0,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","questionId":"1360","status":"","submitted":70917,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.4956622325043378,"acs":2571,"articleLive":2,"columnArticles":39,"formTitle":"[1240]铺瓷砖","frequency":0.0,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","submitted":5187,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5934127279493859,"acs":6378,"articleLive":2,"columnArticles":64,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"lock","submitted":10748,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.47078907435508344,"acs":1241,"articleLive":2,"columnArticles":20,"formTitle":"[1242]多线程网页爬虫","frequency":0.0,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"lock","submitted":2636,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.540894901144641,"acs":2599,"articleLive":2,"columnArticles":56,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"lock","submitted":4805,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6212197580645161,"acs":2465,"articleLive":2,"columnArticles":42,"formTitle":"[1244]力扣排行榜","frequency":0.0,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"lock","submitted":3968,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5101220387652549,"acs":3553,"articleLive":2,"columnArticles":63,"formTitle":"[1245]树的直径","frequency":0.0,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"lock","submitted":6965,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.48145727822251266,"acs":2947,"articleLive":2,"columnArticles":42,"formTitle":"[1246]删除回文子数组","frequency":0.0,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"lock","submitted":6121,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.61766579375752,"acs":8727,"articleLive":2,"columnArticles":156,"formTitle":"[1247]交换字符使得字符串相同","frequency":0.0,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"ac","submitted":14129,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5598199176218909,"acs":35066,"articleLive":2,"columnArticles":482,"formTitle":"[1248]统计「优美子数组」","frequency":0.0,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","submitted":62638,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5754408883082952,"acs":22906,"articleLive":2,"columnArticles":321,"formTitle":"[1249]移除无效的括号","frequency":0.0,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"ac","submitted":39806,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5628865979381443,"acs":2730,"articleLive":2,"columnArticles":39,"formTitle":"[1250]检查「好数组」","frequency":0.0,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","submitted":4850,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7720038350910834,"acs":8052,"articleLive":2,"columnArticles":96,"formTitle":"[1251]平均售价","frequency":0.0,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"lock","submitted":10430,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.748644958417808,"acs":18094,"articleLive":2,"columnArticles":317,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","submitted":24169,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.39414144441114773,"acs":5261,"articleLive":2,"columnArticles":79,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":0.0,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","submitted":13348,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.5989457769787112,"acs":14658,"articleLive":2,"columnArticles":230,"formTitle":"[1254]统计封闭岛屿的数目","frequency":0.0,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"ac","submitted":24473,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6822514752610077,"acs":3006,"articleLive":2,"columnArticles":65,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","submitted":4406,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6675347222222222,"acs":1538,"articleLive":2,"columnArticles":37,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"lock","submitted":2304,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.5635189172562288,"acs":1832,"articleLive":2,"columnArticles":40,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"lock","submitted":3251,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.5559062218214608,"acs":1233,"articleLive":2,"columnArticles":44,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"lock","submitted":2218,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.47983578845689445,"acs":1987,"articleLive":2,"columnArticles":45,"formTitle":"[1259]不相交的握手","frequency":0.0,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"lock","submitted":4141,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6047051989544002,"acs":12492,"articleLive":2,"columnArticles":253,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","submitted":20658,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.7293386513310454,"acs":7863,"articleLive":2,"columnArticles":100,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","submitted":10781,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5253172157066806,"acs":13124,"articleLive":2,"columnArticles":202,"formTitle":"[1262]可被三整除的最大和","frequency":0.0,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","submitted":24983,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.4198709330465179,"acs":3123,"articleLive":2,"columnArticles":58,"formTitle":"[1263]推箱子","frequency":0.0,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","questionId":"1389","status":"","submitted":7438,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.5679515546756725,"acs":4877,"articleLive":2,"columnArticles":86,"formTitle":"[1264]页面推荐","frequency":0.0,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"lock","submitted":8587,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.9222815210140093,"acs":2765,"articleLive":2,"columnArticles":68,"formTitle":"[1265]逆序打印不可变链表","frequency":0.0,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"lock","submitted":2998,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8241737072405537,"acs":29948,"articleLive":2,"columnArticles":456,"formTitle":"[1266]访问所有点的最小时间","frequency":0.0,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","submitted":36337,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6072950290510006,"acs":9407,"articleLive":2,"columnArticles":147,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","submitted":15490,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.5853836075120105,"acs":8042,"articleLive":2,"columnArticles":145,"formTitle":"[1268]搜索推荐系统","frequency":0.0,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"ac","submitted":13738,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.4914967645432966,"acs":30230,"articleLive":2,"columnArticles":321,"formTitle":"[1269]停在原地的方案数","frequency":0.0,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","questionId":"1398","status":"ac","submitted":61506,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.8017909649826249,"acs":5999,"articleLive":2,"columnArticles":85,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":0.0,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","questionId":"1405","status":"lock","submitted":7482,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.507222451506397,"acs":2458,"articleLive":2,"columnArticles":40,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"lock","submitted":4846,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.5194471231115397,"acs":1616,"articleLive":2,"columnArticles":30,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"lock","submitted":3111,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.5432907899275612,"acs":1575,"articleLive":2,"columnArticles":47,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"lock","submitted":2899,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.6031843233312921,"acs":985,"articleLive":2,"columnArticles":25,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"lock","submitted":1633,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5425700687466949,"acs":8208,"articleLive":2,"columnArticles":170,"formTitle":"[1275]找出井字棋的获胜者","frequency":0.0,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","questionId":"1400","status":"","submitted":15128,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.501647130927756,"acs":6548,"articleLive":2,"columnArticles":97,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","questionId":"1401","status":"","submitted":13053,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7253008412237353,"acs":19227,"articleLive":2,"columnArticles":237,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":0.0,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","submitted":26509,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.5976389572060994,"acs":3645,"articleLive":2,"columnArticles":59,"formTitle":"[1278]分割回文串 III","frequency":0.0,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","submitted":6099,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.621011673151751,"acs":1596,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":0.0,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1410","status":"lock","submitted":2570,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.5058435720707222,"acs":6752,"articleLive":2,"columnArticles":70,"formTitle":"[1280]学生们参加各科测试的次数","frequency":0.0,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"lock","submitted":13348,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.8318527337668284,"acs":45415,"articleLive":2,"columnArticles":619,"formTitle":"[1281]整数的各位积和之差","frequency":0.0,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","questionId":"1406","status":"","submitted":54595,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.810537243706203,"acs":12492,"articleLive":2,"columnArticles":229,"formTitle":"[1282]用户分组","frequency":0.0,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","questionId":"1407","status":"","submitted":15412,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.4171186743756333,"acs":6998,"articleLive":2,"columnArticles":100,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":0.0,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","submitted":16777,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6614292954891029,"acs":2610,"articleLive":2,"columnArticles":59,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":0.0,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","questionId":"1409","status":"","submitted":3946,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8111233480176211,"acs":4419,"articleLive":2,"columnArticles":61,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","questionId":"1420","status":"lock","submitted":5448,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.645771413131586,"acs":4780,"articleLive":2,"columnArticles":94,"formTitle":"[1286]字母组合迭代器","frequency":0.0,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","submitted":7402,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6032035370772573,"acs":15553,"articleLive":2,"columnArticles":217,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":0.0,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","questionId":"1221","status":"","submitted":25784,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.5630131362889984,"acs":13715,"articleLive":2,"columnArticles":170,"formTitle":"[1288]删除被覆盖区间","frequency":0.0,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","submitted":24360,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.6267512305944718,"acs":6621,"articleLive":2,"columnArticles":99,"formTitle":"[1289]下降路径最小和  II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","submitted":10564,"title":"下降路径最小和  II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8085214683513983,"acs":54006,"articleLive":2,"columnArticles":703,"formTitle":"[1290]二进制链表转整数","frequency":0.0,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","questionId":"1411","status":"ac","submitted":66796,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5189193168433451,"acs":7049,"articleLive":2,"columnArticles":157,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","submitted":13584,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.470401117231748,"acs":6063,"articleLive":2,"columnArticles":96,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":0.0,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","questionId":"1413","status":"","submitted":12889,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.3603152825975843,"acs":13394,"articleLive":2,"columnArticles":128,"formTitle":"[1293]网格中的最短路径","frequency":0.0,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","questionId":"1414","status":"","submitted":37173,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6555265123226288,"acs":7022,"articleLive":2,"columnArticles":73,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"lock","submitted":10712,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.8080967314561707,"acs":48186,"articleLive":2,"columnArticles":639,"formTitle":"[1295]统计位数为偶数的数字","frequency":0.0,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","submitted":59629,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.4544388413275478,"acs":7750,"articleLive":2,"columnArticles":124,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.0,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","questionId":"1422","status":"","submitted":17054,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.4588077222261509,"acs":6488,"articleLive":2,"columnArticles":93,"formTitle":"[1297]子串的最大出现次数","frequency":0.0,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","submitted":14141,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5967631638933212,"acs":2618,"articleLive":2,"columnArticles":89,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","submitted":4387,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7865837932635271,"acs":30499,"articleLive":2,"columnArticles":434,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","questionId":"1231","status":"","submitted":38774,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.4663002603413364,"acs":24180,"articleLive":2,"columnArticles":365,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":0.0,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","submitted":51855,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.36178045515394913,"acs":3243,"articleLive":2,"columnArticles":79,"formTitle":"[1301]最大得分的路径数目","frequency":0.0,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","submitted":8964,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8193545728063306,"acs":19880,"articleLive":2,"columnArticles":295,"formTitle":"[1302]层数最深叶子节点的和","frequency":0.0,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","submitted":24263,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8218937644341802,"acs":8897,"articleLive":2,"columnArticles":84,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"lock","submitted":10825,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7237953135067313,"acs":21344,"articleLive":2,"columnArticles":384,"formTitle":"[1304]和为零的N个唯一整数","frequency":0.0,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","questionId":"1426","status":"","submitted":29489,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7473543001937696,"acs":15042,"articleLive":2,"columnArticles":227,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":0.0,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","submitted":20127,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5755447624048307,"acs":17538,"articleLive":2,"columnArticles":273,"formTitle":"[1306]跳跃游戏 III","frequency":0.0,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","submitted":30472,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.33093525179856115,"acs":1840,"articleLive":2,"columnArticles":54,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","submitted":5560,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7510536667603259,"acs":5346,"articleLive":2,"columnArticles":61,"formTitle":"[1308]不同性别每日分数总计","frequency":0.0,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"lock","submitted":7118,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7559083692447267,"acs":16664,"articleLive":2,"columnArticles":289,"formTitle":"[1309]解码字母到整数映射","frequency":0.0,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","submitted":22045,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.7129403624762161,"acs":37095,"articleLive":2,"columnArticles":498,"formTitle":"[1310]子数组异或查询","frequency":0.0,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"ac","submitted":52031,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.37817241613934816,"acs":5558,"articleLive":2,"columnArticles":87,"formTitle":"[1311]获取你好友已观看的视频","frequency":0.0,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","submitted":14697,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6665627921470864,"acs":10695,"articleLive":2,"columnArticles":153,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":0.0,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","questionId":"1437","status":"","submitted":16045,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.83202485709542,"acs":35079,"articleLive":2,"columnArticles":544,"formTitle":"[1313]解压缩编码列表","frequency":0.0,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","submitted":42161,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7402694610778443,"acs":11868,"articleLive":2,"columnArticles":194,"formTitle":"[1314]矩阵区域和","frequency":0.0,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","submitted":16032,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.809748427672956,"acs":12875,"articleLive":2,"columnArticles":264,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","submitted":15900,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.44025851197982346,"acs":2793,"articleLive":2,"columnArticles":60,"formTitle":"[1316]不同的循环子字符串","frequency":0.0,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","submitted":6344,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6148721642059777,"acs":10245,"articleLive":2,"columnArticles":194,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","questionId":"1440","status":"ac","submitted":16662,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6547656007451103,"acs":6327,"articleLive":2,"columnArticles":114,"formTitle":"[1318]或运算的最小翻转次数","frequency":0.0,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","questionId":"1441","status":"","submitted":9663,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6167121160851131,"acs":30983,"articleLive":2,"columnArticles":513,"formTitle":"[1319]连通网络的操作次数","frequency":0.0,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","submitted":50239,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5891968727789624,"acs":2487,"articleLive":2,"columnArticles":57,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","questionId":"1443","status":"","submitted":4221,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.6128585284744353,"acs":4423,"articleLive":2,"columnArticles":78,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.0,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"lock","submitted":7217,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5929134732866822,"acs":5338,"articleLive":2,"columnArticles":64,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"lock","submitted":9003,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.7552676230140367,"acs":24482,"articleLive":2,"columnArticles":479,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":0.0,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","submitted":32415,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5894151524178334,"acs":5936,"articleLive":2,"columnArticles":115,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","submitted":10071,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.7275884062079229,"acs":10267,"articleLive":2,"columnArticles":182,"formTitle":"[1325]删除给定值的叶子节点","frequency":0.0,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","submitted":14111,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.47258870769482914,"acs":5767,"articleLive":2,"columnArticles":92,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":0.0,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","questionId":"1451","status":"","submitted":12203,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6881626543594861,"acs":5517,"articleLive":2,"columnArticles":53,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","questionId":"1462","status":"lock","submitted":8017,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.4628092763515086,"acs":5967,"articleLive":2,"columnArticles":122,"formTitle":"[1328]破坏回文串","frequency":0.0,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","submitted":12893,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7716076533978448,"acs":7017,"articleLive":2,"columnArticles":158,"formTitle":"[1329]将矩阵按对角线排序","frequency":0.0,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","submitted":9094,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.3783958602846054,"acs":1170,"articleLive":2,"columnArticles":29,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":0.0,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","submitted":3092,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5357867676904343,"acs":11880,"articleLive":2,"columnArticles":203,"formTitle":"[1331]数组序号转换","frequency":0.0,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","submitted":22173,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6874502712477396,"acs":9504,"articleLive":2,"columnArticles":135,"formTitle":"[1332]删除回文子序列","frequency":0.0,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"ac","submitted":13825,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5440949440370514,"acs":5639,"articleLive":2,"columnArticles":117,"formTitle":"[1333]餐厅过滤器","frequency":0.0,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","questionId":"1455","status":"","submitted":10364,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.490368834758573,"acs":5677,"articleLive":2,"columnArticles":93,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":0.0,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","questionId":"1456","status":"","submitted":11577,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5855,"acs":3513,"articleLive":2,"columnArticles":58,"formTitle":"[1335]工作计划的最低难度","frequency":0.0,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","submitted":6000,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.4215594175669328,"acs":1795,"articleLive":2,"columnArticles":49,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"lock","submitted":4258,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.7055387786839298,"acs":39017,"articleLive":2,"columnArticles":625,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":0.0,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"ac","submitted":55301,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6401971136923619,"acs":9094,"articleLive":2,"columnArticles":130,"formTitle":"[1338]数组大小减半","frequency":0.0,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"ac","submitted":14205,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.39878851473814747,"acs":8361,"articleLive":2,"columnArticles":131,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":0.0,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","submitted":20966,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5738197986138355,"acs":4388,"articleLive":2,"columnArticles":95,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","submitted":7647,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.480360411093904,"acs":3412,"articleLive":2,"columnArticles":49,"formTitle":"[1341]电影评分","frequency":0.0,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"lock","submitted":7103,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.8204783083645443,"acs":42061,"articleLive":2,"columnArticles":641,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.0,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","questionId":"1444","status":"","submitted":51264,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.5449366550463396,"acs":12818,"articleLive":2,"columnArticles":214,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","questionId":"1445","status":"","submitted":23522,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.5929890023566379,"acs":6039,"articleLive":2,"columnArticles":121,"formTitle":"[1344]时钟指针的夹角","frequency":0.0,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","submitted":10184,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.36646977504084455,"acs":5832,"articleLive":2,"columnArticles":109,"formTitle":"[1345]跳跃游戏 IV","frequency":0.0,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","submitted":15914,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.43528051533337003,"acs":15812,"articleLive":2,"columnArticles":268,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","submitted":36326,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7403773584905661,"acs":7848,"articleLive":2,"columnArticles":117,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","questionId":"1469","status":"ac","submitted":10600,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.30644105824062823,"acs":3278,"articleLive":2,"columnArticles":51,"formTitle":"[1348]推文计数","frequency":0.0,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","submitted":10697,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5066773934030572,"acs":3149,"articleLive":2,"columnArticles":95,"formTitle":"[1349]参加考试的最大学生数","frequency":0.0,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","submitted":6215,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.848219674109837,"acs":8433,"articleLive":2,"columnArticles":86,"formTitle":"[1350]院系无效的学生","frequency":0.0,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"lock","submitted":9942,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7546549281521959,"acs":29830,"articleLive":2,"columnArticles":546,"formTitle":"[1351]统计有序矩阵中的负数","frequency":0.0,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","submitted":39528,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.4449254128929142,"acs":6681,"articleLive":2,"columnArticles":73,"formTitle":"[1352]最后 K 个数的乘积","frequency":0.0,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","submitted":15016,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.28521430507973283,"acs":11572,"articleLive":2,"columnArticles":156,"formTitle":"[1353]最多可以参加的会议数目","frequency":0.0,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","questionId":"1478","status":"","submitted":40573,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.2813165537270087,"acs":2906,"articleLive":2,"columnArticles":72,"formTitle":"[1354]多次求和构造目标数组","frequency":0.0,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","submitted":10330,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6610314207650273,"acs":3871,"articleLive":2,"columnArticles":59,"formTitle":"[1355]活动参与者","frequency":0.0,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"lock","submitted":5856,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.7316715542521994,"acs":45908,"articleLive":2,"columnArticles":508,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":0.0,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","questionId":"1458","status":"","submitted":62744,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.530872221500065,"acs":4084,"articleLive":2,"columnArticles":42,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.0,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","submitted":7693,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.49549864522331966,"acs":5669,"articleLive":2,"columnArticles":112,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":0.0,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","submitted":11441,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5497869043006587,"acs":2838,"articleLive":2,"columnArticles":65,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","submitted":5162,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.505469301340861,"acs":8595,"articleLive":2,"columnArticles":141,"formTitle":"[1360]日期之间隔几天","frequency":0.0,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","submitted":17004,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.40196236126749235,"acs":7497,"articleLive":2,"columnArticles":202,"formTitle":"[1361]验证二叉树","frequency":0.0,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","submitted":18651,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5246852871754524,"acs":5335,"articleLive":2,"columnArticles":68,"formTitle":"[1362]最接近的因数","frequency":0.0,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","submitted":10168,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.36455193707270456,"acs":4959,"articleLive":2,"columnArticles":97,"formTitle":"[1363]形成三的最大倍数","frequency":0.0,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","submitted":13603,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6743256743256744,"acs":3375,"articleLive":2,"columnArticles":65,"formTitle":"[1364]顾客的可信联系人数量","frequency":0.0,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","questionId":"1495","status":"lock","submitted":5005,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8250493363773556,"acs":85287,"articleLive":2,"columnArticles":1090,"formTitle":"[1365]有多少小于当前数字的数字","frequency":0.0,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","questionId":"1482","status":"","submitted":103372,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.53828709653035,"acs":7121,"articleLive":2,"columnArticles":140,"formTitle":"[1366]通过投票对团队排名","frequency":0.0,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","submitted":13229,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.41791902767512523,"acs":15267,"articleLive":2,"columnArticles":223,"formTitle":"[1367]二叉树中的列表","frequency":0.0,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"ac","submitted":36531,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5253348864298194,"acs":3608,"articleLive":2,"columnArticles":88,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.0,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","questionId":"1485","status":"","submitted":6868,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.6060673162090345,"acs":2737,"articleLive":2,"columnArticles":42,"formTitle":"[1369]获取最近第二次的活动","frequency":0.0,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"lock","submitted":4516,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7901155538047403,"acs":48137,"articleLive":2,"columnArticles":580,"formTitle":"[1370]上升下降字符串","frequency":0.0,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","submitted":60924,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5800654485955822,"acs":21271,"articleLive":2,"columnArticles":267,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":0.0,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","questionId":"1473","status":"","submitted":36670,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5132737834967831,"acs":8217,"articleLive":2,"columnArticles":162,"formTitle":"[1372]二叉树中的最长交错路径","frequency":0.0,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","submitted":16009,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.4046743129192815,"acs":7480,"articleLive":2,"columnArticles":168,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":0.0,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","submitted":18484,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.739679498345236,"acs":16986,"articleLive":2,"columnArticles":227,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","questionId":"1490","status":"","submitted":22964,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.5747635738377092,"acs":8691,"articleLive":2,"columnArticles":172,"formTitle":"[1375]灯泡开关 III","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","submitted":15121,"title":"灯泡开关 III","titleSlug":"bulb-switcher-iii"},{"acceptance":0.5032697184038436,"acs":7542,"articleLive":2,"columnArticles":154,"formTitle":"[1376]通知所有员工所需的时间","frequency":0.0,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","submitted":14986,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.3244726064446333,"acs":4199,"articleLive":2,"columnArticles":130,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.0,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","submitted":12941,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.8615842763549731,"acs":7233,"articleLive":2,"columnArticles":61,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","questionId":"1509","status":"lock","submitted":8395,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8373251888763864,"acs":10418,"articleLive":2,"columnArticles":163,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","questionId":"1498","status":"","submitted":12442,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.7281790083148317,"acs":16727,"articleLive":2,"columnArticles":252,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","submitted":22971,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.731696813092162,"acs":11893,"articleLive":2,"columnArticles":157,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.0,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"ac","submitted":16254,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.6927963488343407,"acs":11233,"articleLive":2,"columnArticles":175,"formTitle":"[1382]将二叉搜索树变平衡","frequency":0.0,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","submitted":16214,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.323185341789993,"acs":4586,"articleLive":2,"columnArticles":87,"formTitle":"[1383]最大的团队表现值","frequency":0.0,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","submitted":14190,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5436813186813186,"acs":1979,"articleLive":2,"columnArticles":45,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"lock","submitted":3640,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.7007441621760329,"acs":13654,"articleLive":2,"columnArticles":204,"formTitle":"[1385]两个数组间的距离值","frequency":0.0,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","submitted":19485,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.3125556985840182,"acs":6313,"articleLive":2,"columnArticles":131,"formTitle":"[1386]安排电影院座位","frequency":0.0,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","submitted":20198,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6955508474576271,"acs":9849,"articleLive":2,"columnArticles":171,"formTitle":"[1387]将整数按权重排序","frequency":0.0,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","submitted":14160,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5424382716049383,"acs":4218,"articleLive":2,"columnArticles":53,"formTitle":"[1388]3n 块披萨","frequency":0.0,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","submitted":7776,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8313626043110312,"acs":28194,"articleLive":2,"columnArticles":482,"formTitle":"[1389]按既定顺序创建目标数组","frequency":0.0,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","submitted":33913,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.35409361607391326,"acs":6362,"articleLive":2,"columnArticles":116,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","submitted":17967,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.39972478162019864,"acs":6681,"articleLive":2,"columnArticles":203,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":0.0,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","questionId":"1507","status":"","submitted":16714,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.40481915383434797,"acs":7913,"articleLive":2,"columnArticles":145,"formTitle":"[1392]最长快乐前缀","frequency":0.0,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","submitted":19547,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8560066973629133,"acs":4090,"articleLive":2,"columnArticles":61,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"lock","submitted":4778,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.6653759776968946,"acs":17184,"articleLive":2,"columnArticles":277,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","submitted":25826,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7482821924993444,"acs":14266,"articleLive":2,"columnArticles":212,"formTitle":"[1395]统计作战单位数","frequency":0.0,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","submitted":19065,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.41291344820756587,"acs":10424,"articleLive":2,"columnArticles":145,"formTitle":"[1396]设计地铁系统","frequency":0.0,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","submitted":25245,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.3743159430864648,"acs":1026,"articleLive":2,"columnArticles":37,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","submitted":2741,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7618716298486693,"acs":4380,"articleLive":2,"columnArticles":66,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","questionId":"1536","status":"lock","submitted":5749,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6714478449194063,"acs":9456,"articleLive":2,"columnArticles":153,"formTitle":"[1399]统计最大组的数目","frequency":0.0,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","submitted":14083,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.605909764880322,"acs":5721,"articleLive":2,"columnArticles":98,"formTitle":"[1400]构造 K 个回文字符串","frequency":0.0,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"ac","submitted":9442,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.41716227697536107,"acs":3928,"articleLive":2,"columnArticles":89,"formTitle":"[1401]圆和矩形是否有重叠","frequency":0.0,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","submitted":9416,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7532315838654415,"acs":9673,"articleLive":2,"columnArticles":178,"formTitle":"[1402]做菜顺序","frequency":0.0,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","submitted":12842,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6912409700722394,"acs":21434,"articleLive":2,"columnArticles":363,"formTitle":"[1403]非递增顺序的最小子序列","frequency":0.0,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","submitted":31008,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.4927388013908775,"acs":7227,"articleLive":2,"columnArticles":154,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":0.0,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","questionId":"1520","status":"","submitted":14667,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5078033378439333,"acs":5629,"articleLive":2,"columnArticles":140,"formTitle":"[1405]最长快乐字符串","frequency":0.0,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","submitted":11085,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.5685291029977837,"acs":4874,"articleLive":2,"columnArticles":81,"formTitle":"[1406]石子游戏 III","frequency":0.0,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","submitted":8573,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6668559745570195,"acs":5871,"articleLive":2,"columnArticles":67,"formTitle":"[1407]排名靠前的旅行者","frequency":0.0,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"lock","submitted":8804,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.6146142942064109,"acs":13441,"articleLive":2,"columnArticles":204,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","submitted":21869,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.8068588469184891,"acs":8117,"articleLive":2,"columnArticles":129,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","submitted":10060,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.4751736885716107,"acs":7455,"articleLive":2,"columnArticles":119,"formTitle":"[1410]HTML 实体解析器","frequency":0.0,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"ac","submitted":15689,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5506047103755569,"acs":7785,"articleLive":2,"columnArticles":141,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":0.0,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","questionId":"1527","status":"","submitted":14139,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5525653436592449,"acs":2854,"articleLive":2,"columnArticles":67,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","questionId":"1546","status":"lock","submitted":5165,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.6937662502378084,"acs":10940,"articleLive":2,"columnArticles":224,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":0.0,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","questionId":"1514","status":"","submitted":15769,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.603986981285598,"acs":7423,"articleLive":2,"columnArticles":149,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":0.0,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","questionId":"1515","status":"","submitted":12290,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.6845207320856168,"acs":6620,"articleLive":2,"columnArticles":181,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":0.0,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","questionId":"1516","status":"","submitted":9671,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.4085710149124077,"acs":2822,"articleLive":2,"columnArticles":51,"formTitle":"[1416]恢复数组","frequency":0.0,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","submitted":6907,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.5192461908580593,"acs":12950,"articleLive":2,"columnArticles":183,"formTitle":"[1417]重新格式化字符串","frequency":0.0,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","submitted":24940,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7327079566003617,"acs":25932,"articleLive":2,"columnArticles":416,"formTitle":"[1418]点菜展示表","frequency":0.0,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","questionId":"1533","status":"ac","submitted":35392,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.4189217758985201,"acs":7926,"articleLive":2,"columnArticles":154,"formTitle":"[1419]数青蛙","frequency":0.0,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","submitted":18920,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.5992179863147605,"acs":2452,"articleLive":2,"columnArticles":43,"formTitle":"[1420]生成数组","frequency":0.0,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","questionId":"1535","status":"","submitted":4092,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.7487857528332433,"acs":2775,"articleLive":2,"columnArticles":35,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","questionId":"1551","status":"lock","submitted":3706,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.5405709033345248,"acs":10586,"articleLive":2,"columnArticles":195,"formTitle":"[1422]分割字符串的最大得分","frequency":0.0,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","submitted":19583,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5541685102079514,"acs":35070,"articleLive":2,"columnArticles":511,"formTitle":"[1423]可获得的最大点数","frequency":0.0,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"ac","submitted":63284,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.39812411514865503,"acs":6749,"articleLive":2,"columnArticles":147,"formTitle":"[1424]对角线遍历 II","frequency":0.0,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","submitted":16952,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.4398198689956332,"acs":3223,"articleLive":2,"columnArticles":69,"formTitle":"[1425]带限制的子序列和","frequency":0.0,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","submitted":7328,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.7093525179856115,"acs":1479,"articleLive":2,"columnArticles":48,"formTitle":"[1426]数元素","frequency":0.0,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"lock","submitted":2085,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6563953488372093,"acs":1129,"articleLive":2,"columnArticles":45,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"lock","submitted":1720,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5963611859838275,"acs":885,"articleLive":2,"columnArticles":20,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","questionId":"1374","status":"lock","submitted":1484,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.5051063829787235,"acs":1187,"articleLive":2,"columnArticles":38,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"lock","submitted":2350,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.5833333333333334,"acs":707,"articleLive":2,"columnArticles":27,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","questionId":"1432","status":"lock","submitted":1212,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.8462656204591689,"acs":78624,"articleLive":2,"columnArticles":1033,"formTitle":"[1431]拥有最多糖果的孩子","frequency":0.0,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","submitted":92907,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.39408438451500655,"acs":4530,"articleLive":2,"columnArticles":99,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","questionId":"1529","status":"","submitted":11495,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6411127627946486,"acs":6038,"articleLive":2,"columnArticles":102,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","questionId":"1530","status":"","submitted":9418,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.4662174467310144,"acs":2560,"articleLive":2,"columnArticles":46,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","questionId":"1531","status":"","submitted":5491,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6187565230356344,"acs":4150,"articleLive":2,"columnArticles":46,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"lock","submitted":6707,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.8216008441362677,"acs":43604,"articleLive":2,"columnArticles":644,"formTitle":"[1436]旅行终点站","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"ac","submitted":53072,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5864435146443515,"acs":10512,"articleLive":2,"columnArticles":177,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":0.0,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","questionId":"1548","status":"","submitted":17925,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.4831615120274914,"acs":33041,"articleLive":2,"columnArticles":466,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":0.0,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","questionId":"1549","status":"","submitted":68385,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.5627633955448526,"acs":3739,"articleLive":2,"columnArticles":57,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":0.0,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","questionId":"1550","status":"","submitted":6644,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.6994249869315212,"acs":2676,"articleLive":2,"columnArticles":36,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"lock","submitted":3826,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.6478878303073881,"acs":18021,"articleLive":2,"columnArticles":377,"formTitle":"[1441]用栈操作构建数组","frequency":0.0,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"ac","submitted":27815,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7915507094301747,"acs":34700,"articleLive":2,"columnArticles":373,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":0.0,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","questionId":"1553","status":"ac","submitted":43838,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.41069479810840304,"acs":5645,"articleLive":2,"columnArticles":140,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","questionId":"1554","status":"","submitted":13745,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5267678785457451,"acs":2637,"articleLive":2,"columnArticles":60,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","submitted":5006,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8573267539154688,"acs":3996,"articleLive":2,"columnArticles":53,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"lock","submitted":4661,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.5729012594684236,"acs":12782,"articleLive":2,"columnArticles":218,"formTitle":"[1446]连续字符","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","submitted":22311,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.6177114843016585,"acs":5922,"articleLive":2,"columnArticles":74,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","submitted":9587,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.711304347826087,"acs":9816,"articleLive":2,"columnArticles":159,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":0.0,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","submitted":13800,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6275583961043901,"acs":16496,"articleLive":2,"columnArticles":208,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":0.0,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","questionId":"1545","status":"ac","submitted":26286,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.8026867061248919,"acs":24140,"articleLive":2,"columnArticles":343,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":0.0,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","questionId":"1560","status":"","submitted":30074,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.5233518624344122,"acs":10074,"articleLive":2,"columnArticles":153,"formTitle":"[1451]重新排列句子中的单词","frequency":0.0,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","submitted":19249,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.4989963198394112,"acs":5966,"articleLive":2,"columnArticles":90,"formTitle":"[1452]收藏清单","frequency":0.0,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","questionId":"1562","status":"","submitted":11956,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.3647111309391033,"acs":1635,"articleLive":2,"columnArticles":31,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":0.0,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","questionId":"1563","status":"","submitted":4483,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.3964865290688514,"acs":5033,"articleLive":2,"columnArticles":81,"formTitle":"[1454]活跃用户","frequency":0.0,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"lock","submitted":12694,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6330825485347503,"acs":12033,"articleLive":2,"columnArticles":206,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","questionId":"1566","status":"","submitted":19007,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.5230531400966184,"acs":13534,"articleLive":2,"columnArticles":211,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.0,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","questionId":"1567","status":"","submitted":25875,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.6322841512724966,"acs":7975,"articleLive":2,"columnArticles":140,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","submitted":12613,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.4423046690771891,"acs":5627,"articleLive":2,"columnArticles":90,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","submitted":12722,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.5967153284671532,"acs":2289,"articleLive":2,"columnArticles":48,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"lock","submitted":3836,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7447828402653368,"acs":15382,"articleLive":2,"columnArticles":312,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","questionId":"1556","status":"ac","submitted":20653,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.501482673896467,"acs":5919,"articleLive":2,"columnArticles":84,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","questionId":"1557","status":"","submitted":11803,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.42718843741478046,"acs":6266,"articleLive":2,"columnArticles":125,"formTitle":"[1462]课程表 IV","frequency":0.0,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","submitted":14668,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.591747146619842,"acs":2696,"articleLive":2,"columnArticles":65,"formTitle":"[1463]摘樱桃 II","frequency":0.0,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","submitted":4556,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7676439278418736,"acs":26681,"articleLive":2,"columnArticles":372,"formTitle":"[1464]数组中两元素的最大乘积","frequency":0.0,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","questionId":"1574","status":"","submitted":34757,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.3098223362540543,"acs":6400,"articleLive":2,"columnArticles":81,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.0,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","questionId":"1575","status":"","submitted":20657,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.48321741759903236,"acs":6392,"articleLive":2,"columnArticles":124,"formTitle":"[1466]重新规划路线","frequency":0.0,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","questionId":"1576","status":"","submitted":13228,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6179649645918748,"acs":1658,"articleLive":2,"columnArticles":49,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","questionId":"1577","status":"","submitted":2683,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.7009873060648801,"acs":2982,"articleLive":2,"columnArticles":51,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"lock","submitted":4254,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.7955523672883787,"acs":2218,"articleLive":2,"columnArticles":83,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"lock","submitted":2788,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8428252811459446,"acs":53661,"articleLive":2,"columnArticles":729,"formTitle":"[1470]重新排列数组","frequency":0.0,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","submitted":63668,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.5447399353511607,"acs":7415,"articleLive":2,"columnArticles":106,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.0,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","submitted":13612,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6182079612532163,"acs":8169,"articleLive":2,"columnArticles":131,"formTitle":"[1472]设计浏览器历史记录","frequency":0.0,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","submitted":13214,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.6743519604011984,"acs":15531,"articleLive":2,"columnArticles":166,"formTitle":"[1473]粉刷房子 III","frequency":0.0,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","submitted":23031,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7182320441988951,"acs":1950,"articleLive":2,"columnArticles":62,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","questionId":"1618","status":"lock","submitted":2715,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7215480172001911,"acs":15102,"articleLive":2,"columnArticles":233,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","questionId":"1570","status":"","submitted":20930,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8652506488184675,"acs":12669,"articleLive":2,"columnArticles":118,"formTitle":"[1476]子矩形查询","frequency":0.0,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","submitted":14642,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.29141176470588237,"acs":4954,"articleLive":2,"columnArticles":97,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":0.0,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","questionId":"1573","status":"","submitted":17000,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5808695652173913,"acs":2672,"articleLive":2,"columnArticles":57,"formTitle":"[1478]安排邮筒","frequency":0.0,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","submitted":4600,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5654057175859082,"acs":1958,"articleLive":2,"columnArticles":39,"formTitle":"[1479]周内每天的销售情况","frequency":0.0,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"lock","submitted":3463,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8692518457530808,"acs":128804,"articleLive":2,"columnArticles":1290,"formTitle":"[1480]一维数组的动态和","frequency":0.0,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"ac","submitted":148178,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5143579373104146,"acs":10174,"articleLive":2,"columnArticles":147,"formTitle":"[1481]不同整数的最少数目","frequency":0.0,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","questionId":"1604","status":"","submitted":19780,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5865786206118072,"acs":31179,"articleLive":2,"columnArticles":405,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":0.0,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","questionId":"1605","status":"ac","submitted":53154,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.30042803638309257,"acs":3369,"articleLive":2,"columnArticles":70,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","submitted":11214,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8089430894308943,"acs":796,"articleLive":2,"columnArticles":25,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"lock","submitted":984,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.6594416507716317,"acs":3803,"articleLive":2,"columnArticles":44,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"lock","submitted":5767,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.8582466137093464,"acs":71092,"articleLive":2,"columnArticles":685,"formTitle":"[1486]数组异或操作","frequency":0.0,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"ac","submitted":82834,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.3109172763083849,"acs":7735,"articleLive":2,"columnArticles":106,"formTitle":"[1487]保证文件名唯一","frequency":0.0,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","submitted":24878,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.23688641367698485,"acs":7316,"articleLive":2,"columnArticles":113,"formTitle":"[1488]避免洪水泛滥","frequency":0.0,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","submitted":30884,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6910102278844429,"acs":11553,"articleLive":2,"columnArticles":125,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.0,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","questionId":"1613","status":"","submitted":16719,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8549075391180654,"acs":1202,"articleLive":2,"columnArticles":29,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"lock","submitted":1406,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.6715645069096533,"acs":19973,"articleLive":2,"columnArticles":297,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","questionId":"1584","status":"","submitted":29741,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.6620393000293284,"acs":6772,"articleLive":2,"columnArticles":80,"formTitle":"[1492]n 的第 k 个因子","frequency":0.0,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","submitted":10229,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.5676442762535477,"acs":7800,"articleLive":2,"columnArticles":148,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":0.0,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","questionId":"1586","status":"","submitted":13741,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.3714987714987715,"acs":2268,"articleLive":2,"columnArticles":36,"formTitle":"[1494]并行课程 II","frequency":0.0,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","submitted":6105,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.542086624897848,"acs":3980,"articleLive":2,"columnArticles":38,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"lock","submitted":7342,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5367697259338731,"acs":11007,"articleLive":2,"columnArticles":166,"formTitle":"[1496]判断路径是否相交","frequency":0.0,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","submitted":20506,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.39119496855345914,"acs":8397,"articleLive":2,"columnArticles":114,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":0.0,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","questionId":"1620","status":"","submitted":21465,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.33431197344906816,"acs":5238,"articleLive":2,"columnArticles":67,"formTitle":"[1498]满足条件的子序列数目","frequency":0.0,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","questionId":"1621","status":"","submitted":15668,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.3743801652892562,"acs":2718,"articleLive":2,"columnArticles":59,"formTitle":"[1499]满足不等式的最大值","frequency":0.0,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","submitted":7260,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.30162412993039445,"acs":780,"articleLive":2,"columnArticles":27,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"lock","submitted":2586,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.590245995423341,"acs":4127,"articleLive":2,"columnArticles":61,"formTitle":"[1501]可以放心投资的国家","frequency":0.0,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"lock","submitted":6992,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7166038584847292,"acs":25481,"articleLive":2,"columnArticles":304,"formTitle":"[1502]判断能否形成等差数列","frequency":0.0,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","submitted":35558,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5132886388124027,"acs":8575,"articleLive":2,"columnArticles":87,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":0.0,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","questionId":"1627","status":"","submitted":16706,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.5951165017555059,"acs":7458,"articleLive":2,"columnArticles":135,"formTitle":"[1504]统计全 1 子矩形","frequency":0.0,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","submitted":12532,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.3625782365213572,"acs":3302,"articleLive":2,"columnArticles":74,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":0.0,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","questionId":"1629","status":"","submitted":9107,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.84,"acs":588,"articleLive":2,"columnArticles":16,"formTitle":"[1506]找到 N 叉树的根节点","frequency":0.0,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"lock","submitted":700,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5898321517299885,"acs":9734,"articleLive":2,"columnArticles":130,"formTitle":"[1507]转变日期格式","frequency":0.0,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","submitted":16503,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.553027556200145,"acs":6101,"articleLive":2,"columnArticles":53,"formTitle":"[1508]子数组和排序后的区间和","frequency":0.0,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","submitted":11032,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5477016934890081,"acs":5207,"articleLive":2,"columnArticles":77,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.0,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","questionId":"1616","status":"","submitted":9507,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.5770101925254814,"acs":5095,"articleLive":2,"columnArticles":62,"formTitle":"[1510]石子游戏 IV","frequency":0.0,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","submitted":8830,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6778675282714055,"acs":4196,"articleLive":2,"columnArticles":60,"formTitle":"[1511]消费者下单频率","frequency":0.0,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"lock","submitted":6190,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.8488586846737656,"acs":58831,"articleLive":2,"columnArticles":749,"formTitle":"[1512]好数对的数目","frequency":0.0,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","submitted":69306,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.38012877594355776,"acs":11099,"articleLive":2,"columnArticles":150,"formTitle":"[1513]仅含 1 的子串数","frequency":0.0,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","submitted":29198,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.32486440194119326,"acs":7966,"articleLive":2,"columnArticles":140,"formTitle":"[1514]概率最大的路径","frequency":0.0,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","submitted":24521,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.34291938997821353,"acs":3148,"articleLive":2,"columnArticles":59,"formTitle":"[1515]服务中心的最佳位置","frequency":0.0,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","submitted":9180,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5849514563106796,"acs":241,"articleLive":2,"columnArticles":13,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","questionId":"1655","status":"lock","submitted":412,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.7329087048832271,"acs":3452,"articleLive":2,"columnArticles":36,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"lock","submitted":4710,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.674303756476684,"acs":24987,"articleLive":2,"columnArticles":400,"formTitle":"[1518]换酒问题","frequency":0.0,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","submitted":37056,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.29776915615906885,"acs":5526,"articleLive":2,"columnArticles":124,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.0,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","questionId":"1643","status":"","submitted":18558,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.33298027273930886,"acs":2515,"articleLive":2,"columnArticles":71,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","submitted":7553,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.39661625991914956,"acs":2649,"articleLive":2,"columnArticles":51,"formTitle":"[1521]找到最接近目标值的函数值","frequency":0.0,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","questionId":"1645","status":"","submitted":6679,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.7117202268431002,"acs":753,"articleLive":2,"columnArticles":28,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"lock","submitted":1058,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.577738211475504,"acs":10059,"articleLive":2,"columnArticles":173,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","submitted":17411,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.4294904350770273,"acs":5074,"articleLive":2,"columnArticles":101,"formTitle":"[1524]和为奇数的子数组数目","frequency":0.0,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","submitted":11814,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6615497076023392,"acs":5430,"articleLive":2,"columnArticles":110,"formTitle":"[1525]字符串的好分割数目","frequency":0.0,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","questionId":"1632","status":"","submitted":8208,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.6168641927336312,"acs":3175,"articleLive":2,"columnArticles":51,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","questionId":"1633","status":"","submitted":5147,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.5016685205784205,"acs":3608,"articleLive":2,"columnArticles":37,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"lock","submitted":7192,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.785209609043806,"acs":30006,"articleLive":2,"columnArticles":361,"formTitle":"[1528]重新排列字符串","frequency":0.0,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","submitted":38214,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.691020376539862,"acs":8919,"articleLive":2,"columnArticles":134,"formTitle":"[1529]灯泡开关 IV","frequency":0.0,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","submitted":12907,"title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.5676608491794738,"acs":8717,"articleLive":2,"columnArticles":147,"formTitle":"[1530]好叶子节点对的数量","frequency":0.0,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","submitted":15356,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.3295272078501338,"acs":1847,"articleLive":2,"columnArticles":34,"formTitle":"[1531]压缩字符串 II","frequency":0.0,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","submitted":5605,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6144742831133364,"acs":2700,"articleLive":2,"columnArticles":49,"formTitle":"[1532]最近的三笔订单","frequency":0.0,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"lock","submitted":4394,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6197478991596639,"acs":295,"articleLive":2,"columnArticles":18,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","questionId":"1672","status":"lock","submitted":476,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.7891720913175025,"acs":17215,"articleLive":2,"columnArticles":160,"formTitle":"[1534]统计好三元组","frequency":0.0,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","submitted":21814,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.45336344350920416,"acs":13250,"articleLive":2,"columnArticles":182,"formTitle":"[1535]找出数组游戏的赢家","frequency":0.0,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","submitted":29226,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.44030410108148627,"acs":4112,"articleLive":2,"columnArticles":79,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.0,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","submitted":9339,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.366986784864155,"acs":4471,"articleLive":2,"columnArticles":89,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","submitted":12183,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.6009389671361502,"acs":128,"articleLive":2,"columnArticles":7,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","questionId":"1681","status":"lock","submitted":213,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5393251093270675,"acs":16526,"articleLive":2,"columnArticles":248,"formTitle":"[1539]第 k 个缺失的正整数","frequency":0.0,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","submitted":30642,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.3174996737570142,"acs":4866,"articleLive":2,"columnArticles":86,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","submitted":15326,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.46162736939435967,"acs":5991,"articleLive":2,"columnArticles":92,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"ac","submitted":12978,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.385771235817234,"acs":2516,"articleLive":2,"columnArticles":47,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","submitted":6522,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5511649580615098,"acs":2957,"articleLive":2,"columnArticles":43,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"lock","submitted":5365,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.5467162329615861,"acs":19854,"articleLive":2,"columnArticles":320,"formTitle":"[1544]整理字符串","frequency":0.0,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"ac","submitted":36315,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.554120858850439,"acs":7510,"articleLive":2,"columnArticles":101,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":0.0,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","submitted":13553,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.41432573029211683,"acs":5177,"articleLive":2,"columnArticles":79,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","questionId":"1649","status":"","submitted":12495,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5369100975481149,"acs":4073,"articleLive":2,"columnArticles":71,"formTitle":"[1547]切棍子的最小成本","frequency":0.0,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","submitted":7586,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7131474103585658,"acs":358,"articleLive":2,"columnArticles":14,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","questionId":"1687","status":"lock","submitted":502,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.6636217087587318,"acs":2470,"articleLive":2,"columnArticles":48,"formTitle":"[1549]每件商品的最新订单","frequency":0.0,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","questionId":"1688","status":"lock","submitted":3722,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6593073593073593,"acs":21322,"articleLive":2,"columnArticles":290,"formTitle":"[1550]存在连续三个奇数的数组","frequency":0.0,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","submitted":32340,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8166145340801629,"acs":11226,"articleLive":2,"columnArticles":153,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":0.0,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","submitted":13747,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.5103087038894462,"acs":9158,"articleLive":2,"columnArticles":124,"formTitle":"[1552]两球之间的磁力","frequency":0.0,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","submitted":17946,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.2957354287458041,"acs":7753,"articleLive":2,"columnArticles":122,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":0.0,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","questionId":"1676","status":"","submitted":26216,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.7068062827225131,"acs":540,"articleLive":2,"columnArticles":18,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"lock","submitted":764,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.437607820586544,"acs":3044,"articleLive":2,"columnArticles":58,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"lock","submitted":6956,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.5788219091005403,"acs":10927,"articleLive":2,"columnArticles":167,"formTitle":"[1556]千位分隔数","frequency":0.0,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","submitted":18878,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7689625108979947,"acs":7938,"articleLive":2,"columnArticles":108,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":0.0,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","questionId":"1661","status":"","submitted":10323,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6220002774309891,"acs":4484,"articleLive":2,"columnArticles":69,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":0.0,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","questionId":"1662","status":"","submitted":7209,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.36699353223450865,"acs":3518,"articleLive":2,"columnArticles":64,"formTitle":"[1559]二维网格图中探测环","frequency":0.0,"frontendQuestionId":"1559","leaf":true,"level":2,"nodeType":"def","questionId":"1663","status":"","submitted":9586,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5723050534371289,"acs":8675,"articleLive":2,"columnArticles":91,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":0.0,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","submitted":15158,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7792008538456408,"acs":11681,"articleLive":2,"columnArticles":168,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":0.0,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","submitted":14991,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.3094147582697201,"acs":4256,"articleLive":2,"columnArticles":87,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":0.0,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","submitted":13755,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.37902151151722824,"acs":3982,"articleLive":2,"columnArticles":66,"formTitle":"[1563]石子游戏 V","frequency":0.0,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","submitted":10506,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5456790123456791,"acs":663,"articleLive":2,"columnArticles":24,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"lock","submitted":1215,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.7233009708737864,"acs":3278,"articleLive":2,"columnArticles":41,"formTitle":"[1565]按月统计订单数与顾客数","frequency":0.0,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"lock","submitted":4532,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.44584411202339447,"acs":7928,"articleLive":2,"columnArticles":120,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":0.0,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","questionId":"1689","status":"","submitted":17782,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.3999693298573838,"acs":13041,"articleLive":2,"columnArticles":208,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":0.0,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","submitted":32605,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.455620257631904,"acs":2582,"articleLive":2,"columnArticles":47,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","submitted":5667,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.4748680284599495,"acs":2069,"articleLive":2,"columnArticles":45,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","questionId":"1692","status":"","submitted":4357,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.8939554612937434,"acs":1686,"articleLive":2,"columnArticles":37,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.0,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"lock","submitted":1886,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.7576226248342908,"acs":3429,"articleLive":2,"columnArticles":43,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"lock","submitted":4526,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.8049724454166842,"acs":19135,"articleLive":2,"columnArticles":322,"formTitle":"[1572]矩阵对角线元素的和","frequency":0.0,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","submitted":23771,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.2950808847804556,"acs":4469,"articleLive":2,"columnArticles":65,"formTitle":"[1573]分割字符串的方案数","frequency":0.0,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","submitted":15145,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.32660713068375485,"acs":4791,"articleLive":2,"columnArticles":84,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":0.0,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","questionId":"1679","status":"","submitted":14669,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.5970274817722939,"acs":4258,"articleLive":2,"columnArticles":68,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","submitted":7132,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.4765571254696513,"acs":18011,"articleLive":2,"columnArticles":255,"formTitle":"[1576]替换所有的问号","frequency":0.0,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","questionId":"1698","status":"","submitted":37794,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.3254869614872153,"acs":5130,"articleLive":2,"columnArticles":79,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":0.0,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","questionId":"1699","status":"","submitted":15761,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5823636169531333,"acs":10910,"articleLive":2,"columnArticles":204,"formTitle":"[1578]避免重复字母的最小删除成本","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","submitted":18734,"title":"避免重复字母的最小删除成本","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"acceptance":0.6191262919276136,"acs":16114,"articleLive":2,"columnArticles":294,"formTitle":"[1579]保证图可完全遍历","frequency":0.0,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","questionId":"1701","status":"","submitted":26027,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.6357466063348416,"acs":281,"articleLive":2,"columnArticles":18,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"lock","submitted":442,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8046767537826685,"acs":3510,"articleLive":2,"columnArticles":48,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","questionId":"1724","status":"lock","submitted":4362,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6708629298825515,"acs":9539,"articleLive":2,"columnArticles":109,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":0.0,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","submitted":14219,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6853536835926035,"acs":18680,"articleLive":2,"columnArticles":243,"formTitle":"[1583]统计不开心的朋友","frequency":0.0,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","submitted":27256,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6638653328593916,"acs":26147,"articleLive":2,"columnArticles":328,"formTitle":"[1584]连接所有点的最小费用","frequency":0.0,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","submitted":39386,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.4299891735835438,"acs":2383,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","questionId":"1707","status":"","submitted":5542,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6252019386106623,"acs":387,"articleLive":2,"columnArticles":24,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"lock","submitted":619,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.8246568859441552,"acs":3485,"articleLive":2,"columnArticles":41,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"lock","submitted":4226,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8388726808153615,"acs":43993,"articleLive":2,"columnArticles":700,"formTitle":"[1588]所有奇数长度子数组的和","frequency":0.0,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"ac","submitted":52443,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.2938085446652959,"acs":3858,"articleLive":2,"columnArticles":56,"formTitle":"[1589]所有排列中的最大和","frequency":0.0,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","submitted":13131,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.26872149477710755,"acs":3653,"articleLive":2,"columnArticles":57,"formTitle":"[1590]使数组和能被 P 整除","frequency":0.0,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","submitted":13594,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5769628099173554,"acs":1117,"articleLive":2,"columnArticles":33,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","submitted":1936,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.44522198003900426,"acs":7762,"articleLive":2,"columnArticles":126,"formTitle":"[1592]重新排列单词间的空格","frequency":0.0,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","submitted":17434,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.5317554240631164,"acs":5392,"articleLive":2,"columnArticles":88,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":0.0,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","questionId":"1715","status":"","submitted":10140,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.31354221191953935,"acs":4193,"articleLive":2,"columnArticles":100,"formTitle":"[1594]矩阵的最大非负积","frequency":0.0,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","submitted":13373,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.4649791103465225,"acs":1892,"articleLive":2,"columnArticles":39,"formTitle":"[1595]连通两组点的最小成本","frequency":0.0,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","questionId":"1717","status":"","submitted":4069,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7468778556198599,"acs":2452,"articleLive":2,"columnArticles":43,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","questionId":"1735","status":"lock","submitted":3283,"title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.6628959276018099,"acs":293,"articleLive":2,"columnArticles":20,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","questionId":"1736","status":"lock","submitted":442,"title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6721966577863889,"acs":11102,"articleLive":2,"columnArticles":150,"formTitle":"[1598]文件夹操作日志搜集器","frequency":0.0,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"ac","submitted":16516,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.41940379403794037,"acs":3869,"articleLive":2,"columnArticles":69,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","submitted":9225,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.6787564766839378,"acs":16899,"articleLive":2,"columnArticles":207,"formTitle":"[1600]皇位继承顺序","frequency":0.0,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","submitted":24897,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.48999775230388853,"acs":2180,"articleLive":2,"columnArticles":40,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","submitted":4449,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7836322869955157,"acs":699,"articleLive":2,"columnArticles":29,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","questionId":"1745","status":"lock","submitted":892,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8444871415903045,"acs":57138,"articleLive":2,"columnArticles":457,"formTitle":"[1603]设计停车系统","frequency":0.0,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"ac","submitted":67660,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.4155216005276465,"acs":3780,"articleLive":2,"columnArticles":63,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":0.0,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","questionId":"1709","status":"","submitted":9097,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7361765966566652,"acs":3435,"articleLive":2,"columnArticles":69,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","questionId":"1711","status":"ac","submitted":4666,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.34099456748850815,"acs":1632,"articleLive":2,"columnArticles":34,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","questionId":"1710","status":"","submitted":4786,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5447323623983356,"acs":2880,"articleLive":2,"columnArticles":37,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"lock","submitted":5287,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6400880201928678,"acs":9890,"articleLive":2,"columnArticles":162,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","questionId":"1730","status":"","submitted":15451,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.5116097975364576,"acs":7227,"articleLive":2,"columnArticles":125,"formTitle":"[1609]奇偶树","frequency":0.0,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"","submitted":14126,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.2704280155642023,"acs":2363,"articleLive":2,"columnArticles":39,"formTitle":"[1610]可见点的最大数目","frequency":0.0,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","submitted":8738,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6102385107620709,"acs":2098,"articleLive":2,"columnArticles":57,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","questionId":"1732","status":"","submitted":3438,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.735973597359736,"acs":446,"articleLive":2,"columnArticles":20,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","questionId":"1750","status":"lock","submitted":606,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.7236954662104362,"acs":1692,"articleLive":2,"columnArticles":36,"formTitle":"[1613]找到遗失的ID","frequency":0.0,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"lock","submitted":2338,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.8216357308584686,"acs":16998,"articleLive":2,"columnArticles":287,"formTitle":"[1614]括号的最大嵌套深度","frequency":0.0,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","submitted":20688,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.49657026325546905,"acs":5357,"articleLive":2,"columnArticles":64,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","submitted":10788,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.2756431308155446,"acs":5036,"articleLive":2,"columnArticles":93,"formTitle":"[1616]分割两个字符串得到回文串","frequency":0.0,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","submitted":18270,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6216121084125308,"acs":1766,"articleLive":2,"columnArticles":33,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","submitted":2841,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5933456561922366,"acs":321,"articleLive":2,"columnArticles":17,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","questionId":"1384","status":"lock","submitted":541,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6744037866375386,"acs":7409,"articleLive":2,"columnArticles":128,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","submitted":10986,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.37159124962541207,"acs":2480,"articleLive":2,"columnArticles":44,"formTitle":"[1620]网络信号最好的坐标","frequency":0.0,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","submitted":6674,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.441503833786792,"acs":1785,"articleLive":2,"columnArticles":35,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","questionId":"1725","status":"","submitted":4043,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.14998498949264485,"acs":2498,"articleLive":2,"columnArticles":55,"formTitle":"[1622]奇妙序列","frequency":0.0,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","submitted":16655,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.7822141560798548,"acs":3448,"articleLive":2,"columnArticles":45,"formTitle":"[1623]三人国家代表队","frequency":0.0,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","questionId":"1763","status":"lock","submitted":4408,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6253801042571677,"acs":11517,"articleLive":2,"columnArticles":199,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":0.0,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","submitted":18416,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.543205317577548,"acs":2942,"articleLive":2,"columnArticles":66,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","submitted":5416,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.38675821481118194,"acs":3943,"articleLive":2,"columnArticles":85,"formTitle":"[1626]无矛盾的最佳球队","frequency":0.0,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","submitted":10195,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.3815073815073815,"acs":2455,"articleLive":2,"columnArticles":38,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","submitted":6435,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8394308943089431,"acs":413,"articleLive":2,"columnArticles":18,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","questionId":"1768","status":"lock","submitted":492,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.524577861163227,"acs":8388,"articleLive":2,"columnArticles":99,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","submitted":15990,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.7683329890518488,"acs":7439,"articleLive":2,"columnArticles":116,"formTitle":"[1630]等差子数组","frequency":0.0,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","submitted":9682,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.4935130222935478,"acs":25524,"articleLive":2,"columnArticles":301,"formTitle":"[1631]最小体力消耗路径","frequency":0.0,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"ac","submitted":51719,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.31934227607096494,"acs":1476,"articleLive":2,"columnArticles":27,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","submitted":4622,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6573762614127823,"acs":2736,"articleLive":2,"columnArticles":26,"formTitle":"[1633]各赛事的用户注册率","frequency":0.0,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"lock","submitted":4162,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5262529832935561,"acs":441,"articleLive":2,"columnArticles":24,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","questionId":"1774","status":"lock","submitted":838,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5452865064695009,"acs":1180,"articleLive":2,"columnArticles":31,"formTitle":"[1635]Hopper 公司查询 I","frequency":0.0,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"lock","submitted":2164,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7055096205857353,"acs":9130,"articleLive":2,"columnArticles":178,"formTitle":"[1636]按照频率将数组升序排序","frequency":0.0,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","submitted":12941,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8067908653846154,"acs":5370,"articleLive":2,"columnArticles":70,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","questionId":"1742","status":"","submitted":6656,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7119155354449472,"acs":2832,"articleLive":2,"columnArticles":47,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":0.0,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","submitted":3978,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.4020715630885122,"acs":1281,"articleLive":2,"columnArticles":28,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","questionId":"1744","status":"","submitted":3186,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.6592485249974123,"acs":12738,"articleLive":2,"columnArticles":217,"formTitle":"[1640]能否连接形成数组","frequency":0.0,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","submitted":19322,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.771163264008141,"acs":12125,"articleLive":2,"columnArticles":279,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":0.0,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","submitted":15723,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.4510184287099903,"acs":6510,"articleLive":2,"columnArticles":107,"formTitle":"[1642]可以到达的最远建筑","frequency":0.0,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","submitted":14434,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.45140690480941925,"acs":2262,"articleLive":2,"columnArticles":48,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","submitted":5011,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.546583850931677,"acs":1144,"articleLive":2,"columnArticles":24,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":0.0,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","questionId":"1780","status":"lock","submitted":2093,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.4079878665318504,"acs":807,"articleLive":2,"columnArticles":24,"formTitle":"[1645]Hopper Company Queries II","frequency":0.0,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1785","status":"lock","submitted":1978,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5365218855734342,"acs":35044,"articleLive":2,"columnArticles":357,"formTitle":"[1646]获取生成数组中的最大值","frequency":0.0,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"ac","submitted":65317,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5150896939852269,"acs":7322,"articleLive":2,"columnArticles":107,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":0.0,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","submitted":14215,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.2777777777777778,"acs":3490,"articleLive":2,"columnArticles":90,"formTitle":"[1648]销售价值减少的颜色球","frequency":0.0,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","submitted":12564,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.4739776951672863,"acs":2550,"articleLive":2,"columnArticles":65,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","submitted":5380,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.7926829268292683,"acs":1300,"articleLive":2,"columnArticles":30,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":0.0,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","questionId":"1790","status":"lock","submitted":1640,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.6833631484794276,"acs":764,"articleLive":2,"columnArticles":23,"formTitle":"[1651]Hopper Company Queries III","frequency":0.0,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1795","status":"lock","submitted":1118,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6563143124415342,"acs":7016,"articleLive":2,"columnArticles":177,"formTitle":"[1652]拆炸弹","frequency":0.0,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","submitted":10690,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.5051799345692476,"acs":3706,"articleLive":2,"columnArticles":86,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":0.0,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","submitted":7336,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.2732180580549253,"acs":3492,"articleLive":2,"columnArticles":48,"formTitle":"[1654]到家的最少跳跃次数","frequency":0.0,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","submitted":12781,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.3836263944034789,"acs":2029,"articleLive":2,"columnArticles":33,"formTitle":"[1655]分配重复整数","frequency":0.0,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","submitted":5289,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.7816308332507679,"acs":7889,"articleLive":2,"columnArticles":93,"formTitle":"[1656]设计有序流","frequency":0.0,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","submitted":10093,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.46479229989868287,"acs":5505,"articleLive":2,"columnArticles":76,"formTitle":"[1657]确定两个字符串是否接近","frequency":0.0,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","submitted":11844,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.29995307996514514,"acs":8950,"articleLive":2,"columnArticles":151,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":0.0,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","submitted":29838,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.4128834355828221,"acs":1346,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":0.0,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","submitted":3260,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7381818181818182,"acs":406,"articleLive":2,"columnArticles":24,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"lock","submitted":550,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.7253206915783603,"acs":2601,"articleLive":2,"columnArticles":54,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":0.0,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"lock","submitted":3586,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8124169727279831,"acs":20793,"articleLive":2,"columnArticles":286,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":0.0,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","submitted":25594,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5723092921339968,"acs":7705,"articleLive":2,"columnArticles":132,"formTitle":"[1663]具有给定数值的最小字符串","frequency":0.0,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","submitted":13463,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.5454636893985114,"acs":5423,"articleLive":2,"columnArticles":107,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","submitted":9942,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.6625891946992865,"acs":5200,"articleLive":2,"columnArticles":82,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":0.0,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","submitted":7848,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.6985915492957746,"acs":248,"articleLive":2,"columnArticles":13,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","questionId":"1810","status":"lock","submitted":355,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.6027884089666484,"acs":2205,"articleLive":2,"columnArticles":32,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"lock","submitted":3658,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.44432989690721647,"acs":6896,"articleLive":2,"columnArticles":130,"formTitle":"[1668]最大重复子字符串","frequency":0.0,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","submitted":15520,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.7580202185473032,"acs":12972,"articleLive":2,"columnArticles":237,"formTitle":"[1669]合并两个链表","frequency":0.0,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"ac","submitted":17113,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5266365963671827,"acs":4320,"articleLive":2,"columnArticles":77,"formTitle":"[1670]设计前中后队列","frequency":0.0,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"ac","submitted":8203,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.4681818181818182,"acs":2060,"articleLive":2,"columnArticles":41,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":0.0,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","questionId":"1766","status":"","submitted":4400,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.8508270279781806,"acs":38682,"articleLive":2,"columnArticles":443,"formTitle":"[1672]最富有客户的资产总量","frequency":0.0,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","submitted":45464,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.35511443250817376,"acs":7603,"articleLive":2,"columnArticles":169,"formTitle":"[1673]找出最具竞争力的子序列","frequency":0.0,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"ac","submitted":21410,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.3642929365881843,"acs":2522,"articleLive":2,"columnArticles":53,"formTitle":"[1674]使数组互补的最少操作次数","frequency":0.0,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","submitted":6923,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.4349190617773373,"acs":2633,"articleLive":2,"columnArticles":43,"formTitle":"[1675]数组的最小偏移量","frequency":0.0,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","submitted":6054,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7657247037374658,"acs":840,"articleLive":2,"columnArticles":22,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":0.0,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","questionId":"1816","status":"lock","submitted":1097,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.38915501053841733,"acs":2031,"articleLive":2,"columnArticles":32,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"lock","submitted":5219,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.8299758259468171,"acs":17510,"articleLive":2,"columnArticles":283,"formTitle":"[1678]设计 Goal 解析器","frequency":0.0,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","submitted":21097,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.49782189530814824,"acs":6971,"articleLive":2,"columnArticles":113,"formTitle":"[1679]K 和数对的最大数目","frequency":0.0,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","submitted":14003,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.4647959620155702,"acs":5433,"articleLive":2,"columnArticles":72,"formTitle":"[1680]连接连续二进制数字","frequency":0.0,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","submitted":11689,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.3839458413926499,"acs":2382,"articleLive":2,"columnArticles":49,"formTitle":"[1681]最小不兼容性","frequency":0.0,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","submitted":6204,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5236593059936908,"acs":332,"articleLive":2,"columnArticles":17,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"lock","submitted":634,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8960839518812388,"acs":3501,"articleLive":2,"columnArticles":37,"formTitle":"[1683]无效的推文","frequency":0.0,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"lock","submitted":3907,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.8285950332895952,"acs":17050,"articleLive":2,"columnArticles":357,"formTitle":"[1684]统计一致字符串的数目","frequency":0.0,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","submitted":20577,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.6,"acs":3714,"articleLive":2,"columnArticles":86,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","questionId":"1787","status":"","submitted":6190,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.4716444444444444,"acs":2653,"articleLive":2,"columnArticles":48,"formTitle":"[1686]石子游戏 VI","frequency":0.0,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","submitted":5625,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.4028416213957376,"acs":964,"articleLive":2,"columnArticles":21,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","submitted":2393,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.8049959709911362,"acs":19980,"articleLive":2,"columnArticles":267,"formTitle":"[1688]比赛中的配对次数","frequency":0.0,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","submitted":24820,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8669956526847609,"acs":14758,"articleLive":2,"columnArticles":196,"formTitle":"[1689]十-二进制数的最少数目","frequency":0.0,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","questionId":"1807","status":"","submitted":17022,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5179839091339328,"acs":4378,"articleLive":2,"columnArticles":106,"formTitle":"[1690]石子游戏 VII","frequency":0.0,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","submitted":8452,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.48856176646111,"acs":2456,"articleLive":2,"columnArticles":63,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","submitted":5027,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.657243816254417,"acs":186,"articleLive":2,"columnArticles":13,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"lock","submitted":283,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.79979035639413,"acs":2289,"articleLive":2,"columnArticles":33,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"lock","submitted":2862,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6354523227383863,"acs":7797,"articleLive":2,"columnArticles":137,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","submitted":12270,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.46265255109542713,"acs":6293,"articleLive":2,"columnArticles":132,"formTitle":"[1695]删除子数组的最大得分","frequency":0.0,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","submitted":13602,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.39756900481134466,"acs":6280,"articleLive":2,"columnArticles":115,"formTitle":"[1696]跳跃游戏 VI","frequency":0.0,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","submitted":15796,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.5265572187349107,"acs":2181,"articleLive":2,"columnArticles":41,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","submitted":4142,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5215469613259669,"acs":472,"articleLive":2,"columnArticles":17,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.0,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","questionId":"1838","status":"lock","submitted":905,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.796730004418913,"acs":1803,"articleLive":2,"columnArticles":41,"formTitle":"[1699]两人之间的通话次数","frequency":0.0,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"lock","submitted":2263,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7099176449973716,"acs":8103,"articleLive":2,"columnArticles":182,"formTitle":"[1700]无法吃午餐的学生数量","frequency":0.0,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","submitted":11414,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6097181124435446,"acs":3915,"articleLive":2,"columnArticles":80,"formTitle":"[1701]平均等待时间","frequency":0.0,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","submitted":6421,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.4785829307568438,"acs":2972,"articleLive":2,"columnArticles":67,"formTitle":"[1702]修改后的最大二进制字符串","frequency":0.0,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","submitted":6210,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.3833980292624664,"acs":1284,"articleLive":2,"columnArticles":23,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.0,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","submitted":3349,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.7812920161341955,"acs":12203,"articleLive":2,"columnArticles":186,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","submitted":15619,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.34708298103635704,"acs":5747,"articleLive":2,"columnArticles":121,"formTitle":"[1705]吃苹果的最大数目","frequency":0.0,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"","submitted":16558,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5856465809072444,"acs":4325,"articleLive":2,"columnArticles":111,"formTitle":"[1706]球会落何处","frequency":0.0,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","submitted":7385,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5030313774153519,"acs":14188,"articleLive":2,"columnArticles":151,"formTitle":"[1707]与数组中元素的最大异或值","frequency":0.0,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","submitted":28205,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.6997776130467013,"acs":944,"articleLive":2,"columnArticles":25,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"lock","submitted":1349,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.7028985507246377,"acs":1455,"articleLive":2,"columnArticles":37,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.0,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"lock","submitted":2070,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.6947788771009655,"acs":11657,"articleLive":2,"columnArticles":186,"formTitle":"[1710]卡车上的最大单元数","frequency":0.0,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"ac","submitted":16778,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.3591635769721391,"acs":30127,"articleLive":2,"columnArticles":360,"formTitle":"[1711]大餐计数","frequency":0.0,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"ac","submitted":83881,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.26241922871136353,"acs":6376,"articleLive":2,"columnArticles":104,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.0,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","submitted":24297,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.4960096275652394,"acs":15662,"articleLive":2,"columnArticles":169,"formTitle":"[1713]得到子序列的最少操作次数","frequency":0.0,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"ac","submitted":31576,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.6323907455012854,"acs":246,"articleLive":2,"columnArticles":9,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","questionId":"1809","status":"lock","submitted":389,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.7312368972746331,"acs":1744,"articleLive":2,"columnArticles":36,"formTitle":"[1715]苹果和橘子的个数","frequency":0.0,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"lock","submitted":2385,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6734381297863765,"acs":8354,"articleLive":2,"columnArticles":194,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","submitted":12405,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.43297350343473995,"acs":2206,"articleLive":2,"columnArticles":50,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.0,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","submitted":5095,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.48971499380421313,"acs":1976,"articleLive":2,"columnArticles":48,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.0,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","submitted":4035,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.3700234192037471,"acs":632,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","questionId":"1820","status":"","submitted":1708,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.8690238393040491,"acs":46551,"articleLive":2,"columnArticles":489,"formTitle":"[1720]解码异或后的数组","frequency":0.0,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"ac","submitted":53567,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6457149621212122,"acs":10910,"articleLive":2,"columnArticles":168,"formTitle":"[1721]交换链表中的节点","frequency":0.0,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"ac","submitted":16896,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5155097613882863,"acs":4753,"articleLive":2,"columnArticles":113,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","submitted":9220,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5063161785489096,"acs":23287,"articleLive":2,"columnArticles":176,"formTitle":"[1723]完成所有工作的最短时间","frequency":0.0,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"ac","submitted":45993,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5629139072847682,"acs":340,"articleLive":2,"columnArticles":11,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","questionId":"1865","status":"lock","submitted":604,"title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.7876287154020303,"acs":10785,"articleLive":2,"columnArticles":148,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":0.0,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","questionId":"1843","status":"","submitted":13693,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.4806342604626982,"acs":5547,"articleLive":2,"columnArticles":108,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","submitted":11541,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.5759144813763154,"acs":3448,"articleLive":2,"columnArticles":84,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":0.0,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","submitted":5987,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.3580167417900837,"acs":1112,"articleLive":2,"columnArticles":26,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","submitted":3106,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.6208571428571429,"acs":2173,"articleLive":2,"columnArticles":22,"formTitle":"[1729]求关注者的数量","frequency":0.0,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"lock","submitted":3500,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.5388513513513513,"acs":638,"articleLive":2,"columnArticles":23,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"lock","submitted":1184,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.4694811800610376,"acs":1846,"articleLive":2,"columnArticles":28,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","questionId":"1882","status":"lock","submitted":3932,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.791023102310231,"acs":11984,"articleLive":2,"columnArticles":206,"formTitle":"[1732]找到最高海拔","frequency":0.0,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","submitted":15150,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.45933734939759036,"acs":2135,"articleLive":2,"columnArticles":54,"formTitle":"[1733]需要教语言的最少人数","frequency":0.0,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","submitted":4648,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7232832812136563,"acs":27986,"articleLive":2,"columnArticles":366,"formTitle":"[1734]解码异或后的排列","frequency":0.0,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"ac","submitted":38693,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.48914069877242683,"acs":1036,"articleLive":2,"columnArticles":26,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","submitted":2118,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.4491795556253435,"acs":28606,"articleLive":2,"columnArticles":351,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":0.0,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"ac","submitted":63685,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.3163627152988855,"acs":3747,"articleLive":2,"columnArticles":105,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":0.0,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","questionId":"1859","status":"","submitted":11844,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6538823691523322,"acs":28472,"articleLive":2,"columnArticles":386,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":0.0,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"ac","submitted":43543,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.4709980839574987,"acs":2704,"articleLive":2,"columnArticles":57,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","submitted":5741,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.7025392986698912,"acs":581,"articleLive":2,"columnArticles":20,"formTitle":"[1740]找到二叉树中的距离","frequency":0.0,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"lock","submitted":827,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8419563459983832,"acs":2083,"articleLive":2,"columnArticles":31,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","questionId":"1892","status":"lock","submitted":2474,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7088132198297447,"acs":8493,"articleLive":2,"columnArticles":129,"formTitle":"[1742]盒子中小球的最大数量","frequency":0.0,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","submitted":11982,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6965534387916835,"acs":22413,"articleLive":2,"columnArticles":327,"formTitle":"[1743]从相邻元素对还原数组","frequency":0.0,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"ac","submitted":32177,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.3628399062415944,"acs":28328,"articleLive":2,"columnArticles":368,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":0.0,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","questionId":"1872","status":"ac","submitted":78073,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.4847795163584637,"acs":3408,"articleLive":2,"columnArticles":71,"formTitle":"[1745]回文串分割 IV","frequency":0.0,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","submitted":7030,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.591931216931217,"acs":895,"articleLive":2,"columnArticles":38,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":0.0,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"lock","submitted":1512,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.7034300791556728,"acs":1333,"articleLive":2,"columnArticles":34,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"lock","submitted":1895,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.7480106100795756,"acs":11280,"articleLive":2,"columnArticles":224,"formTitle":"[1748]唯一元素的和","frequency":0.0,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","submitted":15080,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5310532341156268,"acs":3711,"articleLive":2,"columnArticles":86,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":0.0,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","submitted":6988,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.4560378408458542,"acs":3278,"articleLive":2,"columnArticles":80,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","questionId":"1850","status":"","submitted":7188,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.46984602224123184,"acs":2197,"articleLive":2,"columnArticles":33,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":0.0,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","questionId":"1851","status":"","submitted":4676,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.6797315627900335,"acs":9521,"articleLive":2,"columnArticles":112,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":0.0,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","submitted":14007,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6300010446046171,"acs":6031,"articleLive":2,"columnArticles":129,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","submitted":9573,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.4217985826928835,"acs":4226,"articleLive":2,"columnArticles":91,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":0.0,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","submitted":10019,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.4114346780657227,"acs":3080,"articleLive":2,"columnArticles":52,"formTitle":"[1755]最接近目标值的子序列和","frequency":0.0,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","submitted":7486,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.7954070981210856,"acs":381,"articleLive":2,"columnArticles":13,"formTitle":"[1756]设计最近使用（MRU）队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"lock","submitted":479,"title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9211630695443646,"acs":3073,"articleLive":2,"columnArticles":32,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"lock","submitted":3336,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6389011571415952,"acs":7233,"articleLive":2,"columnArticles":114,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","submitted":11321,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.42960691385558963,"acs":4623,"articleLive":2,"columnArticles":97,"formTitle":"[1759]统计同构子字符串的数目","frequency":0.0,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","submitted":10761,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5397866049620774,"acs":4199,"articleLive":2,"columnArticles":77,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","submitted":7779,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.430997526793075,"acs":2614,"articleLive":2,"columnArticles":40,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":0.0,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","questionId":"1887","status":"","submitted":6065,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.6929133858267716,"acs":704,"articleLive":2,"columnArticles":21,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"lock","submitted":1016,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.6112009407614288,"acs":4158,"articleLive":2,"columnArticles":82,"formTitle":"[1763]最长的美好子字符串","frequency":0.0,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","submitted":6803,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.4745797042738505,"acs":2343,"articleLive":2,"columnArticles":55,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.0,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","questionId":"1874","status":"","submitted":4937,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5515728977616455,"acs":3647,"articleLive":2,"columnArticles":83,"formTitle":"[1765]地图中的最高点","frequency":0.0,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","submitted":6612,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.3760660980810235,"acs":1411,"articleLive":2,"columnArticles":26,"formTitle":"[1766]互质树","frequency":0.0,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","submitted":3752,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7903075489282386,"acs":848,"articleLive":2,"columnArticles":21,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","questionId":"1914","status":"lock","submitted":1073,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7639054825434753,"acs":11509,"articleLive":2,"columnArticles":202,"formTitle":"[1768]交替合并字符串","frequency":0.0,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","submitted":15066,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8563363667003707,"acs":10163,"articleLive":2,"columnArticles":173,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":0.0,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","questionId":"1895","status":"","submitted":11868,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.37056928034371645,"acs":4140,"articleLive":2,"columnArticles":104,"formTitle":"[1770]执行乘法运算的最大分数","frequency":0.0,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","submitted":11172,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.36576971214017523,"acs":2338,"articleLive":2,"columnArticles":47,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","submitted":6392,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.5201192250372578,"acs":349,"articleLive":2,"columnArticles":11,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"lock","submitted":671,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8426748928160619,"acs":16117,"articleLive":2,"columnArticles":199,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":0.0,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","submitted":19126,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5508668929456013,"acs":6005,"articleLive":2,"columnArticles":90,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":0.0,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","submitted":10901,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.47437174803498283,"acs":4285,"articleLive":2,"columnArticles":92,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":0.0,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","questionId":"1901","status":"","submitted":9033,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.462551652892562,"acs":1791,"articleLive":2,"columnArticles":43,"formTitle":"[1776]车队 II","frequency":0.0,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","submitted":3872,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.7822777538417349,"acs":5447,"articleLive":2,"columnArticles":61,"formTitle":"[1777]每家商店的产品价格","frequency":0.0,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"lock","submitted":6963,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5186246418338109,"acs":181,"articleLive":2,"columnArticles":10,"formTitle":"[1778]未知网格中的最短路径","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","questionId":"1931","status":"lock","submitted":349,"title":"未知网格中的最短路径","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.6483194753484014,"acs":5536,"articleLive":2,"columnArticles":70,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":0.0,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","questionId":"1888","status":"","submitted":8539,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.6653813712495481,"acs":5522,"articleLive":2,"columnArticles":113,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","questionId":"1889","status":"","submitted":8299,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5202779532533165,"acs":4118,"articleLive":2,"columnArticles":61,"formTitle":"[1781]所有子字符串美丽值之和","frequency":0.0,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","submitted":7915,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.29200968523002424,"acs":1206,"articleLive":2,"columnArticles":33,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","submitted":4130,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7992125984251969,"acs":1218,"articleLive":2,"columnArticles":29,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"lock","submitted":1524,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.4215383151786139,"acs":8862,"articleLive":2,"columnArticles":101,"formTitle":"[1784]检查二进制字符串字段","frequency":0.0,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","questionId":"1910","status":"","submitted":21023,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.35036576045419804,"acs":6418,"articleLive":2,"columnArticles":62,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","questionId":"1911","status":"","submitted":18318,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.34217373899119297,"acs":3419,"articleLive":2,"columnArticles":88,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.0,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","questionId":"1912","status":"","submitted":9992,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.6540894462323826,"acs":11788,"articleLive":2,"columnArticles":60,"formTitle":"[1787]使所有区间的异或结果为零","frequency":0.0,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","questionId":"1913","status":"ac","submitted":18022,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.7169230769230769,"acs":233,"articleLive":2,"columnArticles":16,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"lock","submitted":325,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7103354487760652,"acs":1567,"articleLive":2,"columnArticles":30,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"lock","submitted":2206,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6439093623060735,"acs":13157,"articleLive":2,"columnArticles":144,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":0.0,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","questionId":"1915","status":"","submitted":20433,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8089887640449438,"acs":10080,"articleLive":2,"columnArticles":138,"formTitle":"[1791]找出星型图的中心节点","frequency":0.0,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","questionId":"1916","status":"","submitted":12460,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5140099626400996,"acs":6604,"articleLive":2,"columnArticles":105,"formTitle":"[1792]最大平均通过率","frequency":0.0,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","submitted":12848,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.41445834216663135,"acs":3910,"articleLive":2,"columnArticles":94,"formTitle":"[1793]好子数组的最大分数","frequency":0.0,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","submitted":9434,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.5805369127516778,"acs":173,"articleLive":2,"columnArticles":9,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","questionId":"1943","status":"lock","submitted":298,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7837160751565762,"acs":1877,"articleLive":2,"columnArticles":28,"formTitle":"[1795]每个产品在不同商店的价格","frequency":0.0,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"lock","submitted":2395,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.48872015769876614,"acs":6694,"articleLive":2,"columnArticles":122,"formTitle":"[1796]字符串中第二大的数字","frequency":0.0,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"ac","submitted":13697,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.573685540950455,"acs":4539,"articleLive":2,"columnArticles":72,"formTitle":"[1797]设计一个验证系统","frequency":0.0,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"ac","submitted":7912,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5217611336032388,"acs":3093,"articleLive":2,"columnArticles":51,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":0.0,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","questionId":"1930","status":"","submitted":5928,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5185185185185185,"acs":2366,"articleLive":2,"columnArticles":34,"formTitle":"[1799]N 次操作后的最大分数和","frequency":0.0,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","submitted":4563,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.682652210175146,"acs":9822,"articleLive":2,"columnArticles":154,"formTitle":"[1800]最大升序子数组和","frequency":0.0,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"ac","submitted":14388,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.3795120168144019,"acs":4153,"articleLive":2,"columnArticles":110,"formTitle":"[1801]积压订单中的订单总数","frequency":0.0,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"notac","submitted":10943,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.26251716818579096,"acs":4205,"articleLive":2,"columnArticles":108,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","questionId":"1929","status":"","submitted":16018,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.40948358610097907,"acs":2133,"articleLive":2,"columnArticles":54,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":0.0,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"ac","submitted":5209,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5731857318573186,"acs":466,"articleLive":2,"columnArticles":29,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":0.0,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"lock","submitted":813,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.4875450953444425,"acs":11352,"articleLive":2,"columnArticles":149,"formTitle":"[1805]字符串中不同整数的数目","frequency":0.0,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","submitted":23284,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.6626229089516026,"acs":5189,"articleLive":2,"columnArticles":81,"formTitle":"[1806]还原排列的最少操作步数","frequency":0.0,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","questionId":"1935","status":"","submitted":7831,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5863654946852003,"acs":5737,"articleLive":2,"columnArticles":87,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","submitted":9784,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.2678943330044941,"acs":2444,"articleLive":2,"columnArticles":47,"formTitle":"[1808]好因子的最大数目","frequency":0.0,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","submitted":9123,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6245931283905968,"acs":1727,"articleLive":2,"columnArticles":31,"formTitle":"[1809]没有广告的剧集","frequency":0.0,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"lock","submitted":2765,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.6216216216216216,"acs":184,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":0.0,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","questionId":"1959","status":"lock","submitted":296,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6630851880276285,"acs":864,"articleLive":2,"columnArticles":27,"formTitle":"[1811]寻找面试候选人","frequency":0.0,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"lock","submitted":1303,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7944520682219173,"acs":8105,"articleLive":2,"columnArticles":192,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.0,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"ac","submitted":10202,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5122159901131286,"acs":5388,"articleLive":2,"columnArticles":74,"formTitle":"[1813]句子相似性 III","frequency":0.0,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"ac","submitted":10519,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.34577546296296297,"acs":3585,"articleLive":2,"columnArticles":79,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":0.0,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"ac","submitted":10368,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.3018136995949991,"acs":1714,"articleLive":2,"columnArticles":40,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","submitted":5679,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.752357641638471,"acs":10451,"articleLive":2,"columnArticles":156,"formTitle":"[1816]截断句子","frequency":0.0,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"ac","submitted":13891,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6988709114189268,"acs":6004,"articleLive":2,"columnArticles":98,"formTitle":"[1817]查找用户活跃分钟数","frequency":0.0,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"ac","submitted":8591,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.3731979077618558,"acs":25757,"articleLive":2,"columnArticles":338,"formTitle":"[1818]绝对差值和","frequency":0.0,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"ac","submitted":69017,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.3684210526315789,"acs":2317,"articleLive":2,"columnArticles":31,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.0,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","submitted":6289,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.507177033492823,"acs":106,"articleLive":2,"columnArticles":8,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"lock","submitted":209,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.9005444646098003,"acs":2481,"articleLive":2,"columnArticles":22,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":0.0,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","questionId":"1974","status":"lock","submitted":2755,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8093526632475871,"acs":20042,"articleLive":2,"columnArticles":201,"formTitle":"[1822]数组元素积的符号","frequency":0.0,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","submitted":24763,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7158071278825996,"acs":8536,"articleLive":2,"columnArticles":105,"formTitle":"[1823]找出游戏的获胜者","frequency":0.0,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","submitted":11925,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6550126368997473,"acs":7775,"articleLive":2,"columnArticles":154,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","submitted":11870,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.2857451403887689,"acs":2646,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":0.0,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","submitted":9260,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.4301587301587302,"acs":271,"articleLive":2,"columnArticles":22,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"lock","submitted":630,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7933609958506224,"acs":9560,"articleLive":2,"columnArticles":139,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"ac","submitted":12050,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.8670159402519229,"acs":7778,"articleLive":2,"columnArticles":102,"formTitle":"[1828]统计一个圆中点的数目","frequency":0.0,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","questionId":"1939","status":"ac","submitted":8971,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.682580424366872,"acs":3989,"articleLive":2,"columnArticles":83,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"ac","submitted":5844,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.4861816130851664,"acs":862,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","questionId":"1941","status":"ac","submitted":1773,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.7375306623058054,"acs":902,"articleLive":2,"columnArticles":23,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"lock","submitted":1223,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8242631772043537,"acs":13480,"articleLive":2,"columnArticles":215,"formTitle":"[1832]判断句子是否为全字母句","frequency":0.0,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"ac","submitted":16354,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.684341653739482,"acs":43674,"articleLive":2,"columnArticles":389,"formTitle":"[1833]雪糕的最大数量","frequency":0.0,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"ac","submitted":63819,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.35474023729985027,"acs":6159,"articleLive":2,"columnArticles":131,"formTitle":"[1834]单线程 CPU","frequency":0.0,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","submitted":17362,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5100435454417755,"acs":3631,"articleLive":2,"columnArticles":60,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":0.0,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","questionId":"1963","status":"","submitted":7119,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.7089678510998308,"acs":419,"articleLive":2,"columnArticles":27,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":0.0,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","questionId":"1982","status":"lock","submitted":591,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.794908350305499,"acs":7806,"articleLive":2,"columnArticles":86,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":0.0,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"ac","submitted":9820,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.42911259414907,"acs":28999,"articleLive":2,"columnArticles":307,"formTitle":"[1838]最高频元素的频数","frequency":0.0,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"ac","submitted":67579,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5731600210785175,"acs":6526,"articleLive":2,"columnArticles":124,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"ac","submitted":11386,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.38927233287320057,"acs":1974,"articleLive":2,"columnArticles":47,"formTitle":"[1840]最高建筑高度","frequency":0.0,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"ac","submitted":5071,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5148842337375965,"acs":934,"articleLive":2,"columnArticles":30,"formTitle":"[1841]联赛信息统计","frequency":0.0,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"lock","submitted":1814,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.6557377049180327,"acs":120,"articleLive":2,"columnArticles":11,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"lock","submitted":183,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.5102848101265823,"acs":645,"articleLive":2,"columnArticles":23,"formTitle":"[1843]Suspicious Bank Accounts","frequency":0.0,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","questionId":"1998","status":"lock","submitted":1264,"title":"Suspicious Bank Accounts","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.8005303816441831,"acs":6943,"articleLive":2,"columnArticles":115,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","questionId":"1954","status":"","submitted":8673,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.5341741253051261,"acs":6565,"articleLive":2,"columnArticles":62,"formTitle":"[1845]座位预约管理系统","frequency":0.0,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","questionId":"1955","status":"","submitted":12290,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.6335339520352844,"acs":27579,"articleLive":2,"columnArticles":376,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":0.0,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","questionId":"1956","status":"ac","submitted":43532,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.359828141783029,"acs":2345,"articleLive":2,"columnArticles":43,"formTitle":"[1847]最近的房间","frequency":0.0,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1957","status":"","submitted":6517,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6834399929867625,"acs":7796,"articleLive":2,"columnArticles":100,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","questionId":"1975","status":"","submitted":11407,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.32822283340160335,"acs":5609,"articleLive":2,"columnArticles":108,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":0.0,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","questionId":"1976","status":"","submitted":17089,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6103730199284619,"acs":2389,"articleLive":2,"columnArticles":49,"formTitle":"[1850]邻位交换的最小次数","frequency":0.0,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","questionId":"1978","status":"","submitted":3914,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.4005607850991388,"acs":2000,"articleLive":2,"columnArticles":48,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.0,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","questionId":"1977","status":"","submitted":4993,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.6936619718309859,"acs":197,"articleLive":2,"columnArticles":12,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","questionId":"2003","status":"lock","submitted":284,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6439024390243903,"acs":1056,"articleLive":2,"columnArticles":19,"formTitle":"[1853]转换日期格式","frequency":0.0,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","questionId":"2004","status":"lock","submitted":1640,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7880391106348781,"acs":11767,"articleLive":2,"columnArticles":123,"formTitle":"[1854]人口最多的年份","frequency":0.0,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","questionId":"1983","status":"ac","submitted":14932,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.6799663735126746,"acs":10515,"articleLive":2,"columnArticles":100,"formTitle":"[1855]下标对中的最大距离","frequency":0.0,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","questionId":"1984","status":"notac","submitted":15464,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.35647189937907975,"acs":4478,"articleLive":2,"columnArticles":84,"formTitle":"[1856]子数组最小乘积的最大值","frequency":0.0,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","questionId":"1985","status":"ac","submitted":12562,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.4522332506203474,"acs":2187,"articleLive":2,"columnArticles":31,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","questionId":"1986","status":"","submitted":4836,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.6358595194085028,"acs":344,"articleLive":2,"columnArticles":19,"formTitle":"[1858]包含所有前缀的最长单词","frequency":0.0,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","questionId":"2009","status":"lock","submitted":541,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7675627834937493,"acs":6938,"articleLive":2,"columnArticles":146,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","questionId":"1970","status":"ac","submitted":9039,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.7716355318337781,"acs":4048,"articleLive":2,"columnArticles":67,"formTitle":"[1860]增长的内存泄露","frequency":0.0,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","questionId":"1971","status":"ac","submitted":5246,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6187916975537435,"acs":3339,"articleLive":2,"columnArticles":68,"formTitle":"[1861]旋转盒子","frequency":0.0,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","questionId":"1972","status":"notac","submitted":5396,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.313381255183854,"acs":2267,"articleLive":2,"columnArticles":43,"formTitle":"[1862]向下取整数对和","frequency":0.0,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","questionId":"1326","status":"notac","submitted":7234,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.9039251806716735,"acs":12758,"articleLive":2,"columnArticles":144,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":0.0,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","questionId":"1993","status":"","submitted":14114,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.38811219555086607,"acs":4414,"articleLive":2,"columnArticles":105,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":0.0,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","questionId":"1994","status":"ac","submitted":11373,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.5127883408937361,"acs":5313,"articleLive":2,"columnArticles":62,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.0,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","questionId":"1995","status":"ac","submitted":10361,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.5973154362416108,"acs":2225,"articleLive":2,"columnArticles":49,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":0.0,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","questionId":"1996","status":"","submitted":3725,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7409024745269287,"acs":509,"articleLive":2,"columnArticles":15,"formTitle":"[1867]Orders With Maximum Quantity Above Average","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","questionId":"2014","status":"lock","submitted":687,"title":"Orders With Maximum Quantity Above Average","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5476923076923077,"acs":178,"articleLive":2,"columnArticles":12,"formTitle":"[1868]两个行程编码数组的积","frequency":0.0,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","questionId":"2019","status":"lock","submitted":325,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.787981719367589,"acs":12759,"articleLive":2,"columnArticles":140,"formTitle":"[1869]哪种连续子字符串更长","frequency":0.0,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","questionId":"1999","status":"ac","submitted":16192,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.45534256515692084,"acs":7530,"articleLive":2,"columnArticles":72,"formTitle":"[1870]准时到达的列车最小时速","frequency":0.0,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","questionId":"2000","status":"notac","submitted":16537,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.2763643067846608,"acs":5996,"articleLive":2,"columnArticles":128,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","questionId":"2001","status":"notac","submitted":21696,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.6221071863580999,"acs":2043,"articleLive":2,"columnArticles":29,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","questionId":"2002","status":"","submitted":3284,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.8125,"acs":2119,"articleLive":2,"columnArticles":32,"formTitle":"[1873]计算特殊奖金","frequency":0.0,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","questionId":"2024","status":"lock","submitted":2608,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.8936781609195402,"acs":311,"articleLive":2,"columnArticles":18,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","questionId":"2029","status":"lock","submitted":348,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.7433155080213903,"acs":417,"articleLive":2,"columnArticles":18,"formTitle":"[1875]Group Employees of the Same Salary","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","questionId":"2030","status":"lock","submitted":561,"title":"Group Employees of the Same Salary","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7286360390383242,"acs":6122,"articleLive":2,"columnArticles":95,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","questionId":"1987","status":"ac","submitted":8402,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.820412246294785,"acs":31165,"articleLive":2,"columnArticles":401,"formTitle":"[1877]数组中最大数对和的最小值","frequency":0.0,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","questionId":"1988","status":"ac","submitted":37987,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.4294282287085166,"acs":2148,"articleLive":2,"columnArticles":56,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","questionId":"1990","status":"ac","submitted":5002,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.41109405832054374,"acs":1875,"articleLive":2,"columnArticles":39,"formTitle":"[1879]两个数组最小的异或值之和","frequency":0.0,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","questionId":"1989","status":"","submitted":4561,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7705694573164452,"acs":7483,"articleLive":2,"columnArticles":101,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":0.0,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","questionId":"2010","status":"ac","submitted":9711,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.35381021897810216,"acs":6059,"articleLive":2,"columnArticles":63,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","questionId":"2011","status":"ac","submitted":17125,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.27850877192982454,"acs":3683,"articleLive":2,"columnArticles":111,"formTitle":"[1882]使用服务器处理任务","frequency":0.0,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","questionId":"2012","status":"notac","submitted":13224,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.3759430911834447,"acs":1744,"articleLive":2,"columnArticles":28,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.0,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","questionId":"2013","status":"","submitted":4639,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.6883802816901409,"acs":1955,"articleLive":2,"columnArticles":38,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":0.0,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","questionId":"2031","status":"","submitted":2840,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5186721991701245,"acs":250,"articleLive":2,"columnArticles":11,"formTitle":"[1885]Count Pairs in Two Arrays","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","questionId":"2036","status":"lock","submitted":482,"title":"Count Pairs in Two Arrays","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.5715947546531303,"acs":5405,"articleLive":2,"columnArticles":77,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":0.0,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","questionId":"2015","status":"","submitted":9456,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.645650538982201,"acs":5151,"articleLive":2,"columnArticles":64,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":0.0,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","questionId":"2016","status":"","submitted":7978,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.3173714285714286,"acs":2777,"articleLive":2,"columnArticles":63,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":0.0,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","questionId":"2017","status":"","submitted":8750,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.27128408654461655,"acs":2119,"articleLive":2,"columnArticles":41,"formTitle":"[1889]装包裹的最小浪费空间","frequency":0.0,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","questionId":"2018","status":"","submitted":7811,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.7077259475218659,"acs":971,"articleLive":2,"columnArticles":20,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","questionId":"2041","status":"lock","submitted":1372,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.4659270998415214,"acs":294,"articleLive":2,"columnArticles":11,"formTitle":"[1891]割绳子","frequency":0.0,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"2045","status":"lock","submitted":631,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.3381245722108145,"acs":494,"articleLive":2,"columnArticles":14,"formTitle":"[1892]页面推荐Ⅱ","frequency":0.0,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","questionId":"2046","status":"lock","submitted":1461,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5911600135190958,"acs":31484,"articleLive":2,"columnArticles":410,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":0.0,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","questionId":"2005","status":"ac","submitted":53258,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.45783725277969106,"acs":37224,"articleLive":2,"columnArticles":513,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":0.0,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","questionId":"2006","status":"ac","submitted":81304,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5332480818414322,"acs":2085,"articleLive":2,"columnArticles":40,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","questionId":"1311","status":"notac","submitted":3910,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5065398335315101,"acs":852,"articleLive":2,"columnArticles":31,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","questionId":"2008","status":"","submitted":1682,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.5308828465928164,"acs":6326,"articleLive":2,"columnArticles":79,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":0.0,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","questionId":"2025","status":"ac","submitted":11916,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.31021925498824066,"acs":4089,"articleLive":2,"columnArticles":63,"formTitle":"[1898]可移除字符的最大数目","frequency":0.0,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","questionId":"2027","status":"notac","submitted":13181,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.63001010441226,"acs":3741,"articleLive":2,"columnArticles":42,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","questionId":"2026","status":"","submitted":5938,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.43648321218414676,"acs":1261,"articleLive":2,"columnArticles":36,"formTitle":"[1900]最佳运动员的比拼回合","frequency":0.0,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","questionId":"2028","status":"","submitted":2889,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6553438276719138,"acs":791,"articleLive":2,"columnArticles":30,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","questionId":"2047","status":"","submitted":1207,"title":"找出顶峰元素 II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.4519774011299435,"acs":80,"articleLive":2,"columnArticles":4,"formTitle":"[1902]Depth of BST Given Insertion Order","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","questionId":"2052","status":"lock","submitted":177,"title":"Depth of BST Given Insertion Order","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6431710615280595,"acs":7610,"articleLive":2,"columnArticles":103,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","questionId":"2032","status":"","submitted":11832,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.2843668946003301,"acs":3618,"articleLive":2,"columnArticles":73,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","questionId":"2033","status":"","submitted":12723,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.5712405790166288,"acs":4775,"articleLive":2,"columnArticles":96,"formTitle":"[1905]统计子岛屿","frequency":0.0,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","questionId":"2035","status":"","submitted":8359,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.4246993054379129,"acs":2507,"articleLive":2,"columnArticles":57,"formTitle":"[1906]查询差绝对值的最小值","frequency":0.0,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","questionId":"2034","status":"","submitted":5903,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.5916167664670658,"acs":494,"articleLive":2,"columnArticles":17,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","questionId":"2057","status":"lock","submitted":835,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.6706349206349206,"acs":169,"articleLive":2,"columnArticles":7,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","questionId":"2062","status":"lock","submitted":252,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.32518758174433815,"acs":4724,"articleLive":2,"columnArticles":73,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":0.0,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","questionId":"2020","status":"notac","submitted":14527,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.6747626004382761,"acs":3695,"articleLive":2,"columnArticles":57,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.0,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","questionId":"2021","status":"ac","submitted":5476,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.568695652173913,"acs":3270,"articleLive":2,"columnArticles":70,"formTitle":"[1911]最大子序列交替和","frequency":0.0,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","questionId":"2022","status":"notac","submitted":5750,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.26862745098039215,"acs":1644,"articleLive":2,"columnArticles":38,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","questionId":"2023","status":"","submitted":6120,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.8364538002226495,"acs":8265,"articleLive":2,"columnArticles":88,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":0.0,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","questionId":"2042","status":"ac","submitted":9881,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.4418068366793272,"acs":3257,"articleLive":2,"columnArticles":70,"formTitle":"[1914]循环轮转矩阵","frequency":0.0,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","questionId":"2043","status":"","submitted":7372,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.3917751884852639,"acs":2858,"articleLive":2,"columnArticles":56,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","questionId":"2044","status":"notac","submitted":7295,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5529522024367385,"acs":1180,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":0.0,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","questionId":"1313","status":"","submitted":2134,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.27359389895138225,"acs":287,"articleLive":2,"columnArticles":10,"formTitle":"[1917]Leetcodify Friends Recommendations","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","questionId":"2063","status":"lock","submitted":1049,"title":"Leetcodify Friends Recommendations","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.5,"acs":138,"articleLive":2,"columnArticles":3,"formTitle":"[1918]第 K 小的子数组和·","frequency":0.0,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","questionId":"2069","status":"lock","submitted":276,"title":"第 K 小的子数组和·","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.3910196445275959,"acs":418,"articleLive":2,"columnArticles":13,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","questionId":"2064","status":"lock","submitted":1069,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.9135594646915243,"acs":10854,"articleLive":2,"columnArticles":96,"formTitle":"[1920]基于排列构建数组","frequency":0.0,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","questionId":"2048","status":"ac","submitted":11881,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.3442387985293201,"acs":5524,"articleLive":2,"columnArticles":90,"formTitle":"[1921]消灭怪物的最大数量","frequency":0.0,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","questionId":"2049","status":"ac","submitted":16047,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.3614654635967642,"acs":4647,"articleLive":2,"columnArticles":79,"formTitle":"[1922]统计好数字的数目","frequency":0.0,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","questionId":"2050","status":"","submitted":12856,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.237989182309895,"acs":1496,"articleLive":2,"columnArticles":30,"formTitle":"[1923]最长公共子路径","frequency":0.0,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","questionId":"2051","status":"","submitted":6286,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.38235294117647056,"acs":65,"articleLive":2,"columnArticles":5,"formTitle":"[1924]Erect the Fence II","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","questionId":"2074","status":"lock","submitted":170,"title":"Erect the Fence II","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6906045983536758,"acs":4866,"articleLive":2,"columnArticles":61,"formTitle":"[1925]统计平方和三元组的数目","frequency":0.0,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","questionId":"2037","status":"ac","submitted":7046,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.3451151331374964,"acs":3642,"articleLive":2,"columnArticles":62,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","questionId":"2038","status":"notac","submitted":10553,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.4143772893772894,"acs":1810,"articleLive":2,"columnArticles":37,"formTitle":"[1927]求和游戏","frequency":0.0,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","questionId":"2039","status":"notac","submitted":4368,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.39863445378151263,"acs":2277,"articleLive":2,"columnArticles":37,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":0.0,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","questionId":"2040","status":"notac","submitted":5712,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.912037708484409,"acs":12577,"articleLive":2,"columnArticles":109,"formTitle":"[1929]数组串联","frequency":0.0,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","questionId":"2058","status":"","submitted":13790,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.481036717062635,"acs":5568,"articleLive":2,"columnArticles":99,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":0.0,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","questionId":"2059","status":"","submitted":11575,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5607094133697135,"acs":2055,"articleLive":2,"columnArticles":63,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":0.0,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","questionId":"2061","status":"","submitted":3665,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.32884500299222025,"acs":1099,"articleLive":2,"columnArticles":36,"formTitle":"[1932]合并多棵二叉搜索树","frequency":0.0,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","questionId":"2060","status":"","submitted":3342,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.542997542997543,"acs":442,"articleLive":2,"columnArticles":24,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.0,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","questionId":"2070","status":"lock","submitted":814,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7397959183673469,"acs":290,"articleLive":2,"columnArticles":11,"formTitle":"[1934]Confirmation Rate","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","questionId":"2087","status":"lock","submitted":392,"title":"Confirmation Rate","titleSlug":"confirmation-rate"},{"acceptance":0.739244091057619,"acs":6787,"articleLive":2,"columnArticles":95,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","questionId":"1264","status":"","submitted":9181,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.4502358302022544,"acs":5632,"articleLive":2,"columnArticles":65,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","questionId":"2066","status":"","submitted":12509,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.24281223644866978,"acs":3167,"articleLive":2,"columnArticles":64,"formTitle":"[1937]扣分后的最大得分","frequency":0.0,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","questionId":"2067","status":"","submitted":13043,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.34566403881140084,"acs":1140,"articleLive":2,"columnArticles":41,"formTitle":"[1938]查询最大基因差","frequency":0.0,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","questionId":"2068","status":"","submitted":3298,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6175243393602226,"acs":444,"articleLive":2,"columnArticles":13,"formTitle":"[1939]Users That Actively Request Confirmation Messages","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","questionId":"2092","status":"lock","submitted":719,"title":"Users That Actively Request Confirmation Messages","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.7966804979253111,"acs":384,"articleLive":2,"columnArticles":25,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","questionId":"2071","status":"lock","submitted":482,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.773117254528122,"acs":4866,"articleLive":2,"columnArticles":85,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":0.0,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","questionId":"2053","status":"ac","submitted":6294,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.39304956896551724,"acs":2918,"articleLive":2,"columnArticles":69,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","questionId":"2054","status":"ac","submitted":7424,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.40871057712937137,"acs":1905,"articleLive":2,"columnArticles":52,"formTitle":"[1943]描述绘画结果","frequency":0.0,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","questionId":"2055","status":"notac","submitted":4661,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.577758470894874,"acs":1995,"articleLive":2,"columnArticles":55,"formTitle":"[1944]队列中可以看到的人数","frequency":0.0,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","questionId":"1305","status":"","submitted":3453,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6643821810118927,"acs":6592,"articleLive":2,"columnArticles":78,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":0.0,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","questionId":"2076","status":"ac","submitted":9922,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.3042959427207637,"acs":5355,"articleLive":2,"columnArticles":82,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":0.0,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","questionId":"2077","status":"ac","submitted":17598,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5423227021935136,"acs":4030,"articleLive":2,"columnArticles":89,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","questionId":"2078","status":"ac","submitted":7431,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.514118273841236,"acs":965,"articleLive":2,"columnArticles":20,"formTitle":"[1948]删除系统中的重复文件夹","frequency":0.0,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","questionId":"2079","status":"","submitted":1877,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.532608695652174,"acs":245,"articleLive":2,"columnArticles":12,"formTitle":"[1949]Strong Friendship","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","questionId":"2097","status":"lock","submitted":460,"title":"Strong Friendship","titleSlug":"strong-friendship"},{"acceptance":0.5564516129032258,"acs":138,"articleLive":2,"columnArticles":7,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","questionId":"2072","status":"lock","submitted":248,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.6688172043010753,"acs":311,"articleLive":2,"columnArticles":12,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","questionId":"2098","status":"lock","submitted":465,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5458164221042773,"acs":6993,"articleLive":2,"columnArticles":80,"formTitle":"[1952]三除数","frequency":0.0,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","questionId":"2083","status":"ac","submitted":12812,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.32612846559230124,"acs":4270,"articleLive":2,"columnArticles":83,"formTitle":"[1953]你可以工作的最大周数","frequency":0.0,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","questionId":"2084","status":"ac","submitted":13093,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.48076036866359445,"acs":4173,"articleLive":2,"columnArticles":69,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":0.0,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","questionId":"1295","status":"ac","submitted":8680,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.4963768115942029,"acs":2603,"articleLive":2,"columnArticles":41,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.0,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","questionId":"2086","status":"","submitted":5244,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.459214501510574,"acs":152,"articleLive":2,"columnArticles":11,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":0.0,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","questionId":"2073","status":"lock","submitted":331,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6049432197728791,"acs":4528,"articleLive":2,"columnArticles":58,"formTitle":"[1957]删除字符使字符串变好","frequency":0.0,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","questionId":"1302","status":"","submitted":7485,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.42422706538266597,"acs":2511,"articleLive":2,"columnArticles":44,"formTitle":"[1958]检查操作是否合法","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","questionId":"2080","status":"","submitted":5919,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.41391839016210175,"acs":1481,"articleLive":2,"columnArticles":32,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","questionId":"2081","status":"","submitted":3578,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.27955555555555556,"acs":629,"articleLive":2,"columnArticles":19,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":0.0,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","questionId":"1336","status":"","submitted":2250,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5346051125524609,"acs":7006,"articleLive":2,"columnArticles":65,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":0.0,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","questionId":"2093","status":"","submitted":13105,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.4315854315854316,"acs":5605,"articleLive":2,"columnArticles":75,"formTitle":"[1962]移除石子使总数最小","frequency":0.0,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","questionId":"2094","status":"","submitted":12987,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6149162861491628,"acs":4444,"articleLive":2,"columnArticles":55,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":0.0,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","questionId":"2095","status":"","submitted":7227,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.3856201171875,"acs":3159,"articleLive":2,"columnArticles":47,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","questionId":"2096","status":"","submitted":8192,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.7365269461077845,"acs":369,"articleLive":2,"columnArticles":13,"formTitle":"[1965]Employees With Missing Information","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","questionId":"2110","status":"lock","submitted":501,"title":"Employees With Missing Information","titleSlug":"employees-with-missing-information"},{"acceptance":0.7288135593220338,"acs":43,"articleLive":2,"columnArticles":6,"formTitle":"[1966]Binary Searchable Numbers in an Unsorted Array","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","questionId":"2111","status":"lock","submitted":59,"title":"Binary Searchable Numbers in an Unsorted Array","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.7787971457696228,"acs":6112,"articleLive":2,"columnArticles":58,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","questionId":"2099","status":"","submitted":7848,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.3587299146613362,"acs":4666,"articleLive":2,"columnArticles":68,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","questionId":"2085","status":"","submitted":13007,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.278983083245723,"acs":2919,"articleLive":2,"columnArticles":43,"formTitle":"[1969]数组元素的最小非零乘积","frequency":0.0,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","questionId":"2100","status":"","submitted":10463,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.4786361674579197,"acs":2218,"articleLive":2,"columnArticles":50,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":0.0,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","questionId":"2101","status":"","submitted":4634,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.5425867507886435,"acs":516,"articleLive":2,"columnArticles":20,"formTitle":"[1971]Find if Path Exists in Graph","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","questionId":"2121","status":"","submitted":951,"title":"Find if Path Exists in Graph","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.45588235294117646,"acs":186,"articleLive":2,"columnArticles":8,"formTitle":"[1972]First and Last Call On the Same Day","frequency":0.0,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","questionId":"2120","status":"lock","submitted":408,"title":"First and Last Call On the Same Day","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.5619834710743802,"acs":68,"articleLive":2,"columnArticles":9,"formTitle":"[1973]Count Nodes Equal to Sum of Descendants","frequency":0.0,"frontendQuestionId":"1973","leaf":true,"level":2,"nodeType":"def","questionId":"2126","status":"lock","submitted":121,"title":"Count Nodes Equal to Sum of Descendants","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.7376531748978834,"acs":3973,"articleLive":2,"columnArticles":56,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":0.0,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","questionId":"2088","status":"ac","submitted":5386,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.381651376146789,"acs":2912,"articleLive":2,"columnArticles":46,"formTitle":"[1975]最大方阵和","frequency":0.0,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","questionId":"2089","status":"ac","submitted":7630,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.2894966540587722,"acs":1990,"articleLive":2,"columnArticles":37,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","questionId":"2090","status":"notac","submitted":6874,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.24817518248175183,"acs":748,"articleLive":2,"columnArticles":14,"formTitle":"[1977]划分数字的方案数","frequency":0.0,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","questionId":"2091","status":"","submitted":3014,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.5313725490196078,"acs":271,"articleLive":2,"columnArticles":10,"formTitle":"[1978]Employees Whose Manager Left the Company","frequency":0.0,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","questionId":"2127","status":"lock","submitted":510,"title":"Employees Whose Manager Left the Company","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.8105161910868868,"acs":7584,"articleLive":2,"columnArticles":88,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","questionId":"2106","status":"ac","submitted":9357,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.5822231059852854,"acs":5856,"articleLive":2,"columnArticles":94,"formTitle":"[1980]找出不同的二进制字符串","frequency":0.0,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","questionId":"2107","status":"ac","submitted":10058,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.29847695655040546,"acs":4527,"articleLive":2,"columnArticles":84,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":0.0,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","questionId":"2108","status":"","submitted":15167,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.4582180409518539,"acs":828,"articleLive":2,"columnArticles":18,"formTitle":"[1982]从子集的和还原数组","frequency":0.0,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","questionId":"2109","status":"","submitted":1807,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.6582278481012658,"acs":52,"articleLive":2,"columnArticles":3,"formTitle":"[1983]Widest Pair of Indices With Equal Range Sum","frequency":0.0,"frontendQuestionId":"1983","leaf":true,"level":2,"nodeType":"def","questionId":"519","status":"lock","submitted":79,"title":"Widest Pair of Indices With Equal Range Sum","titleSlug":"widest-pair-of-indices-with-equal-range-sum"},{"acceptance":0.5809514291425145,"acs":5813,"articleLive":2,"columnArticles":65,"formTitle":"[1984]学生分数的最小差值","frequency":0.0,"frontendQuestionId":"1984","leaf":true,"level":1,"nodeType":"def","questionId":"2112","status":"ac","submitted":10006,"title":"学生分数的最小差值","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores"},{"acceptance":0.4123174786757265,"acs":5704,"articleLive":2,"columnArticles":80,"formTitle":"[1985]找出数组中的第 K 大整数","frequency":0.0,"frontendQuestionId":"1985","leaf":true,"level":2,"nodeType":"def","questionId":"2113","status":"ac","submitted":13834,"title":"找出数组中的第 K 大整数","titleSlug":"find-the-kth-largest-integer-in-the-array"},{"acceptance":0.2759782525461368,"acs":3604,"articleLive":2,"columnArticles":74,"formTitle":"[1986]完成任务的最少工作时间段","frequency":0.0,"frontendQuestionId":"1986","leaf":true,"level":2,"nodeType":"def","questionId":"2114","status":"notac","submitted":13059,"title":"完成任务的最少工作时间段","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks"},{"acceptance":0.46128822381262197,"acs":1418,"articleLive":2,"columnArticles":25,"formTitle":"[1987]不同的好子序列数目","frequency":0.0,"frontendQuestionId":"1987","leaf":true,"level":3,"nodeType":"def","questionId":"2115","status":"","submitted":3074,"title":"不同的好子序列数目","titleSlug":"number-of-unique-good-subsequences"},{"acceptance":0.6794425087108014,"acs":195,"articleLive":2,"columnArticles":5,"formTitle":"[1988]Find Cutoff Score for Each School","frequency":0.0,"frontendQuestionId":"1988","leaf":true,"level":2,"nodeType":"def","questionId":"2136","status":"lock","submitted":287,"title":"Find Cutoff Score for Each School","titleSlug":"find-cutoff-score-for-each-school"},{"acceptance":0.45555555555555555,"acs":41,"articleLive":2,"columnArticles":2,"formTitle":"[1989]Maximum Number of People That Can Be Caught in Tag","frequency":0.0,"frontendQuestionId":"1989","leaf":true,"level":2,"nodeType":"def","questionId":"1979","status":"lock","submitted":90,"title":"Maximum Number of People That Can Be Caught in Tag","titleSlug":"maximum-number-of-people-that-can-be-caught-in-tag"},{"acceptance":0.6012269938650306,"acs":196,"articleLive":2,"columnArticles":8,"formTitle":"[1990]Count the Number of Experiments","frequency":0.0,"frontendQuestionId":"1990","leaf":true,"level":1,"nodeType":"def","questionId":"2143","status":"lock","submitted":326,"title":"Count the Number of Experiments","titleSlug":"count-the-number-of-experiments"},{"acceptance":0.6601986960571251,"acs":4253,"articleLive":2,"columnArticles":58,"formTitle":"[1991]找到数组的中间位置","frequency":0.0,"frontendQuestionId":"1991","leaf":true,"level":1,"nodeType":"def","questionId":"2102","status":"ac","submitted":6442,"title":"找到数组的中间位置","titleSlug":"find-the-middle-index-in-array"},{"acceptance":0.5950463149416029,"acs":2955,"articleLive":2,"columnArticles":57,"formTitle":"[1992]找到所有的农场组","frequency":0.0,"frontendQuestionId":"1992","leaf":true,"level":2,"nodeType":"def","questionId":"2103","status":"ac","submitted":4966,"title":"找到所有的农场组","titleSlug":"find-all-groups-of-farmland"},{"acceptance":0.38546536336591586,"acs":1814,"articleLive":2,"columnArticles":42,"formTitle":"[1993]树上的操作","frequency":0.0,"frontendQuestionId":"1993","leaf":true,"level":2,"nodeType":"def","questionId":"2104","status":"","submitted":4706,"title":"树上的操作","titleSlug":"operations-on-tree"},{"acceptance":0.36390977443609024,"acs":1210,"articleLive":2,"columnArticles":36,"formTitle":"[1994]好子集的数目","frequency":0.0,"frontendQuestionId":"1994","leaf":true,"level":3,"nodeType":"def","questionId":"2105","status":"notac","submitted":3325,"title":"好子集的数目","titleSlug":"the-number-of-good-subsets"},{"acceptance":0.5525850206408492,"acs":5622,"articleLive":2,"columnArticles":47,"formTitle":"[1995]统计特殊四元组","frequency":0.0,"frontendQuestionId":"1995","leaf":true,"level":1,"nodeType":"def","questionId":"2122","status":"ac","submitted":10174,"title":"统计特殊四元组","titleSlug":"count-special-quadruplets"},{"acceptance":0.24774844320930473,"acs":4814,"articleLive":2,"columnArticles":96,"formTitle":"[1996]游戏中弱角色的数量","frequency":0.0,"frontendQuestionId":"1996","leaf":true,"level":2,"nodeType":"def","questionId":"2123","status":"ac","submitted":19431,"title":"游戏中弱角色的数量","titleSlug":"the-number-of-weak-characters-in-the-game"},{"acceptance":0.3400194111937884,"acs":2102,"articleLive":2,"columnArticles":36,"formTitle":"[1997]访问完所有房间的第一天","frequency":0.0,"frontendQuestionId":"1997","leaf":true,"level":2,"nodeType":"def","questionId":"2124","status":"notac","submitted":6182,"title":"访问完所有房间的第一天","titleSlug":"first-day-where-you-have-been-in-all-the-rooms"},{"acceptance":0.4207537429013939,"acs":1630,"articleLive":2,"columnArticles":32,"formTitle":"[1998]数组的最大公因数排序","frequency":0.0,"frontendQuestionId":"1998","leaf":true,"level":3,"nodeType":"def","questionId":"2125","status":"","submitted":3874,"title":"数组的最大公因数排序","titleSlug":"gcd-sort-of-an-array"},{"acceptance":0.6483516483516484,"acs":59,"articleLive":2,"columnArticles":6,"formTitle":"[1999]Smallest Greater Multiple Made of Two Digits","frequency":0.0,"frontendQuestionId":"1999","leaf":true,"level":2,"nodeType":"def","questionId":"2141","status":"lock","submitted":91,"title":"Smallest Greater Multiple Made of Two Digits","titleSlug":"smallest-greater-multiple-made-of-two-digits"},{"acceptance":0.7743812022356564,"acs":6789,"articleLive":2,"columnArticles":88,"formTitle":"[2000]反转单词前缀","frequency":0.0,"frontendQuestionId":"2000","leaf":true,"level":1,"nodeType":"def","questionId":"2128","status":"ac","submitted":8767,"title":"反转单词前缀","titleSlug":"reverse-prefix-of-word"},{"acceptance":0.3589325983462791,"acs":5730,"articleLive":2,"columnArticles":125,"formTitle":"[2001]可互换矩形的组数","frequency":0.0,"frontendQuestionId":"2001","leaf":true,"level":2,"nodeType":"def","questionId":"2129","status":"ac","submitted":15964,"title":"可互换矩形的组数","titleSlug":"number-of-pairs-of-interchangeable-rectangles"},{"acceptance":0.5724672806592341,"acs":3543,"articleLive":2,"columnArticles":87,"formTitle":"[2002]两个回文子序列长度的最大乘积","frequency":0.0,"frontendQuestionId":"2002","leaf":true,"level":2,"nodeType":"def","questionId":"2130","status":"","submitted":6189,"title":"两个回文子序列长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences"},{"acceptance":0.3916562889165629,"acs":1887,"articleLive":2,"columnArticles":40,"formTitle":"[2003]每棵子树内缺失的最小基因值","frequency":0.0,"frontendQuestionId":"2003","leaf":true,"level":3,"nodeType":"def","questionId":"2131","status":"","submitted":4818,"title":"每棵子树内缺失的最小基因值","titleSlug":"smallest-missing-genetic-value-in-each-subtree"},{"acceptance":0.3951612903225806,"acs":98,"articleLive":2,"columnArticles":5,"formTitle":"[2004]The Number of Seniors and Juniors to Join the Company","frequency":0.0,"frontendQuestionId":"2004","leaf":true,"level":3,"nodeType":"def","questionId":"2152","status":"lock","submitted":248,"title":"The Number of Seniors and Juniors to Join the Company","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company"},{"acceptance":0.6818181818181818,"acs":30,"articleLive":2,"columnArticles":3,"formTitle":"[2005]Subtree Removal Game with Fibonacci Tree","frequency":0.0,"frontendQuestionId":"2005","leaf":true,"level":3,"nodeType":"def","questionId":"2153","status":"lock","submitted":44,"title":"Subtree Removal Game with Fibonacci Tree","titleSlug":"subtree-removal-game-with-fibonacci-tree"},{"acceptance":0.8788919413919414,"acs":3839,"articleLive":2,"columnArticles":52,"formTitle":"[2006]差的绝对值为 K 的数对数目","frequency":0.0,"frontendQuestionId":"2006","leaf":true,"level":1,"nodeType":"def","questionId":"2116","status":"","submitted":4368,"title":"差的绝对值为 K 的数对数目","titleSlug":"count-number-of-pairs-with-absolute-difference-k"},{"acceptance":0.29929691725256896,"acs":2767,"articleLive":2,"columnArticles":51,"formTitle":"[2007]从双倍数组中还原原数组","frequency":0.0,"frontendQuestionId":"2007","leaf":true,"level":2,"nodeType":"def","questionId":"2117","status":"","submitted":9245,"title":"从双倍数组中还原原数组","titleSlug":"find-original-array-from-doubled-array"},{"acceptance":0.4190267251695253,"acs":2101,"articleLive":2,"columnArticles":39,"formTitle":"[2008]出租车的最大盈利","frequency":0.0,"frontendQuestionId":"2008","leaf":true,"level":2,"nodeType":"def","questionId":"2118","status":"","submitted":5014,"title":"出租车的最大盈利","titleSlug":"maximum-earnings-from-taxi"},{"acceptance":0.41530740276035133,"acs":1324,"articleLive":2,"columnArticles":39,"formTitle":"[2009]使数组连续的最少操作数","frequency":0.0,"frontendQuestionId":"2009","leaf":true,"level":3,"nodeType":"def","questionId":"2119","status":"","submitted":3188,"title":"使数组连续的最少操作数","titleSlug":"minimum-number-of-operations-to-make-array-continuous"},{"acceptance":0.6285714285714286,"acs":66,"articleLive":2,"columnArticles":4,"formTitle":"[2010]The Number of Seniors and Juniors to Join the Company II","frequency":0.0,"frontendQuestionId":"2010","leaf":true,"level":3,"nodeType":"def","questionId":"2158","status":"lock","submitted":105,"title":"The Number of Seniors and Juniors to Join the Company II","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company-ii"},{"acceptance":0.9040813522055792,"acs":6579,"articleLive":2,"columnArticles":57,"formTitle":"[2011]执行操作后的变量值","frequency":0.0,"frontendQuestionId":"2011","leaf":true,"level":1,"nodeType":"def","questionId":"2137","status":"ac","submitted":7277,"title":"执行操作后的变量值","titleSlug":"final-value-of-variable-after-performing-operations"},{"acceptance":0.3567917205692109,"acs":4137,"articleLive":2,"columnArticles":73,"formTitle":"[2012]数组美丽值求和","frequency":0.0,"frontendQuestionId":"2012","leaf":true,"level":2,"nodeType":"def","questionId":"2138","status":"ac","submitted":11595,"title":"数组美丽值求和","titleSlug":"sum-of-beauty-in-the-array"},{"acceptance":0.3286981539199233,"acs":2742,"articleLive":2,"columnArticles":50,"formTitle":"[2013]检测正方形","frequency":0.0,"frontendQuestionId":"2013","leaf":true,"level":2,"nodeType":"def","questionId":"2139","status":"ac","submitted":8342,"title":"检测正方形","titleSlug":"detect-squares"},{"acceptance":0.5199255121042831,"acs":1396,"articleLive":2,"columnArticles":24,"formTitle":"[2014]重复 K 次的最长子序列","frequency":0.0,"frontendQuestionId":"2014","leaf":true,"level":3,"nodeType":"def","questionId":"2140","status":"","submitted":2685,"title":"重复 K 次的最长子序列","titleSlug":"longest-subsequence-repeated-k-times"},{"acceptance":0.78,"acs":39,"articleLive":2,"columnArticles":2,"formTitle":"[2015]Average Height of Buildings in Each Segment","frequency":0.0,"frontendQuestionId":"2015","leaf":true,"level":2,"nodeType":"def","questionId":"2142","status":"lock","submitted":50,"title":"Average Height of Buildings in Each Segment","titleSlug":"average-height-of-buildings-in-each-segment"},{"acceptance":0.5518541157294213,"acs":5417,"articleLive":2,"columnArticles":70,"formTitle":"[2016]增量元素之间的最大差值","frequency":0.0,"frontendQuestionId":"2016","leaf":true,"level":1,"nodeType":"def","questionId":"2144","status":"ac","submitted":9816,"title":"增量元素之间的最大差值","titleSlug":"maximum-difference-between-increasing-elements"},{"acceptance":0.34751211791472947,"acs":3513,"articleLive":2,"columnArticles":94,"formTitle":"[2017]网格游戏","frequency":0.0,"frontendQuestionId":"2017","leaf":true,"level":2,"nodeType":"def","questionId":"2145","status":"ac","submitted":10109,"title":"网格游戏","titleSlug":"grid-game"},{"acceptance":0.410333048676345,"acs":1922,"articleLive":2,"columnArticles":49,"formTitle":"[2018]判断单词是否能放入填字游戏内","frequency":0.0,"frontendQuestionId":"2018","leaf":true,"level":2,"nodeType":"def","questionId":"2146","status":"","submitted":4684,"title":"判断单词是否能放入填字游戏内","titleSlug":"check-if-word-can-be-placed-in-crossword"},{"acceptance":0.34479305740987987,"acs":1033,"articleLive":2,"columnArticles":31,"formTitle":"[2019]解出数学表达式的学生分数","frequency":0.0,"frontendQuestionId":"2019","leaf":true,"level":3,"nodeType":"def","questionId":"2147","status":"","submitted":2996,"title":"解出数学表达式的学生分数","titleSlug":"the-score-of-students-solving-math-expression"},{"acceptance":0.8092105263157895,"acs":123,"articleLive":2,"columnArticles":6,"formTitle":"[2020]Number of Accounts That Did Not Stream","frequency":0.0,"frontendQuestionId":"2020","leaf":true,"level":2,"nodeType":"def","questionId":"2167","status":"lock","submitted":152,"title":"Number of Accounts That Did Not Stream","titleSlug":"number-of-accounts-that-did-not-stream"},{"acceptance":0.7741935483870968,"acs":48,"articleLive":2,"columnArticles":5,"formTitle":"[2021]Brightest Position on Street","frequency":0.0,"frontendQuestionId":"2021","leaf":true,"level":2,"nodeType":"def","questionId":"2075","status":"","submitted":62,"title":"Brightest Position on Street","titleSlug":"brightest-position-on-street"},{"acceptance":0.6576,"acs":2877,"articleLive":2,"columnArticles":35,"formTitle":"[2022]将一维数组转变成二维数组","frequency":0.0,"frontendQuestionId":"2022","leaf":true,"level":1,"nodeType":"def","questionId":"2132","status":"ac","submitted":4375,"title":"将一维数组转变成二维数组","titleSlug":"convert-1d-array-into-2d-array"},{"acceptance":0.7550732807215332,"acs":2679,"articleLive":2,"columnArticles":36,"formTitle":"[2023]连接后等于目标字符串的字符串对","frequency":0.0,"frontendQuestionId":"2023","leaf":true,"level":2,"nodeType":"def","questionId":"2133","status":"ac","submitted":3548,"title":"连接后等于目标字符串的字符串对","titleSlug":"number-of-pairs-of-strings-with-concatenation-equal-to-target"},{"acceptance":0.4775231379462318,"acs":2167,"articleLive":2,"columnArticles":55,"formTitle":"[2024]考试的最大困扰度","frequency":0.0,"frontendQuestionId":"2024","leaf":true,"level":2,"nodeType":"def","questionId":"2134","status":"","submitted":4538,"title":"考试的最大困扰度","titleSlug":"maximize-the-confusion-of-an-exam"},{"acceptance":0.25952327912675427,"acs":1165,"articleLive":2,"columnArticles":39,"formTitle":"[2025]分割数组的最多方案数","frequency":0.0,"frontendQuestionId":"2025","leaf":true,"level":3,"nodeType":"def","questionId":"2135","status":"","submitted":4489,"title":"分割数组的最多方案数","titleSlug":"maximum-number-of-ways-to-partition-an-array"},{"acceptance":0.9024390243902439,"acs":185,"articleLive":2,"columnArticles":9,"formTitle":"[2026]Low-Quality Problems","frequency":0.0,"frontendQuestionId":"2026","leaf":true,"level":1,"nodeType":"def","questionId":"2172","status":"","submitted":205,"title":"Low-Quality Problems","titleSlug":"low-quality-problems"},{"acceptance":0.5507246376811594,"acs":4218,"articleLive":2,"columnArticles":43,"formTitle":"[2027]转换字符串的最少操作次数","frequency":0.0,"frontendQuestionId":"2027","leaf":true,"level":1,"nodeType":"def","questionId":"2154","status":"ac","submitted":7659,"title":"转换字符串的最少操作次数","titleSlug":"minimum-moves-to-convert-string"},{"acceptance":0.42376805203395435,"acs":3844,"articleLive":2,"columnArticles":55,"formTitle":"[2028]找出缺失的观测数据","frequency":0.0,"frontendQuestionId":"2028","leaf":true,"level":2,"nodeType":"def","questionId":"2155","status":"ac","submitted":9071,"title":"找出缺失的观测数据","titleSlug":"find-missing-observations"},{"acceptance":0.22166555332888,"acs":1991,"articleLive":2,"columnArticles":67,"formTitle":"[2029]石子游戏 IX","frequency":0.0,"frontendQuestionId":"2029","leaf":true,"level":2,"nodeType":"def","questionId":"2156","status":"notac","submitted":8982,"title":"石子游戏 IX","titleSlug":"stone-game-ix"},{"acceptance":0.3430859254696643,"acs":1114,"articleLive":2,"columnArticles":38,"formTitle":"[2030]含特定字母的最小子序列","frequency":0.0,"frontendQuestionId":"2030","leaf":true,"level":3,"nodeType":"def","questionId":"2157","status":"","submitted":3247,"title":"含特定字母的最小子序列","titleSlug":"smallest-k-length-subsequence-with-occurrences-of-a-letter"},{"acceptance":0.6296296296296297,"acs":17,"articleLive":2,"columnArticles":2,"formTitle":"[2031]Count Subarrays With More Ones Than Zeros","frequency":0.0,"frontendQuestionId":"2031","leaf":true,"level":2,"nodeType":"def","questionId":"510","status":"","submitted":27,"title":"Count Subarrays With More Ones Than Zeros","titleSlug":"count-subarrays-with-more-ones-than-zeros"},{"acceptance":0.6604787493893503,"acs":5408,"articleLive":2,"columnArticles":87,"formTitle":"[2032]至少在两个数组中出现的值","frequency":0.0,"frontendQuestionId":"2032","leaf":true,"level":1,"nodeType":"def","questionId":"2159","status":"ac","submitted":8188,"title":"至少在两个数组中出现的值","titleSlug":"two-out-of-three"},{"acceptance":0.3821894268674821,"acs":3781,"articleLive":2,"columnArticles":76,"formTitle":"[2033]获取单值网格的最小操作数","frequency":0.0,"frontendQuestionId":"2033","leaf":true,"level":2,"nodeType":"def","questionId":"2160","status":"ac","submitted":9893,"title":"获取单值网格的最小操作数","titleSlug":"minimum-operations-to-make-a-uni-value-grid"},{"acceptance":0.3004016936271849,"acs":2767,"articleLive":2,"columnArticles":59,"formTitle":"[2034]股票价格波动","frequency":0.0,"frontendQuestionId":"2034","leaf":true,"level":2,"nodeType":"def","questionId":"2161","status":"ac","submitted":9211,"title":"股票价格波动","titleSlug":"stock-price-fluctuation"},{"acceptance":0.3058869548210444,"acs":1564,"articleLive":2,"columnArticles":40,"formTitle":"[2035]将数组分成两个数组并最小化数组和的差","frequency":0.0,"frontendQuestionId":"2035","leaf":true,"level":3,"nodeType":"def","questionId":"2162","status":"","submitted":5113,"title":"将数组分成两个数组并最小化数组和的差","titleSlug":"partition-array-into-two-arrays-to-minimize-sum-difference"},{"acceptance":0.46875,"acs":15,"articleLive":2,"columnArticles":3,"formTitle":"[2036]Maximum Alternating Subarray Sum","frequency":0.0,"frontendQuestionId":"2036","leaf":true,"level":2,"nodeType":"def","questionId":"512","status":"lock","submitted":32,"title":"Maximum Alternating Subarray Sum","titleSlug":"maximum-alternating-subarray-sum"},{"acceptance":0.8451929372395374,"acs":81327,"articleLive":2,"columnArticles":627,"formTitle":"[LCP 01]猜数字","frequency":0.0,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","submitted":96223,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.6913144355896298,"acs":13706,"articleLive":2,"columnArticles":237,"formTitle":"[LCP 02]分式化简","frequency":0.0,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","submitted":19826,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.21997964057789438,"acs":11237,"articleLive":2,"columnArticles":185,"formTitle":"[LCP 03]机器人大冒险","frequency":0.0,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","submitted":51082,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.37759095521090014,"acs":2605,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 04]覆盖","frequency":0.0,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","submitted":6899,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.19957578094870806,"acs":2070,"articleLive":2,"columnArticles":50,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","submitted":10372,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.8398728480879339,"acs":43859,"articleLive":2,"columnArticles":660,"formTitle":"[LCP 06]拿硬币","frequency":0.0,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"1000056","status":"","submitted":52221,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7691069991954947,"acs":39196,"articleLive":2,"columnArticles":474,"formTitle":"[LCP 07]传递信息","frequency":0.0,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"1000063","status":"ac","submitted":50963,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.2888763090857628,"acs":5103,"articleLive":2,"columnArticles":103,"formTitle":"[LCP 08]剧情触发时间","frequency":0.0,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"1000057","status":"","submitted":17665,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.27565737218343717,"acs":6594,"articleLive":2,"columnArticles":108,"formTitle":"[LCP 09]最小跳跃次数","frequency":0.0,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"1000090","status":"","submitted":23921,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.589993502274204,"acs":1816,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 10]二叉树任务调度","frequency":0.0,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"1000062","status":"","submitted":3078,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6898032557675022,"acs":6907,"articleLive":2,"columnArticles":67,"formTitle":"[LCP 11]期望个数统计","frequency":0.0,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"1000086","status":"","submitted":10013,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.41160274060318885,"acs":6428,"articleLive":2,"columnArticles":102,"formTitle":"[LCP 12]小张刷题计划","frequency":0.0,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"1000087","status":"","submitted":15617,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6121604139715394,"acs":9464,"articleLive":2,"columnArticles":84,"formTitle":"[LCP 13]寻宝","frequency":0.0,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"1000093","status":"","submitted":15460,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.21103896103896103,"acs":2730,"articleLive":2,"columnArticles":41,"formTitle":"[LCP 14]切分数组","frequency":0.0,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"1000059","status":"","submitted":12936,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5750670241286864,"acs":858,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 15]游乐园的迷宫","frequency":0.0,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"1000088","status":"","submitted":1492,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.31078331637843337,"acs":611,"articleLive":2,"columnArticles":15,"formTitle":"[LCP 16]游乐园的游览计划","frequency":0.0,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"1000085","status":"","submitted":1966,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.799097977180169,"acs":23742,"articleLive":2,"columnArticles":251,"formTitle":"[LCP 17]速算机器人","frequency":0.0,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"1000139","status":"","submitted":29711,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.2869074861065708,"acs":17553,"articleLive":2,"columnArticles":230,"formTitle":"[LCP 18]早餐组合","frequency":0.0,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"1000146","status":"ac","submitted":61180,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5162161453553918,"acs":19689,"articleLive":2,"columnArticles":205,"formTitle":"[LCP 19]秋叶收藏集","frequency":0.0,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"1000130","status":"","submitted":38141,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.3119762569832402,"acs":1787,"articleLive":2,"columnArticles":32,"formTitle":"[LCP 20]快速公交","frequency":0.0,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"1000133","status":"","submitted":5728,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.3358147229114971,"acs":812,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 21]追逐游戏","frequency":0.0,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"1000134","status":"","submitted":2418,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.3337421033073207,"acs":8981,"articleLive":2,"columnArticles":186,"formTitle":"[LCP 22]黑白方格画","frequency":0.0,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"1000140","status":"ac","submitted":26910,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.3387697444458713,"acs":2638,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 23]魔术排列","frequency":0.0,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"1000058","status":"","submitted":7787,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.28224068944290553,"acs":917,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"1000131","status":"","submitted":3249,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.33266818700114026,"acs":1167,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"1000138","status":"","submitted":3508,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.3369499698613623,"acs":559,"articleLive":2,"columnArticles":22,"formTitle":"[LCP 26]导航装置","frequency":0.0,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"1000132","status":"","submitted":1659,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.3285302593659942,"acs":1254,"articleLive":2,"columnArticles":25,"formTitle":"[LCP 27]黑盒光线反射","frequency":0.0,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"1000147","status":"","submitted":3817,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.28255151249451993,"acs":10312,"articleLive":2,"columnArticles":175,"formTitle":"[LCP 28]采购方案","frequency":0.0,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"1000215","status":"ac","submitted":36496,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.18684855356032623,"acs":5109,"articleLive":2,"columnArticles":124,"formTitle":"[LCP 29]乐团站位","frequency":0.0,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"1000216","status":"ac","submitted":27343,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.34972067039106147,"acs":5634,"articleLive":2,"columnArticles":98,"formTitle":"[LCP 30]魔塔游戏","frequency":0.0,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"1000224","status":"ac","submitted":16110,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.2528870048238562,"acs":1730,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 31]变换的迷宫","frequency":0.0,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"1000218","status":"","submitted":6841,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.40723633564280215,"acs":1058,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 32]批量处理任务","frequency":0.0,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"1000219","status":"","submitted":2598,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.21801715919923736,"acs":4574,"articleLive":2,"columnArticles":86,"formTitle":"[LCP 33]蓄水","frequency":0.0,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"1000221","status":"","submitted":20980,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.4848546868604175,"acs":2369,"articleLive":2,"columnArticles":61,"formTitle":"[LCP 34]二叉树染色","frequency":0.0,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"1000089","status":"","submitted":4886,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.39558573853989815,"acs":1165,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 35]电动车游城市","frequency":0.0,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"1000220","status":"","submitted":2945,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.2642762284196547,"acs":796,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 36]最多牌组数","frequency":0.0,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"1000222","status":"notac","submitted":3012,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.19487944320159084,"acs":784,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 37]最小矩形面积","frequency":0.0,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"1000091","status":"","submitted":4023,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5622775800711743,"acs":474,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 38]守卫城堡","frequency":0.0,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"1000223","status":"","submitted":843,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5046803958277615,"acs":3774,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 39]无人机方阵","frequency":0.0,"frontendQuestionId":"LCP 39","leaf":true,"level":1,"nodeType":"def","questionId":"1000369","status":"ac","submitted":7478,"title":"无人机方阵","titleSlug":"0jQkd0"},{"acceptance":0.23139477575160178,"acs":2817,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 40]心算挑战","frequency":0.0,"frontendQuestionId":"LCP 40","leaf":true,"level":1,"nodeType":"def","questionId":"1000368","status":"ac","submitted":12174,"title":"心算挑战","titleSlug":"uOAnQW"},{"acceptance":0.4171261758027895,"acs":1286,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 41]黑白翻转棋","frequency":0.0,"frontendQuestionId":"LCP 41","leaf":true,"level":2,"nodeType":"def","questionId":"1000370","status":"","submitted":3083,"title":"黑白翻转棋","titleSlug":"fHi6rV"},{"acceptance":0.2,"acs":1025,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 42]玩具套圈","frequency":0.0,"frontendQuestionId":"LCP 42","leaf":true,"level":3,"nodeType":"def","questionId":"1000371","status":"notac","submitted":5125,"title":"玩具套圈","titleSlug":"vFjcfV"},{"acceptance":0.3983739837398374,"acs":392,"articleLive":2,"columnArticles":17,"formTitle":"[LCP 43]十字路口的交通","frequency":0.0,"frontendQuestionId":"LCP 43","leaf":true,"level":3,"nodeType":"def","questionId":"1000367","status":"","submitted":984,"title":"十字路口的交通","titleSlug":"Y1VbOX"},{"acceptance":0.8491914253478752,"acs":2258,"articleLive":2,"columnArticles":27,"formTitle":"[LCP 44]开幕式焰火","frequency":0.0,"frontendQuestionId":"LCP 44","leaf":true,"level":1,"nodeType":"def","questionId":"1000362","status":"ac","submitted":2659,"title":"开幕式焰火","titleSlug":"sZ59z6"},{"acceptance":0.18659156976744187,"acs":1027,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 45]自行车炫技赛场","frequency":0.0,"frontendQuestionId":"LCP 45","leaf":true,"level":2,"nodeType":"def","questionId":"1000375","status":"notac","submitted":5504,"title":"自行车炫技赛场","titleSlug":"kplEvH"},{"acceptance":0.3690116529995684,"acs":855,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 46]志愿者调配","frequency":0.0,"frontendQuestionId":"LCP 46","leaf":true,"level":2,"nodeType":"def","questionId":"1000373","status":"notac","submitted":2317,"title":"志愿者调配","titleSlug":"05ZEDJ"},{"acceptance":0.35457441966317704,"acs":779,"articleLive":2,"columnArticles":14,"formTitle":"[LCP 47]入场安检","frequency":0.0,"frontendQuestionId":"LCP 47","leaf":true,"level":3,"nodeType":"def","questionId":"1000361","status":"","submitted":2197,"title":"入场安检","titleSlug":"oPs9Bm"},{"acceptance":0.1527231892195396,"acs":272,"articleLive":2,"columnArticles":9,"formTitle":"[LCP 48]无限棋局","frequency":0.0,"frontendQuestionId":"LCP 48","leaf":true,"level":3,"nodeType":"def","questionId":"1000374","status":"","submitted":1781,"title":"无限棋局","titleSlug":"fsa7oZ"},{"acceptance":0.2260940032414911,"acs":279,"articleLive":2,"columnArticles":9,"formTitle":"[LCP 49]环形闯关游戏","frequency":0.0,"frontendQuestionId":"LCP 49","leaf":true,"level":3,"nodeType":"def","questionId":"1000359","status":"","submitted":1234,"title":"环形闯关游戏","titleSlug":"K8GULz"},{"acceptance":0.5441309109650818,"acs":4223,"articleLive":2,"columnArticles":97,"formTitle":"[LCS 01]下载插件","frequency":0.0,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","questionId":"1000225","status":"","submitted":7761,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.697983870967742,"acs":3462,"articleLive":2,"columnArticles":69,"formTitle":"[LCS 02]完成一半题目","frequency":0.0,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","questionId":"1000226","status":"","submitted":4960,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.4129750665698378,"acs":1706,"articleLive":2,"columnArticles":54,"formTitle":"[LCS 03]主题空间","frequency":0.0,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","questionId":"1000227","status":"","submitted":4131,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.6784083070473282,"acs":405197,"articleLive":2,"columnArticles":2808,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"100275","status":"","submitted":597276,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.40334281378910686,"acs":264486,"articleLive":2,"columnArticles":2109,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":0.0,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"100276","status":"","submitted":655735,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.760790077993001,"acs":290882,"articleLive":2,"columnArticles":1961,"formTitle":"[剑指 Offer 05]替换空格","frequency":0.0,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"100280","status":"","submitted":382342,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7513181277445696,"acs":306939,"articleLive":2,"columnArticles":2105,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"100282","status":"ac","submitted":408534,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6980833942940746,"acs":190856,"articleLive":2,"columnArticles":1454,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"100283","status":"","submitted":273400,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7152958580671692,"acs":267869,"articleLive":2,"columnArticles":1699,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":0.0,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"100273","status":"ac","submitted":374487,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.3600760389347509,"acs":265941,"articleLive":2,"columnArticles":1864,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"100274","status":"ac","submitted":738569,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.4439638902868646,"acs":197603,"articleLive":2,"columnArticles":1324,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":0.0,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"100277","status":"","submitted":445088,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.49297699463034267,"acs":264774,"articleLive":2,"columnArticles":1644,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"100278","status":"","submitted":537092,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.45222052910830013,"acs":172424,"articleLive":2,"columnArticles":1153,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"100279","status":"","submitted":381283,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5267803741208984,"acs":178794,"articleLive":2,"columnArticles":1720,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":0.0,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"100281","status":"","submitted":339409,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.5692836229609584,"acs":159244,"articleLive":2,"columnArticles":1323,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":0.0,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"100284","status":"","submitted":279727,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.3120302989716803,"acs":83870,"articleLive":2,"columnArticles":494,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"100285","status":"","submitted":268788,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7473321397597716,"acs":200779,"articleLive":2,"columnArticles":1258,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"100292","status":"ac","submitted":268661,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.33997762912123713,"acs":125226,"articleLive":2,"columnArticles":763,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":0.0,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"100295","status":"","submitted":368336,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.7773289741786809,"acs":151454,"articleLive":2,"columnArticles":1135,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":0.0,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"100296","status":"","submitted":194839,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.5968183539174486,"acs":190733,"articleLive":2,"columnArticles":1471,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"100299","status":"ac","submitted":319583,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.3766056100336961,"acs":67171,"articleLive":2,"columnArticles":450,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":0.0,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"100297","status":"","submitted":178359,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.2421616723432178,"acs":77499,"articleLive":2,"columnArticles":864,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"100290","status":"","submitted":320030,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.6432336741430218,"acs":195846,"articleLive":2,"columnArticles":1646,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":0.0,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"100291","status":"","submitted":304471,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7981635528887677,"acs":263382,"articleLive":2,"columnArticles":2462,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"100294","status":"ac","submitted":329985,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7426706014206234,"acs":296206,"articleLive":2,"columnArticles":1849,"formTitle":"[剑指 Offer 24]反转链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"100298","status":"ac","submitted":398839,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7282277550162832,"acs":187164,"articleLive":2,"columnArticles":1195,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"100286","status":"","submitted":257013,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.4655344244452952,"acs":147141,"articleLive":2,"columnArticles":1190,"formTitle":"[剑指 Offer 26]树的子结构","frequency":0.0,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"100287","status":"","submitted":316069,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7919220101291922,"acs":193579,"articleLive":2,"columnArticles":1416,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":0.0,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"100288","status":"","submitted":244442,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5800270039740976,"acs":151644,"articleLive":2,"columnArticles":1092,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"100289","status":"","submitted":261443,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.44011000723573795,"acs":146587,"articleLive":2,"columnArticles":1489,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":0.0,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"100293","status":"","submitted":333069,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.5676470935332738,"acs":144301,"articleLive":2,"columnArticles":957,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":0.0,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"100302","status":"ac","submitted":254209,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6159644825143438,"acs":113906,"articleLive":2,"columnArticles":957,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"100306","status":"","submitted":184923,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.6442096482691506,"acs":139014,"articleLive":2,"columnArticles":964,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100311","status":"","submitted":215790,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.6865599223677826,"acs":138670,"articleLive":2,"columnArticles":1103,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100312","status":"","submitted":201978,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5887481573434712,"acs":121414,"articleLive":2,"columnArticles":1148,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"100314","status":"","submitted":206224,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.5513798129361686,"acs":114247,"articleLive":2,"columnArticles":959,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"100315","status":"","submitted":207202,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5770012103275582,"acs":134915,"articleLive":2,"columnArticles":875,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"100317","status":"","submitted":233821,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7201676004065906,"acs":121861,"articleLive":2,"columnArticles":836,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":0.0,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"100300","status":"ac","submitted":169212,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6545413956257248,"acs":105552,"articleLive":2,"columnArticles":910,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"100305","status":"","submitted":161261,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.5613189189189189,"acs":77883,"articleLive":2,"columnArticles":561,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"100307","status":"ac","submitted":138750,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5793248576463221,"acs":159122,"articleLive":2,"columnArticles":1119,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":0.0,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"100308","status":"ac","submitted":274668,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6911468526347054,"acs":169868,"articleLive":2,"columnArticles":1029,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"100310","status":"ac","submitted":245777,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.5702790704046544,"acs":249756,"articleLive":2,"columnArticles":1824,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":0.0,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"100301","status":"","submitted":437954,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5816348793658297,"acs":63981,"articleLive":2,"columnArticles":464,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":0.0,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"100303","status":"","submitted":110002,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.6053726272969713,"acs":223822,"articleLive":2,"columnArticles":1530,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":0.0,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"100304","status":"ac","submitted":369726,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.4862565188409207,"acs":49604,"articleLive":2,"columnArticles":514,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":0.0,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"100309","status":"","submitted":102012,"title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.4154446108450349,"acs":56036,"articleLive":2,"columnArticles":466,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"100313","status":"","submitted":134882,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5611845525057841,"acs":110119,"articleLive":2,"columnArticles":814,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":0.0,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"100323","status":"","submitted":196226,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.5356167475953771,"acs":121006,"articleLive":2,"columnArticles":1450,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"100325","status":"","submitted":225919,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.6888908001490783,"acs":120146,"articleLive":2,"columnArticles":1002,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":0.0,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"100327","status":"","submitted":174405,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.46470910418695227,"acs":152722,"articleLive":2,"columnArticles":1043,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"100332","status":"","submitted":328640,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.6513824123370663,"acs":88702,"articleLive":2,"columnArticles":520,"formTitle":"[剑指 Offer 49]丑数","frequency":0.0,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"100334","status":"","submitted":136175,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.6148258233265961,"acs":155139,"articleLive":2,"columnArticles":1062,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":0.0,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"100316","status":"","submitted":252330,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.48328778444575926,"acs":102920,"articleLive":2,"columnArticles":852,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":0.0,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"100318","status":"","submitted":212958,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.650183879074635,"acs":176443,"articleLive":2,"columnArticles":1051,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"100326","status":"ac","submitted":271374,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5379070971714881,"acs":192170,"articleLive":2,"columnArticles":1600,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":0.0,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100329","status":"ac","submitted":357255,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.4473115115078291,"acs":170232,"articleLive":2,"columnArticles":1485,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100331","status":"","submitted":380567,"title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.7569094200890465,"acs":163883,"articleLive":2,"columnArticles":1151,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"100333","status":"","submitted":216516,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.7899338029476924,"acs":178638,"articleLive":2,"columnArticles":1277,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":0.0,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100319","status":"","submitted":226143,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.5883478186775732,"acs":138097,"articleLive":2,"columnArticles":942,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100342","status":"","submitted":234720,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.6975393541179933,"acs":116141,"articleLive":2,"columnArticles":1040,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":0.0,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100320","status":"","submitted":166501,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.8004728049284201,"acs":91085,"articleLive":2,"columnArticles":704,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100321","status":"","submitted":113789,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.666127199476602,"acs":135415,"articleLive":2,"columnArticles":849,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"100322","status":"","submitted":203287,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7073506358655383,"acs":140332,"articleLive":2,"columnArticles":1864,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100324","status":"","submitted":198391,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.4419878309843937,"acs":130900,"articleLive":2,"columnArticles":983,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":0.0,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100328","status":"","submitted":296162,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.857727164026487,"acs":208028,"articleLive":2,"columnArticles":1807,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100330","status":"","submitted":242534,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.44423843017123815,"acs":132256,"articleLive":2,"columnArticles":1197,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"100336","status":"","submitted":297714,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.47507316732092736,"acs":95122,"articleLive":2,"columnArticles":1072,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100337","status":"ac","submitted":200226,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.5614401897950998,"acs":65789,"articleLive":2,"columnArticles":595,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":0.0,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"100339","status":"","submitted":117179,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.4597755385531277,"acs":104261,"articleLive":2,"columnArticles":989,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":0.0,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"100341","status":"","submitted":226765,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.6552557556847729,"acs":110885,"articleLive":2,"columnArticles":770,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"100343","status":"","submitted":169224,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.6340616762930849,"acs":132063,"articleLive":2,"columnArticles":957,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":0.0,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"100344","status":"","submitted":208281,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.856758291966116,"acs":138764,"articleLive":2,"columnArticles":1303,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":0.0,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"100345","status":"","submitted":161964,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.584379381042293,"acs":72113,"articleLive":2,"columnArticles":499,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":0.0,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"100335","status":"","submitted":123401,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.5979122664500406,"acs":73603,"articleLive":2,"columnArticles":531,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":0.0,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"100338","status":"","submitted":123100,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.28676919245377,"acs":69087,"articleLive":2,"columnArticles":559,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":0.0,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"100340","status":"","submitted":240915,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.6941882645293387,"acs":119004,"articleLive":2,"columnArticles":693,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":0.0,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100346","status":"","submitted":171429,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.700829826329204,"acs":118237,"articleLive":2,"columnArticles":694,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":0.0,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100347","status":"","submitted":168710,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.2047207616223854,"acs":8838,"articleLive":2,"columnArticles":111,"formTitle":"[剑指 Offer II 001]整数除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","questionId":"1000228","status":"","submitted":43171,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5722543352601156,"acs":8019,"articleLive":2,"columnArticles":128,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","questionId":"1000231","status":"","submitted":14013,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.781955472520629,"acs":10045,"articleLive":2,"columnArticles":151,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","questionId":"1000230","status":"","submitted":12846,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.68676113020877,"acs":8191,"articleLive":2,"columnArticles":97,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","questionId":"1000233","status":"","submitted":11927,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7157001414427157,"acs":6072,"articleLive":2,"columnArticles":86,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","questionId":"1000236","status":"","submitted":8484,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6653207304762778,"acs":7250,"articleLive":2,"columnArticles":97,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","questionId":"1000237","status":"","submitted":10897,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.45416395340423993,"acs":6277,"articleLive":2,"columnArticles":76,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","questionId":"1000239","status":"","submitted":13821,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.5060872369588003,"acs":6277,"articleLive":2,"columnArticles":91,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","questionId":"1000242","status":"","submitted":12403,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.5501188161589976,"acs":5093,"articleLive":2,"columnArticles":80,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","questionId":"1000244","status":"","submitted":9258,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.43575113334375487,"acs":5575,"articleLive":2,"columnArticles":66,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","questionId":"1000246","status":"","submitted":12794,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5634035522511359,"acs":4092,"articleLive":2,"columnArticles":71,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","questionId":"1000247","status":"","submitted":7263,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.661657135257348,"acs":4975,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":0.0,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","questionId":"1000248","status":"","submitted":7519,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6527434972470096,"acs":3438,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","questionId":"1000249","status":"","submitted":5267,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5028695319474557,"acs":3943,"articleLive":2,"columnArticles":69,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","questionId":"1000250","status":"","submitted":7841,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.6430900937627395,"acs":3155,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","questionId":"1000251","status":"","submitted":4906,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.5008215239268844,"acs":4877,"articleLive":2,"columnArticles":80,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","questionId":"1000252","status":"","submitted":9738,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.5183689170994422,"acs":2695,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","questionId":"1000253","status":"","submitted":5199,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5279552715654952,"acs":4627,"articleLive":2,"columnArticles":72,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","questionId":"1000254","status":"","submitted":8764,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.4742504835589942,"acs":3923,"articleLive":2,"columnArticles":68,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","questionId":"1000255","status":"","submitted":8272,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.7079839591687933,"acs":3884,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","questionId":"1000256","status":"","submitted":5486,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5381186739715851,"acs":5795,"articleLive":2,"columnArticles":76,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","questionId":"1000257","status":"","submitted":10769,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5228367251825384,"acs":6731,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","questionId":"1000258","status":"","submitted":12874,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.7026043940055289,"acs":4829,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","questionId":"1000259","status":"","submitted":6873,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7706304771178188,"acs":12663,"articleLive":2,"columnArticles":127,"formTitle":"[剑指 Offer II 024]反转链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","questionId":"1000260","status":"","submitted":16432,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6067465601420329,"acs":4101,"articleLive":2,"columnArticles":69,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":0.0,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","questionId":"1000261","status":"","submitted":6759,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.652605459057072,"acs":4471,"articleLive":2,"columnArticles":84,"formTitle":"[剑指 Offer II 026]重排链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","questionId":"1000262","status":"","submitted":6851,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6115487914055506,"acs":6831,"articleLive":2,"columnArticles":90,"formTitle":"[剑指 Offer II 027]回文链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","questionId":"1000263","status":"","submitted":11170,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6269864201097949,"acs":2170,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","questionId":"1000264","status":"","submitted":3461,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.2955763239875389,"acs":2372,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","questionId":"1000265","status":"","submitted":8025,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.5490246406570842,"acs":2139,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","questionId":"1000267","status":"","submitted":3896,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.5586652314316469,"acs":2595,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","questionId":"1000270","status":"","submitted":4645,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.6015242242787153,"acs":3315,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","questionId":"1000273","status":"","submitted":5511,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.7896634615384616,"acs":2628,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 033]变位词组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","questionId":"1000275","status":"","submitted":3328,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.5737665463297232,"acs":2384,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","questionId":"1000276","status":"","submitted":4155,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.6829470198675497,"acs":2475,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.0,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","questionId":"1000278","status":"","submitted":3624,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.585429314830876,"acs":2700,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.0,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","questionId":"1000279","status":"","submitted":4612,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.4425347481691825,"acs":2961,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","questionId":"1000281","status":"","submitted":6691,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.7829371250833148,"acs":3524,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.0,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","questionId":"1000282","status":"","submitted":4501,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.51815107102593,"acs":2298,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","questionId":"1000283","status":"","submitted":4435,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.5762206485277674,"acs":1546,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":0.0,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","questionId":"1000284","status":"","submitted":2683,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.7810636182902585,"acs":3143,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","questionId":"1000292","status":"","submitted":4024,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.8435880829015544,"acs":2605,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","questionId":"1000293","status":"","submitted":3088,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.6577311577311578,"acs":1693,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","questionId":"1000295","status":"","submitted":2574,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6468354430379747,"acs":3066,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","questionId":"1000297","status":"","submitted":4740,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.81,"acs":2916,"articleLive":2,"columnArticles":74,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","questionId":"1000298","status":"","submitted":3600,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7294457578145521,"acs":2777,"articleLive":2,"columnArticles":60,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","questionId":"1000299","status":"","submitted":3807,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.6826749289956107,"acs":2644,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":0.0,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","questionId":"1000301","status":"","submitted":3873,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.6857369884783472,"acs":1726,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","questionId":"1000304","status":"","submitted":2517,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7543344891971192,"acs":2828,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","questionId":"1000306","status":"","submitted":3749,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6199444272923742,"acs":2008,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","questionId":"1000307","status":"","submitted":3239,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.4140776699029126,"acs":1706,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","questionId":"1000309","status":"","submitted":4120,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.7434899002190314,"acs":3055,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","questionId":"1000311","status":"","submitted":4109,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6380297823596792,"acs":2785,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","questionId":"1000313","status":"","submitted":4365,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8507462686567164,"acs":2337,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","questionId":"1000315","status":"","submitted":2747,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.8925022583559169,"acs":1976,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","questionId":"1000316","status":"","submitted":2214,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7290322580645161,"acs":3164,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","questionId":"1000319","status":"","submitted":4340,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.34965800273597814,"acs":1278,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","questionId":"1000321","status":"","submitted":3655,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.6035474592521572,"acs":1259,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","questionId":"1000322","status":"","submitted":2086,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.6245410036719706,"acs":2041,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","questionId":"1000323","status":"","submitted":3268,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.6713846153846154,"acs":2182,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","questionId":"1000324","status":"","submitted":3250,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.5327510917030568,"acs":1464,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":0.0,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","questionId":"1000326","status":"","submitted":2748,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7652057245080501,"acs":1711,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","questionId":"1000325","status":"","submitted":2236,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.7255537547271745,"acs":1343,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","questionId":"1000327","status":"","submitted":1851,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.6372767857142857,"acs":1142,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","questionId":"1000328","status":"","submitted":1792,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.6342482100238663,"acs":1063,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.0,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","questionId":"1000329","status":"","submitted":1676,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6436170212765957,"acs":1089,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","questionId":"1000330","status":"","submitted":1692,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.6623728813559322,"acs":977,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","questionId":"1000331","status":"","submitted":1475,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.5093727469358328,"acs":2826,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","questionId":"1000332","status":"","submitted":5548,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7235880807749138,"acs":35259,"articleLive":2,"columnArticles":378,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":0.0,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","questionId":"1000333","status":"ac","submitted":48728,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.6603541564190851,"acs":2685,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","questionId":"1000334","status":"","submitted":4066,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.4960593416782568,"acs":1070,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","questionId":"1000335","status":"","submitted":2157,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.4212131878446556,"acs":3590,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 072]求平方根","frequency":0.0,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","questionId":"1000336","status":"","submitted":8523,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.5412932138284251,"acs":1691,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.0,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","questionId":"1000337","status":"","submitted":3124,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.5525773195876289,"acs":2412,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 074]合并区间","frequency":0.0,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","questionId":"1000338","status":"","submitted":4365,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.7103649635036496,"acs":2433,"articleLive":2,"columnArticles":60,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","questionId":"1000339","status":"","submitted":3425,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.675330667486927,"acs":4391,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","questionId":"1000340","status":"","submitted":6502,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.5876784372652141,"acs":3911,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","questionId":"1000341","status":"","submitted":6655,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6330445544554455,"acs":3069,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","questionId":"1000342","status":"","submitted":4848,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8579562481270603,"acs":2863,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 079]所有子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","questionId":"1000343","status":"","submitted":3337,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.807224474751198,"acs":2190,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","questionId":"1000344","status":"","submitted":2713,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.7800499886389457,"acs":3433,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","questionId":"1000229","status":"","submitted":4401,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.6430868167202572,"acs":2600,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","questionId":"1000232","status":"","submitted":4043,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8550408719346049,"acs":3138,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","questionId":"1000234","status":"","submitted":3670,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.677792732166891,"acs":2518,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","questionId":"1000235","status":"","submitted":3715,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8567941415785191,"acs":3159,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":0.0,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","questionId":"1000238","status":"","submitted":3687,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.769172071728348,"acs":2016,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","questionId":"1000240","status":"","submitted":2621,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6386736907344283,"acs":2061,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","questionId":"1000241","status":"","submitted":3227,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7394339622641509,"acs":3919,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":0.0,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","questionId":"1000243","status":"","submitted":5300,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.6241281322655644,"acs":2416,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","questionId":"1000245","status":"","submitted":3871,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.5142655864741106,"acs":1460,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","questionId":"1000266","status":"","submitted":2839,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7658252427184467,"acs":1972,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":0.0,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","questionId":"1000268","status":"","submitted":2575,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6824353920280333,"acs":1558,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.0,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","questionId":"1000269","status":"","submitted":2283,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5753012048192772,"acs":1337,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","questionId":"1000271","status":"","submitted":2324,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.595677385345282,"acs":1130,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.0,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","questionId":"1000272","status":"","submitted":1897,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.6630422074126038,"acs":5671,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","questionId":"1000274","status":"","submitted":8553,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.49412276882890727,"acs":1135,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":0.0,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","questionId":"1000277","status":"","submitted":2297,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5478413068844807,"acs":939,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","questionId":"1000280","status":"","submitted":1714,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.778653012997243,"acs":1977,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","questionId":"1000345","status":"","submitted":2539,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.6921866806502359,"acs":2640,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","questionId":"1000285","status":"","submitted":3814,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7389558232931727,"acs":1656,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","questionId":"1000286","status":"","submitted":2241,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.48669467787114845,"acs":2085,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 101]分割等和子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","questionId":"1000287","status":"","submitted":4284,"title":"分割等和子集","titleSlug":"NUPfPr"},{"acceptance":0.5918544194107452,"acs":1366,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","questionId":"1000288","status":"","submitted":2308,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.4947129909365559,"acs":2620,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","questionId":"1000289","status":"","submitted":5296,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5874416190970421,"acs":1132,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","questionId":"1000290","status":"","submitted":1927,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.6995285040720103,"acs":3264,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","questionId":"1000291","status":"","submitted":4666,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.5552391799544419,"acs":975,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 106]二分图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","questionId":"1000294","status":"","submitted":1756,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5451595457003786,"acs":1008,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","questionId":"1000296","status":"","submitted":1849,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.5777568331762488,"acs":613,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","questionId":"1000300","status":"","submitted":1061,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.6073033707865169,"acs":1081,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":0.0,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","questionId":"1000302","status":"","submitted":1780,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8410872974385781,"acs":1609,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","questionId":"1000303","status":"","submitted":1913,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.6992574257425742,"acs":565,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","questionId":"1000305","status":"","submitted":808,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.5624365482233502,"acs":1108,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","questionId":"1000308","status":"","submitted":1970,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.5819885476314419,"acs":1118,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","questionId":"1000310","status":"","submitted":1921,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.4250614250614251,"acs":519,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","questionId":"1000312","status":"","submitted":1221,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.29164785553047406,"acs":646,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 115]重建序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","questionId":"1000314","status":"","submitted":2215,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6358956760466712,"acs":3706,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 116]省份数量","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","questionId":"1000346","status":"","submitted":5828,"title":"省份数量","titleSlug":"bLyHh0"},{"acceptance":0.6311557788944724,"acs":628,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","questionId":"1000317","status":"","submitted":995,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.7046413502109705,"acs":835,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","questionId":"1000318","status":"","submitted":1185,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.4610421035650911,"acs":2858,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","questionId":"1000320","status":"","submitted":6199,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.7197759228817211,"acs":90198,"articleLive":2,"columnArticles":1547,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":0.0,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"100158","status":"","submitted":125314,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6477395981259295,"acs":57928,"articleLive":2,"columnArticles":1111,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":0.0,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"100159","status":"","submitted":89431,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.5792647192884213,"acs":44480,"articleLive":2,"columnArticles":493,"formTitle":"[面试题 01.03]URL化","frequency":0.0,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"100160","status":"","submitted":76787,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5512138728323699,"acs":40528,"articleLive":2,"columnArticles":778,"formTitle":"[面试题 01.04]回文排列","frequency":0.0,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"100184","status":"","submitted":73525,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.33195453013450993,"acs":32502,"articleLive":2,"columnArticles":556,"formTitle":"[面试题 01.05]一次编辑","frequency":0.0,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000006","status":"","submitted":97911,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.4718786090080842,"acs":73547,"articleLive":2,"columnArticles":1175,"formTitle":"[面试题 01.06]字符串压缩","frequency":0.0,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"100161","status":"","submitted":155860,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7529711083351479,"acs":65702,"articleLive":2,"columnArticles":962,"formTitle":"[面试题 01.07]旋转矩阵","frequency":0.0,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"100185","status":"","submitted":87257,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6216561776363455,"acs":43759,"articleLive":2,"columnArticles":490,"formTitle":"[面试题 01.08]零矩阵","frequency":0.0,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"100186","status":"","submitted":70391,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5497193864805902,"acs":33009,"articleLive":2,"columnArticles":417,"formTitle":"[面试题 01.09]字符串轮转","frequency":0.0,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"100162","status":"","submitted":60047,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.6825083217008483,"acs":63562,"articleLive":2,"columnArticles":693,"formTitle":"[面试题 02.01]移除重复节点","frequency":0.0,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"100163","status":"ac","submitted":93130,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7797027337029249,"acs":65258,"articleLive":2,"columnArticles":947,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":0.0,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","questionId":"1000007","status":"ac","submitted":83696,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.8548298638433841,"acs":71698,"articleLive":2,"columnArticles":684,"formTitle":"[面试题 02.03]删除中间节点","frequency":0.0,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"100187","status":"ac","submitted":83874,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6545721801021197,"acs":25383,"articleLive":2,"columnArticles":362,"formTitle":"[面试题 02.04]分割链表","frequency":0.0,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"1000008","status":"ac","submitted":38778,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.46642971477546286,"acs":37007,"articleLive":2,"columnArticles":524,"formTitle":"[面试题 02.05]链表求和","frequency":0.0,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"100188","status":"ac","submitted":79341,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.483385318171771,"acs":39364,"articleLive":2,"columnArticles":508,"formTitle":"[面试题 02.06]回文链表","frequency":0.0,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"100164","status":"ac","submitted":81434,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6848945457627598,"acs":48483,"articleLive":2,"columnArticles":434,"formTitle":"[面试题 02.07]链表相交","frequency":0.0,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","questionId":"100167","status":"ac","submitted":70789,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5322254616132167,"acs":27383,"articleLive":2,"columnArticles":285,"formTitle":"[面试题 02.08]环路检测","frequency":0.0,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"100168","status":"ac","submitted":51450,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5375419157311562,"acs":11061,"articleLive":2,"columnArticles":178,"formTitle":"[面试题 03.01]三合一","frequency":0.0,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"100172","status":"","submitted":20577,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6138178725012996,"acs":25978,"articleLive":2,"columnArticles":299,"formTitle":"[面试题 03.02]栈的最小值","frequency":0.0,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"100169","status":"ac","submitted":42322,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.38715037385765716,"acs":8388,"articleLive":2,"columnArticles":127,"formTitle":"[面试题 03.03]堆盘子","frequency":0.0,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"100195","status":"","submitted":21666,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7125919620599501,"acs":23440,"articleLive":2,"columnArticles":343,"formTitle":"[面试题 03.04]化栈为队","frequency":0.0,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"100170","status":"ac","submitted":32894,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5433493679382482,"acs":14571,"articleLive":2,"columnArticles":195,"formTitle":"[面试题 03.05]栈排序","frequency":0.0,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"100173","status":"","submitted":26817,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.587941878117545,"acs":10844,"articleLive":2,"columnArticles":178,"formTitle":"[面试题 03.06]动物收容所","frequency":0.0,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"100228","status":"","submitted":18444,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5316964821707287,"acs":17714,"articleLive":2,"columnArticles":245,"formTitle":"[面试题 04.01]节点间通路","frequency":0.0,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"100171","status":"","submitted":33316,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7902399015788395,"acs":34686,"articleLive":2,"columnArticles":422,"formTitle":"[面试题 04.02]最小高度树","frequency":0.0,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"100174","status":"","submitted":43893,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8064397115545866,"acs":24044,"articleLive":2,"columnArticles":523,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":0.0,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"100175","status":"","submitted":29815,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5846256991125461,"acs":33136,"articleLive":2,"columnArticles":385,"formTitle":"[面试题 04.04]检查平衡性","frequency":0.0,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"100176","status":"","submitted":56679,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.3516540980899433,"acs":25554,"articleLive":2,"columnArticles":323,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":0.0,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"100177","status":"","submitted":72668,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5905880974008849,"acs":20155,"articleLive":2,"columnArticles":241,"formTitle":"[面试题 04.06]后继者","frequency":0.0,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"100178","status":"","submitted":34127,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7168429617575265,"acs":16739,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 04.08]首个共同祖先","frequency":0.0,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"100179","status":"","submitted":23351,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.47620746236712563,"acs":6675,"articleLive":2,"columnArticles":110,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":0.0,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"1000010","status":"","submitted":14017,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.716540626099191,"acs":16297,"articleLive":2,"columnArticles":254,"formTitle":"[面试题 04.10]检查子树","frequency":0.0,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"100229","status":"","submitted":22744,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.4862974082132922,"acs":17656,"articleLive":2,"columnArticles":258,"formTitle":"[面试题 04.12]求和路径","frequency":0.0,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"1000009","status":"","submitted":36307,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5047669773635153,"acs":9477,"articleLive":2,"columnArticles":185,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"100180","status":"","submitted":18775,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6898643825838686,"acs":7732,"articleLive":2,"columnArticles":126,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":0.0,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"100203","status":"","submitted":11208,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.3867623038136496,"acs":10892,"articleLive":2,"columnArticles":233,"formTitle":"[面试题 05.03]翻转数位","frequency":0.0,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"100230","status":"","submitted":28162,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.3858577040593627,"acs":5304,"articleLive":2,"columnArticles":137,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"100183","status":"","submitted":13746,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.5271692488368942,"acs":11671,"articleLive":2,"columnArticles":229,"formTitle":"[面试题 05.06]整数转换","frequency":0.0,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"100181","status":"","submitted":22139,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.704064039408867,"acs":11434,"articleLive":2,"columnArticles":204,"formTitle":"[面试题 05.07]配对交换","frequency":0.0,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"100182","status":"","submitted":16240,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5533965490439919,"acs":3560,"articleLive":2,"columnArticles":71,"formTitle":"[面试题 05.08]绘制直线","frequency":0.0,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"100196","status":"","submitted":6433,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.36327260704809217,"acs":42852,"articleLive":2,"columnArticles":475,"formTitle":"[面试题 08.01]三步问题","frequency":0.0,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"100197","status":"","submitted":117961,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.3608628117581548,"acs":12313,"articleLive":2,"columnArticles":198,"formTitle":"[面试题 08.02]迷路的机器人","frequency":0.0,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000011","status":"","submitted":34121,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6758389523326968,"acs":52020,"articleLive":2,"columnArticles":434,"formTitle":"[面试题 08.03]魔术索引","frequency":0.0,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"100240","status":"","submitted":76971,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.8198573822234345,"acs":21040,"articleLive":2,"columnArticles":330,"formTitle":"[面试题 08.04]幂集","frequency":0.0,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"100198","status":"","submitted":25663,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.6791877856898535,"acs":21842,"articleLive":2,"columnArticles":489,"formTitle":"[面试题 08.05]递归乘法","frequency":0.0,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"100199","status":"","submitted":32159,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6563217134739373,"acs":24024,"articleLive":2,"columnArticles":267,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":0.0,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"1000015","status":"","submitted":36604,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.8133343389395882,"acs":21568,"articleLive":2,"columnArticles":316,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":0.0,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"100241","status":"","submitted":26518,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.7184976118106817,"acs":16547,"articleLive":2,"columnArticles":238,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":0.0,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"100348","status":"ac","submitted":23030,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8133095794826114,"acs":21913,"articleLive":2,"columnArticles":349,"formTitle":"[面试题 08.09]括号","frequency":0.0,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"100200","status":"","submitted":26943,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5583472013638024,"acs":13756,"articleLive":2,"columnArticles":218,"formTitle":"[面试题 08.10]颜色填充","frequency":0.0,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"100201","status":"","submitted":24637,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.4946948833164227,"acs":34129,"articleLive":2,"columnArticles":328,"formTitle":"[面试题 08.11]硬币","frequency":0.0,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"100231","status":"","submitted":68990,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.7608991208193601,"acs":16790,"articleLive":2,"columnArticles":297,"formTitle":"[面试题 08.12]八皇后","frequency":0.0,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"100233","status":"","submitted":22066,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5014590020426029,"acs":6874,"articleLive":2,"columnArticles":89,"formTitle":"[面试题 08.13]堆箱子","frequency":0.0,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"100202","status":"","submitted":13708,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5337250894225856,"acs":4178,"articleLive":2,"columnArticles":75,"formTitle":"[面试题 08.14]布尔运算","frequency":0.0,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000031","status":"ac","submitted":7828,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.5549129559797581,"acs":56802,"articleLive":2,"columnArticles":2374,"formTitle":"[面试题 10.01]合并排序的数组","frequency":0.0,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000012","status":"","submitted":102362,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7396740866971988,"acs":34724,"articleLive":2,"columnArticles":427,"formTitle":"[面试题 10.02]变位词组","frequency":0.0,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000040","status":"ac","submitted":46945,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.3948556492812166,"acs":13294,"articleLive":2,"columnArticles":208,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":0.0,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"100232","status":"","submitted":33668,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.553679542935107,"acs":19479,"articleLive":2,"columnArticles":256,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":0.0,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"100242","status":"","submitted":35181,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.4549064688055178,"acs":13059,"articleLive":2,"columnArticles":175,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":0.0,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000016","status":"","submitted":28707,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6235909822866345,"acs":4647,"articleLive":2,"columnArticles":86,"formTitle":"[面试题 10.10]数字流的秩","frequency":0.0,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"1000041","status":"","submitted":7452,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6674416602083871,"acs":7751,"articleLive":2,"columnArticles":96,"formTitle":"[面试题 10.11]峰与谷","frequency":0.0,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000013","status":"","submitted":11613,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8318055782091013,"acs":25499,"articleLive":2,"columnArticles":406,"formTitle":"[面试题 16.01]交换数字","frequency":0.0,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"100258","status":"","submitted":30655,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7659782664675284,"acs":14873,"articleLive":2,"columnArticles":195,"formTitle":"[面试题 16.02]单词频率","frequency":0.0,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"100259","status":"","submitted":19417,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.44206502717141016,"acs":9599,"articleLive":2,"columnArticles":233,"formTitle":"[面试题 16.03]交点","frequency":0.0,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"100260","status":"","submitted":21714,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.4600114525672838,"acs":7230,"articleLive":2,"columnArticles":160,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"100261","status":"","submitted":15717,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.4641037715655636,"acs":10841,"articleLive":2,"columnArticles":128,"formTitle":"[面试题 16.05]阶乘尾数","frequency":0.0,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"1000017","status":"","submitted":23359,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.4243580048005787,"acs":12906,"articleLive":2,"columnArticles":189,"formTitle":"[面试题 16.06]最小差","frequency":0.0,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"100262","status":"","submitted":30413,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7329883859440143,"acs":19691,"articleLive":2,"columnArticles":290,"formTitle":"[面试题 16.07]最大数值","frequency":0.0,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"100349","status":"","submitted":26864,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.37338082901554404,"acs":2306,"articleLive":2,"columnArticles":64,"formTitle":"[面试题 16.08]整数的英语表示","frequency":0.0,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"1000018","status":"","submitted":6176,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5477626948215184,"acs":2179,"articleLive":2,"columnArticles":39,"formTitle":"[面试题 16.09]运算","frequency":0.0,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"100350","status":"","submitted":3978,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6802903478943239,"acs":10403,"articleLive":2,"columnArticles":195,"formTitle":"[面试题 16.10]生存人数","frequency":0.0,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"100351","status":"","submitted":15292,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.4410600539987942,"acs":50478,"articleLive":2,"columnArticles":584,"formTitle":"[面试题 16.11]跳水板","frequency":0.0,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"100352","status":"","submitted":114447,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.4297145328719723,"acs":1987,"articleLive":2,"columnArticles":54,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"100353","status":"","submitted":4624,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.5494974109046604,"acs":3608,"articleLive":2,"columnArticles":61,"formTitle":"[面试题 16.14]最佳直线","frequency":0.0,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"100354","status":"","submitted":6566,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.5031513190919739,"acs":9021,"articleLive":2,"columnArticles":227,"formTitle":"[面试题 16.15]珠玑妙算","frequency":0.0,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"100355","status":"","submitted":17929,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.45362161510162236,"acs":15043,"articleLive":2,"columnArticles":212,"formTitle":"[面试题 16.16]部分排序","frequency":0.0,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"100356","status":"","submitted":33162,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.6005853624744554,"acs":34679,"articleLive":2,"columnArticles":376,"formTitle":"[面试题 16.17]连续数列","frequency":0.0,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"1000003","status":"","submitted":57742,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.34407531456504026,"acs":15204,"articleLive":2,"columnArticles":314,"formTitle":"[面试题 16.18]模式匹配","frequency":0.0,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000004","status":"","submitted":44188,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.6112903225806452,"acs":20466,"articleLive":2,"columnArticles":362,"formTitle":"[面试题 16.19]水域大小","frequency":0.0,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"1000005","status":"","submitted":33480,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7219603381014305,"acs":8883,"articleLive":2,"columnArticles":174,"formTitle":"[面试题 16.20]T9键盘","frequency":0.0,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"1000047","status":"","submitted":12304,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.46495270434149893,"acs":9585,"articleLive":2,"columnArticles":179,"formTitle":"[面试题 16.21]交换和","frequency":0.0,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"1000048","status":"","submitted":20615,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5842385516506923,"acs":2743,"articleLive":2,"columnArticles":60,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":0.0,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000050","status":"","submitted":4695,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.47219448665074887,"acs":10877,"articleLive":2,"columnArticles":164,"formTitle":"[面试题 16.24]数对和","frequency":0.0,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"1000042","status":"","submitted":23035,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5457675412560845,"acs":32179,"articleLive":2,"columnArticles":259,"formTitle":"[面试题 16.25]LRU 缓存","frequency":0.0,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"1000026","status":"","submitted":58961,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.38801595056381544,"acs":14693,"articleLive":2,"columnArticles":206,"formTitle":"[面试题 16.26]计算器","frequency":0.0,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"1000027","status":"","submitted":37867,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.597002619070715,"acs":12309,"articleLive":2,"columnArticles":172,"formTitle":"[面试题 17.01]不用加号的加法","frequency":0.0,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000025","status":"","submitted":20618,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6421795570079883,"acs":28297,"articleLive":2,"columnArticles":458,"formTitle":"[面试题 17.04]消失的数字","frequency":0.0,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"1000032","status":"","submitted":44064,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.38757125765359984,"acs":5507,"articleLive":2,"columnArticles":96,"formTitle":"[面试题 17.05] 字母与数字","frequency":0.0,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000033","status":"","submitted":14209,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.4496984780319709,"acs":4698,"articleLive":2,"columnArticles":110,"formTitle":"[面试题 17.06]2出现的次数","frequency":0.0,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","questionId":"1000034","status":"","submitted":10447,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.4121263315969778,"acs":8782,"articleLive":2,"columnArticles":217,"formTitle":"[面试题 17.07]婴儿名字","frequency":0.0,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"1000035","status":"","submitted":21309,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.2716009235472017,"acs":8352,"articleLive":2,"columnArticles":123,"formTitle":"[面试题 17.08]马戏团人塔","frequency":0.0,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"1000036","status":"","submitted":30751,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5487261022996083,"acs":14150,"articleLive":2,"columnArticles":148,"formTitle":"[面试题 17.09]第 k 个数","frequency":0.0,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000037","status":"","submitted":25787,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5705203592916432,"acs":66946,"articleLive":2,"columnArticles":928,"formTitle":"[面试题 17.10]主要元素","frequency":0.0,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"1000038","status":"ac","submitted":117342,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6869729985788726,"acs":14502,"articleLive":2,"columnArticles":263,"formTitle":"[面试题 17.11]单词距离","frequency":0.0,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000039","status":"","submitted":21110,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.6322005739314303,"acs":20929,"articleLive":2,"columnArticles":292,"formTitle":"[面试题 17.12]BiNode","frequency":0.0,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"1000019","status":"","submitted":33105,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5526463269743773,"acs":24653,"articleLive":2,"columnArticles":271,"formTitle":"[面试题 17.13]恢复空格","frequency":0.0,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"1000020","status":"","submitted":44609,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5970141188640066,"acs":77339,"articleLive":2,"columnArticles":760,"formTitle":"[面试题 17.14]最小K个数","frequency":0.0,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000021","status":"ac","submitted":129543,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.40293615568453395,"acs":5901,"articleLive":2,"columnArticles":121,"formTitle":"[面试题 17.15]最长单词","frequency":0.0,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"1000022","status":"","submitted":14645,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5184861840989998,"acs":61171,"articleLive":2,"columnArticles":1140,"formTitle":"[面试题 17.16]按摩师","frequency":0.0,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"1000023","status":"","submitted":117980,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.4451879112300658,"acs":7984,"articleLive":2,"columnArticles":181,"formTitle":"[面试题 17.17]多次搜索","frequency":0.0,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"1000024","status":"","submitted":17934,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.4457853580444554,"acs":7240,"articleLive":2,"columnArticles":120,"formTitle":"[面试题 17.18]最短超串","frequency":0.0,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000043","status":"","submitted":16241,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5788001864305213,"acs":8693,"articleLive":2,"columnArticles":182,"formTitle":"[面试题 17.19]消失的两个数字","frequency":0.0,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"1000044","status":"","submitted":15019,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5708472605725912,"acs":3928,"articleLive":2,"columnArticles":69,"formTitle":"[面试题 17.20]连续中值","frequency":0.0,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"1000028","status":"","submitted":6881,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.6359005180160843,"acs":44438,"articleLive":2,"columnArticles":537,"formTitle":"[面试题 17.21]直方图的水量","frequency":0.0,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"1000029","status":"","submitted":69882,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.37520584385424144,"acs":8886,"articleLive":2,"columnArticles":154,"formTitle":"[面试题 17.22]单词转换","frequency":0.0,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000030","status":"","submitted":23683,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.37850157467263384,"acs":4567,"articleLive":2,"columnArticles":101,"formTitle":"[面试题 17.23]最大黑方阵","frequency":0.0,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"1000045","status":"","submitted":12066,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5246551148026158,"acs":10991,"articleLive":2,"columnArticles":120,"formTitle":"[面试题 17.24]最大子矩阵","frequency":0.0,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"1000046","status":"","submitted":20949,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.502066772655008,"acs":1579,"articleLive":2,"columnArticles":39,"formTitle":"[面试题 17.25]单词矩阵","frequency":0.0,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"1000049","status":"","submitted":3145,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.34291581108829566,"acs":3507,"articleLive":2,"columnArticles":56,"formTitle":"[面试题 17.26]稀疏相似度","frequency":0.0,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"1000051","status":"","submitted":10227,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}]
\ No newline at end of file
+[{"acceptance":0.7487302860197808,"acs":154055,"articleLive":2,"columnArticles":1043,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":0.0,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"ac","submitted":205755,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5210338353454194,"acs":2580889,"articleLive":2,"columnArticles":14472,"formTitle":"[1]两数之和","frequency":0.0,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"ac","submitted":4953400,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.4093437826133215,"acs":1027256,"articleLive":2,"columnArticles":7289,"formTitle":"[2]两数相加","frequency":0.0,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"ac","submitted":2509519,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.38118850183073694,"acs":1276051,"articleLive":2,"columnArticles":7620,"formTitle":"[3]无重复字符的最长子串","frequency":0.0,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"ac","submitted":3347559,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.40907583316672325,"acs":527887,"articleLive":2,"columnArticles":3929,"formTitle":"[4]寻找两个正序数组的中位数","frequency":0.0,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"ac","submitted":1290438,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.3556610543281631,"acs":757329,"articleLive":2,"columnArticles":4098,"formTitle":"[5]最长回文子串","frequency":0.0,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"ac","submitted":2129356,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5074905785820583,"acs":310670,"articleLive":2,"columnArticles":2519,"formTitle":"[6]Z 字形变换","frequency":0.0,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"ac","submitted":612169,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.3523337981605377,"acs":854506,"articleLive":2,"columnArticles":5380,"formTitle":"[7]整数反转","frequency":0.0,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","questionId":"7","status":"ac","submitted":2425274,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.21729519452200585,"acs":355257,"articleLive":2,"columnArticles":2731,"formTitle":"[8]字符串转换整数 (atoi)","frequency":0.0,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","submitted":1634905,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5834554173048749,"acs":787362,"articleLive":2,"columnArticles":5010,"formTitle":"[9]回文数","frequency":0.0,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","submitted":1349481,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.31599894191890565,"acs":209057,"articleLive":2,"columnArticles":1257,"formTitle":"[10]正则表达式匹配","frequency":0.0,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"ac","submitted":661575,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.6269434135542922,"acs":548862,"articleLive":2,"columnArticles":3112,"formTitle":"[11]盛最多水的容器","frequency":0.0,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"ac","submitted":875457,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.6646889721535257,"acs":231680,"articleLive":2,"columnArticles":1809,"formTitle":"[12]整数转罗马数字","frequency":0.0,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"ac","submitted":348554,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.6317706377870729,"acs":477889,"articleLive":2,"columnArticles":3959,"formTitle":"[13]罗马数字转整数","frequency":0.0,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"ac","submitted":756428,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.4104523769722376,"acs":638393,"articleLive":2,"columnArticles":3989,"formTitle":"[14]最长公共前缀","frequency":0.0,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"","submitted":1555340,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.33704174671408565,"acs":675614,"articleLive":2,"columnArticles":3195,"formTitle":"[15]三数之和","frequency":0.0,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"ac","submitted":2004541,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.4590923821606862,"acs":266325,"articleLive":2,"columnArticles":1460,"formTitle":"[16]最接近的三数之和","frequency":0.0,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","submitted":580112,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.5733234543508685,"acs":348208,"articleLive":2,"columnArticles":3136,"formTitle":"[17]电话号码的字母组合","frequency":0.0,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"ac","submitted":607350,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.3981212248911364,"acs":226738,"articleLive":2,"columnArticles":1559,"formTitle":"[18]四数之和","frequency":0.0,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"ac","submitted":569520,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.42987784505571563,"acs":533956,"articleLive":2,"columnArticles":3988,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":0.0,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"ac","submitted":1242111,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.4451183036284071,"acs":802129,"articleLive":2,"columnArticles":5680,"formTitle":"[20]有效的括号","frequency":0.0,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"ac","submitted":1802058,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6676105540628118,"acs":733469,"articleLive":2,"columnArticles":3552,"formTitle":"[21]合并两个有序链表","frequency":0.0,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"ac","submitted":1098648,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.7726443951555817,"acs":360196,"articleLive":2,"columnArticles":2704,"formTitle":"[22]括号生成","frequency":0.0,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"ac","submitted":466186,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5601384022689117,"acs":333973,"articleLive":2,"columnArticles":2158,"formTitle":"[23]合并K个升序链表","frequency":0.0,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"ac","submitted":596233,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7034369117943975,"acs":324015,"articleLive":2,"columnArticles":2567,"formTitle":"[24]两两交换链表中的节点","frequency":0.0,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"ac","submitted":460617,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6578229018690287,"acs":236165,"articleLive":2,"columnArticles":2240,"formTitle":"[25]K 个一组翻转链表","frequency":0.0,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"ac","submitted":359010,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5387016690017944,"acs":832808,"articleLive":2,"columnArticles":4627,"formTitle":"[26]删除有序数组中的重复项","frequency":0.0,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"ac","submitted":1545954,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.597062126426372,"acs":494457,"articleLive":2,"columnArticles":4170,"formTitle":"[27]移除元素","frequency":0.0,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"ac","submitted":828150,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.40542988029248334,"acs":480389,"articleLive":2,"columnArticles":3292,"formTitle":"[28]实现 strStr()","frequency":0.0,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"ac","submitted":1184888,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.2197828294822368,"acs":130491,"articleLive":2,"columnArticles":1040,"formTitle":"[29]两数相除","frequency":0.0,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"ac","submitted":593727,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.35928022198596266,"acs":81442,"articleLive":2,"columnArticles":604,"formTitle":"[30]串联所有单词的子串","frequency":0.0,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"notac","submitted":226681,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.37312191071751677,"acs":220649,"articleLive":2,"columnArticles":1784,"formTitle":"[31]下一个排列","frequency":0.0,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"ac","submitted":591359,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.35681629601261955,"acs":195662,"articleLive":2,"columnArticles":1320,"formTitle":"[32]最长有效括号","frequency":0.0,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","submitted":548355,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.4280020724562592,"acs":375865,"articleLive":2,"columnArticles":2482,"formTitle":"[33]搜索旋转排序数组","frequency":0.0,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"ac","submitted":878185,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.4233991395948117,"acs":353421,"articleLive":2,"columnArticles":3381,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":0.0,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"ac","submitted":834723,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.46281565961179955,"acs":527552,"articleLive":2,"columnArticles":4044,"formTitle":"[35]搜索插入位置","frequency":0.0,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"ac","submitted":1139875,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.640207854109019,"acs":208460,"articleLive":2,"columnArticles":1473,"formTitle":"[36]有效的数独","frequency":0.0,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"ac","submitted":325613,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6709429746214656,"acs":103291,"articleLive":2,"columnArticles":877,"formTitle":"[37]解数独","frequency":0.0,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","submitted":153949,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.5958093776062232,"acs":242184,"articleLive":2,"columnArticles":2597,"formTitle":"[38]外观数列","frequency":0.0,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","questionId":"38","status":"ac","submitted":406479,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.7277293281994851,"acs":344550,"articleLive":2,"columnArticles":2001,"formTitle":"[39]组合总和","frequency":0.0,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"ac","submitted":473459,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.6217295906786714,"acs":205435,"articleLive":2,"columnArticles":1427,"formTitle":"[40]组合总和 II","frequency":0.0,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"ac","submitted":330425,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.4197784916430486,"acs":168701,"articleLive":2,"columnArticles":1442,"formTitle":"[41]缺失的第一个正数","frequency":0.0,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"ac","submitted":401881,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5825414403180942,"acs":334038,"articleLive":2,"columnArticles":2483,"formTitle":"[42]接雨水","frequency":0.0,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"ac","submitted":573415,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.4491182986952217,"acs":173723,"articleLive":2,"columnArticles":1170,"formTitle":"[43]字符串相乘","frequency":0.0,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"ac","submitted":386809,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.3282885431400283,"acs":85877,"articleLive":2,"columnArticles":559,"formTitle":"[44]通配符匹配","frequency":0.0,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","submitted":261590,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.43070335737675264,"acs":209529,"articleLive":2,"columnArticles":1677,"formTitle":"[45]跳跃游戏 II","frequency":0.0,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"ac","submitted":486481,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7832430133987135,"acs":432871,"articleLive":2,"columnArticles":2765,"formTitle":"[46]全排列","frequency":0.0,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"ac","submitted":552665,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6383703639539752,"acs":221090,"articleLive":2,"columnArticles":1520,"formTitle":"[47]全排列 II","frequency":0.0,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"ac","submitted":346335,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7352914621798882,"acs":228033,"articleLive":2,"columnArticles":1914,"formTitle":"[48]旋转图像","frequency":0.0,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"ac","submitted":310126,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6655955453243184,"acs":238825,"articleLive":2,"columnArticles":1349,"formTitle":"[49]字母异位词分组","frequency":0.0,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"ac","submitted":358814,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.3763975640755517,"acs":221519,"articleLive":2,"columnArticles":1313,"formTitle":"[50]Pow(x, n)","frequency":0.0,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"ac","submitted":588524,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7388590876094765,"acs":156746,"articleLive":2,"columnArticles":1570,"formTitle":"[51]N 皇后","frequency":0.0,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"ac","submitted":212146,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.8222828229727954,"acs":75081,"articleLive":2,"columnArticles":621,"formTitle":"[52]N皇后 II","frequency":0.0,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","submitted":91308,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.5528989660522987,"acs":705169,"articleLive":2,"columnArticles":3875,"formTitle":"[53]最大子序和","frequency":0.0,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"ac","submitted":1275403,"title":"最大子序和","titleSlug":"maximum-subarray"},{"acceptance":0.48172267494438203,"acs":193363,"articleLive":2,"columnArticles":2044,"formTitle":"[54]螺旋矩阵","frequency":0.0,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","submitted":401399,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.43271108677007014,"acs":334998,"articleLive":2,"columnArticles":2573,"formTitle":"[55]跳跃游戏","frequency":0.0,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"ac","submitted":774184,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.4702170697557168,"acs":309637,"articleLive":2,"columnArticles":2377,"formTitle":"[56]合并区间","frequency":0.0,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"ac","submitted":658498,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.4116553761452428,"acs":87930,"articleLive":2,"columnArticles":941,"formTitle":"[57]插入区间","frequency":0.0,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","submitted":213601,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.37722340306521984,"acs":252900,"articleLive":2,"columnArticles":2716,"formTitle":"[58]最后一个单词的长度","frequency":0.0,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"ac","submitted":670425,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.789476869447336,"acs":130450,"articleLive":2,"columnArticles":1605,"formTitle":"[59]螺旋矩阵 II","frequency":0.0,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","submitted":165236,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5243904542344818,"acs":91213,"articleLive":2,"columnArticles":967,"formTitle":"[60]排列序列","frequency":0.0,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","submitted":173941,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.4176161444538837,"acs":200566,"articleLive":2,"columnArticles":2037,"formTitle":"[61]旋转链表","frequency":0.0,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"ac","submitted":480264,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.66257144625797,"acs":321102,"articleLive":2,"columnArticles":2475,"formTitle":"[62]不同路径","frequency":0.0,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"ac","submitted":484630,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.3922026033467989,"acs":186117,"articleLive":2,"columnArticles":1755,"formTitle":"[63]不同路径 II","frequency":0.0,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","submitted":474543,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6883517155940756,"acs":274483,"articleLive":2,"columnArticles":2118,"formTitle":"[64]最小路径和","frequency":0.0,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"ac","submitted":398754,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.2696843916153353,"acs":46715,"articleLive":2,"columnArticles":648,"formTitle":"[65]有效数字","frequency":0.0,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"ac","submitted":173221,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.4570697064440178,"acs":357583,"articleLive":2,"columnArticles":3230,"formTitle":"[66]加一","frequency":0.0,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"ac","submitted":782338,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5427217488303765,"acs":198018,"articleLive":2,"columnArticles":1810,"formTitle":"[67]二进制求和","frequency":0.0,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","submitted":364861,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.5242914701392996,"acs":38127,"articleLive":2,"columnArticles":577,"formTitle":"[68]文本左右对齐","frequency":0.0,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"ac","submitted":72721,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.3919032976438608,"acs":395606,"articleLive":2,"columnArticles":1984,"formTitle":"[69]Sqrt(x)","frequency":0.0,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","submitted":1009448,"title":"Sqrt(x)","titleSlug":"sqrtx"},{"acceptance":0.5304141990531565,"acs":589322,"articleLive":2,"columnArticles":3664,"formTitle":"[70]爬楼梯","frequency":0.0,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"ac","submitted":1111060,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.4218073043969328,"acs":95606,"articleLive":2,"columnArticles":839,"formTitle":"[71]简化路径","frequency":0.0,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"ac","submitted":226658,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6141776198330244,"acs":180602,"articleLive":2,"columnArticles":1259,"formTitle":"[72]编辑距离","frequency":0.0,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"ac","submitted":294055,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6047623915971392,"acs":136054,"articleLive":2,"columnArticles":999,"formTitle":"[73]矩阵置零","frequency":0.0,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"ac","submitted":224971,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.4617515550803736,"acs":173185,"articleLive":2,"columnArticles":1732,"formTitle":"[74]搜索二维矩阵","frequency":0.0,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"ac","submitted":375061,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5966540940930544,"acs":275724,"articleLive":2,"columnArticles":1897,"formTitle":"[75]颜色分类","frequency":0.0,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","submitted":462117,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.42733985169748445,"acs":190297,"articleLive":2,"columnArticles":1296,"formTitle":"[76]最小覆盖子串","frequency":0.0,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","submitted":445306,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.7701022832726568,"acs":226551,"articleLive":2,"columnArticles":1328,"formTitle":"[77]组合","frequency":0.0,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"ac","submitted":294183,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8015860873752562,"acs":319606,"articleLive":2,"columnArticles":2085,"formTitle":"[78]子集","frequency":0.0,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"ac","submitted":398717,"title":"子集","titleSlug":"subsets"},{"acceptance":0.458722752336514,"acs":229360,"articleLive":2,"columnArticles":1443,"formTitle":"[79]单词搜索","frequency":0.0,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"ac","submitted":499997,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6169244356809827,"acs":150181,"articleLive":2,"columnArticles":1342,"formTitle":"[80]删除有序数组中的重复项 II","frequency":0.0,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"ac","submitted":243435,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.4149361219355793,"acs":126180,"articleLive":2,"columnArticles":1005,"formTitle":"[81]搜索旋转排序数组 II","frequency":0.0,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"ac","submitted":304095,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.530859789002174,"acs":185828,"articleLive":2,"columnArticles":1714,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":0.0,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"ac","submitted":350051,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.5384391515913483,"acs":323771,"articleLive":2,"columnArticles":1974,"formTitle":"[83]删除排序链表中的重复元素","frequency":0.0,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"ac","submitted":601314,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.43347652447453344,"acs":186580,"articleLive":2,"columnArticles":1186,"formTitle":"[84]柱状图中最大的矩形","frequency":0.0,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"ac","submitted":430427,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.515819308572376,"acs":99549,"articleLive":2,"columnArticles":701,"formTitle":"[85]最大矩形","frequency":0.0,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"ac","submitted":192992,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.632631392673863,"acs":121550,"articleLive":2,"columnArticles":1121,"formTitle":"[86]分隔链表","frequency":0.0,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"ac","submitted":192134,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.4867181896013143,"acs":42069,"articleLive":2,"columnArticles":314,"formTitle":"[87]扰乱字符串","frequency":0.0,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"ac","submitted":86434,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.5174873983004098,"acs":477482,"articleLive":2,"columnArticles":3338,"formTitle":"[88]合并两个有序数组","frequency":0.0,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"ac","submitted":922693,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7100725737596053,"acs":59879,"articleLive":2,"columnArticles":488,"formTitle":"[89]格雷编码","frequency":0.0,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"ac","submitted":84328,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6337220785750197,"acs":141173,"articleLive":2,"columnArticles":1243,"formTitle":"[90]子集 II","frequency":0.0,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"ac","submitted":222768,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.30988660326764084,"acs":166644,"articleLive":2,"columnArticles":1543,"formTitle":"[91]解码方法","frequency":0.0,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"ac","submitted":537758,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5490854276449129,"acs":216735,"articleLive":2,"columnArticles":2062,"formTitle":"[92]反转链表 II","frequency":0.0,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"ac","submitted":394720,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5412713325555705,"acs":157281,"articleLive":2,"columnArticles":1359,"formTitle":"[93]复原 IP 地址","frequency":0.0,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"ac","submitted":290577,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.755736388905595,"acs":578028,"articleLive":2,"columnArticles":2363,"formTitle":"[94]二叉树的中序遍历","frequency":0.0,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","questionId":"94","status":"ac","submitted":764854,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.7026413224505527,"acs":102098,"articleLive":2,"columnArticles":637,"formTitle":"[95]不同的二叉搜索树 II","frequency":0.0,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","submitted":145306,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.6995283315514748,"acs":166848,"articleLive":2,"columnArticles":1317,"formTitle":"[96]不同的二叉搜索树","frequency":0.0,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","submitted":238515,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.4558417796880899,"acs":62784,"articleLive":2,"columnArticles":556,"formTitle":"[97]交错字符串","frequency":0.0,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","submitted":137732,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.35048574342793126,"acs":356335,"articleLive":2,"columnArticles":1977,"formTitle":"[98]验证二叉搜索树","frequency":0.0,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"ac","submitted":1016689,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6114091709279906,"acs":72935,"articleLive":2,"columnArticles":599,"formTitle":"[99]恢复二叉搜索树","frequency":0.0,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","questionId":"99","status":"","submitted":119290,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.6019886866873723,"acs":254879,"articleLive":2,"columnArticles":1913,"formTitle":"[100]相同的树","frequency":0.0,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","submitted":423395,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.5642860780051939,"acs":421103,"articleLive":2,"columnArticles":2309,"formTitle":"[101]对称二叉树","frequency":0.0,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"","submitted":746258,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6420961936307501,"acs":406897,"articleLive":2,"columnArticles":2554,"formTitle":"[102]二叉树的层序遍历","frequency":0.0,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"ac","submitted":633701,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5718152378804234,"acs":177460,"articleLive":2,"columnArticles":1613,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":0.0,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"ac","submitted":310345,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7661905303063415,"acs":525881,"articleLive":2,"columnArticles":2604,"formTitle":"[104]二叉树的最大深度","frequency":0.0,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"","submitted":686358,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.704803747643863,"acs":254265,"articleLive":2,"columnArticles":1455,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":0.0,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"","submitted":360760,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.7215329531892322,"acs":136027,"articleLive":2,"columnArticles":901,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":0.0,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"","submitted":188525,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.6977363403115112,"acs":165614,"articleLive":2,"columnArticles":1326,"formTitle":"[107]二叉树的层序遍历 II","frequency":0.0,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","submitted":237359,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7606376355967814,"acs":195493,"articleLive":2,"columnArticles":1209,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":0.0,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"ac","submitted":257012,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.76312170158324,"acs":95436,"articleLive":2,"columnArticles":733,"formTitle":"[109]有序链表转换二叉搜索树","frequency":0.0,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"ac","submitted":125060,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5638534129755323,"acs":261765,"articleLive":2,"columnArticles":1497,"formTitle":"[110]平衡二叉树","frequency":0.0,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"ac","submitted":464243,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.48687970353978416,"acs":277222,"articleLive":2,"columnArticles":1825,"formTitle":"[111]二叉树的最小深度","frequency":0.0,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","submitted":569385,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5263938049293905,"acs":275574,"articleLive":2,"columnArticles":1729,"formTitle":"[112]路径总和","frequency":0.0,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"","submitted":523513,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6276921812447133,"acs":183288,"articleLive":2,"columnArticles":1284,"formTitle":"[113]路径总和 II","frequency":0.0,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","submitted":292003,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.7261366498362937,"acs":181638,"articleLive":2,"columnArticles":1362,"formTitle":"[114]二叉树展开为链表","frequency":0.0,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","submitted":250143,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5215984065728868,"acs":62850,"articleLive":2,"columnArticles":692,"formTitle":"[115]不同的子序列","frequency":0.0,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","submitted":120495,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7046864469750643,"acs":163118,"articleLive":2,"columnArticles":1241,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":0.0,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"ac","submitted":231476,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6151973210235612,"acs":92223,"articleLive":2,"columnArticles":784,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":0.0,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"ac","submitted":149908,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.731612369770134,"acs":221203,"articleLive":2,"columnArticles":1781,"formTitle":"[118]杨辉三角","frequency":0.0,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"ac","submitted":302350,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6682450736966835,"acs":147755,"articleLive":2,"columnArticles":1226,"formTitle":"[119]杨辉三角 II","frequency":0.0,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"ac","submitted":221109,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.681596844039719,"acs":182107,"articleLive":2,"columnArticles":1600,"formTitle":"[120]三角形最小路径和","frequency":0.0,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"ac","submitted":267177,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5733544419048263,"acs":576200,"articleLive":2,"columnArticles":3452,"formTitle":"[121]买卖股票的最佳时机","frequency":0.0,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"ac","submitted":1004963,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6898221359744995,"acs":472424,"articleLive":2,"columnArticles":2692,"formTitle":"[122]买卖股票的最佳时机 II","frequency":0.0,"frontendQuestionId":"122","leaf":true,"level":2,"nodeType":"def","questionId":"122","status":"ac","submitted":684849,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5372590894675782,"acs":133835,"articleLive":2,"columnArticles":831,"formTitle":"[123]买卖股票的最佳时机 III","frequency":0.0,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"","submitted":249107,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.4450226564712546,"acs":163423,"articleLive":2,"columnArticles":1109,"formTitle":"[124]二叉树中的最大路径和","frequency":0.0,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"ac","submitted":367224,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.4727485317511429,"acs":282619,"articleLive":2,"columnArticles":1861,"formTitle":"[125]验证回文串","frequency":0.0,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","submitted":597821,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.3967313520794747,"acs":37699,"articleLive":2,"columnArticles":332,"formTitle":"[126]单词接龙 II","frequency":0.0,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","submitted":95024,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.46882926628225446,"acs":125131,"articleLive":2,"columnArticles":662,"formTitle":"[127]单词接龙","frequency":0.0,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","submitted":266901,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5433630185214481,"acs":175171,"articleLive":2,"columnArticles":1145,"formTitle":"[128]最长连续序列","frequency":0.0,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","questionId":"128","status":"","submitted":322383,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6830349956983875,"acs":123059,"articleLive":2,"columnArticles":1132,"formTitle":"[129]求根节点到叶节点数字之和","frequency":0.0,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","submitted":180165,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.4454764548187062,"acs":131608,"articleLive":2,"columnArticles":1196,"formTitle":"[130]被围绕的区域","frequency":0.0,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"ac","submitted":295432,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.72297909546141,"acs":136437,"articleLive":2,"columnArticles":893,"formTitle":"[131]分割回文串","frequency":0.0,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","submitted":188715,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.4923514308480812,"acs":50049,"articleLive":2,"columnArticles":443,"formTitle":"[132]分割回文串 II","frequency":0.0,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","submitted":101653,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6761747114663545,"acs":73937,"articleLive":2,"columnArticles":531,"formTitle":"[133]克隆图","frequency":0.0,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"ac","submitted":109346,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.575660747911358,"acs":128092,"articleLive":2,"columnArticles":990,"formTitle":"[134]加油站","frequency":0.0,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"ac","submitted":222513,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.48605858077118264,"acs":101525,"articleLive":2,"columnArticles":815,"formTitle":"[135]分发糖果","frequency":0.0,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"ac","submitted":208874,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7190810137473955,"acs":511455,"articleLive":2,"columnArticles":2321,"formTitle":"[136]只出现一次的数字","frequency":0.0,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"ac","submitted":711262,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7199143802847848,"acs":101572,"articleLive":2,"columnArticles":766,"formTitle":"[137]只出现一次的数字 II","frequency":0.0,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"ac","submitted":141089,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6617854060347674,"acs":114246,"articleLive":2,"columnArticles":865,"formTitle":"[138]复制带随机指针的链表","frequency":0.0,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"ac","submitted":172633,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5161317109500492,"acs":198896,"articleLive":2,"columnArticles":1236,"formTitle":"[139]单词拆分","frequency":0.0,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"ac","submitted":385359,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.49137594346905966,"acs":54100,"articleLive":2,"columnArticles":555,"formTitle":"[140]单词拆分 II","frequency":0.0,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","submitted":110099,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.5125236002242554,"acs":542108,"articleLive":2,"columnArticles":2791,"formTitle":"[141]环形链表","frequency":0.0,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"ac","submitted":1057723,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.552831275286543,"acs":304301,"articleLive":2,"columnArticles":1780,"formTitle":"[142]环形链表 II","frequency":0.0,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"ac","submitted":550441,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.621665242117628,"acs":130191,"articleLive":2,"columnArticles":1103,"formTitle":"[143]重排链表","frequency":0.0,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"ac","submitted":209423,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7040408020095122,"acs":423508,"articleLive":2,"columnArticles":1883,"formTitle":"[144]二叉树的前序遍历","frequency":0.0,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","questionId":"144","status":"ac","submitted":601539,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.7508334671747775,"acs":308543,"articleLive":2,"columnArticles":1592,"formTitle":"[145]二叉树的后序遍历","frequency":0.0,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","questionId":"145","status":"ac","submitted":410934,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5260659450633378,"acs":239703,"articleLive":2,"columnArticles":1411,"formTitle":"[146]LRU 缓存机制","frequency":0.0,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","submitted":455652,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.681900111644674,"acs":101389,"articleLive":2,"columnArticles":794,"formTitle":"[147]对链表进行插入排序","frequency":0.0,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"ac","submitted":148686,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6671158653025104,"acs":214848,"articleLive":2,"columnArticles":1267,"formTitle":"[148]排序链表","frequency":0.0,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"ac","submitted":322055,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.3425628697692496,"acs":47595,"articleLive":2,"columnArticles":521,"formTitle":"[149]直线上最多的点数","frequency":0.0,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"ac","submitted":138938,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5355600846904248,"acs":135328,"articleLive":2,"columnArticles":1067,"formTitle":"[150]逆波兰表达式求值","frequency":0.0,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"ac","submitted":252685,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.4843388931474964,"acs":173125,"articleLive":2,"columnArticles":1453,"formTitle":"[151]翻转字符串里的单词","frequency":0.0,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","submitted":357446,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.42150552569734906,"acs":188147,"articleLive":2,"columnArticles":1264,"formTitle":"[152]乘积最大子数组","frequency":0.0,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","submitted":446369,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5669239755004104,"acs":215481,"articleLive":2,"columnArticles":1521,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":0.0,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"ac","submitted":380088,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5316041626124749,"acs":114734,"articleLive":2,"columnArticles":902,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":0.0,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"ac","submitted":215826,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5737242132378744,"acs":292655,"articleLive":2,"columnArticles":1626,"formTitle":"[155]最小栈","frequency":0.0,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"ac","submitted":510097,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7250788129144472,"acs":6670,"articleLive":2,"columnArticles":118,"formTitle":"[156]上下翻转二叉树","frequency":0.0,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"lock","submitted":9199,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5340898254982359,"acs":5601,"articleLive":2,"columnArticles":83,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"lock","submitted":10487,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5919170984455958,"acs":2856,"articleLive":2,"columnArticles":66,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":0.0,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","questionId":"158","status":"lock","submitted":4825,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5476319717736463,"acs":16142,"articleLive":2,"columnArticles":194,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":0.0,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","questionId":"159","status":"lock","submitted":29476,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6148829839102876,"acs":343026,"articleLive":2,"columnArticles":2002,"formTitle":"[160]相交链表","frequency":0.0,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"ac","submitted":557872,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.33655190492834675,"acs":7703,"articleLive":2,"columnArticles":105,"formTitle":"[161]相隔为 1 的编辑距离","frequency":0.0,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"lock","submitted":22888,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.4970688975781274,"acs":163988,"articleLive":2,"columnArticles":1112,"formTitle":"[162]寻找峰值","frequency":0.0,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"ac","submitted":329910,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.326858137510879,"acs":9389,"articleLive":2,"columnArticles":145,"formTitle":"[163]缺失的区间","frequency":0.0,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"lock","submitted":28725,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6097638278294653,"acs":59641,"articleLive":2,"columnArticles":491,"formTitle":"[164]最大间距","frequency":0.0,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","submitted":97810,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.5192394829724316,"acs":87091,"articleLive":2,"columnArticles":931,"formTitle":"[165]比较版本号","frequency":0.0,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"ac","submitted":167728,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.33119455006337134,"acs":41810,"articleLive":2,"columnArticles":381,"formTitle":"[166]分数到小数","frequency":0.0,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","submitted":126240,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5866304808024365,"acs":300671,"articleLive":2,"columnArticles":1973,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":0.0,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"ac","submitted":512539,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.4325694462029323,"acs":85413,"articleLive":2,"columnArticles":763,"formTitle":"[168]Excel表列名称","frequency":0.0,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"ac","submitted":197455,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.664681437178179,"acs":394745,"articleLive":2,"columnArticles":2228,"formTitle":"[169]多数元素","frequency":0.0,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","submitted":593886,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.41959870673259797,"acs":8825,"articleLive":2,"columnArticles":89,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":0.0,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"lock","submitted":21032,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7180729439366926,"acs":108345,"articleLive":2,"columnArticles":922,"formTitle":"[171]Excel 表列序号","frequency":0.0,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"ac","submitted":150883,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.44040930499438163,"acs":92105,"articleLive":2,"columnArticles":600,"formTitle":"[172]阶乘后的零","frequency":0.0,"frontendQuestionId":"172","leaf":true,"level":2,"nodeType":"def","questionId":"172","status":"","submitted":209135,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.804598915788695,"acs":76140,"articleLive":2,"columnArticles":639,"formTitle":"[173]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"ac","submitted":94631,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.4809159355360587,"acs":38644,"articleLive":2,"columnArticles":411,"formTitle":"[174]地下城游戏","frequency":0.0,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","submitted":80355,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7393579760490209,"acs":309252,"articleLive":2,"columnArticles":1481,"formTitle":"[175]组合两个表","frequency":0.0,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","submitted":418271,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.35582368292625277,"acs":255918,"articleLive":2,"columnArticles":1029,"formTitle":"[176]第二高的薪水","frequency":0.0,"frontendQuestionId":"176","leaf":true,"level":2,"nodeType":"def","questionId":"176","status":"","submitted":719227,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.4629752576660761,"acs":130403,"articleLive":2,"columnArticles":503,"formTitle":"[177]第N高的薪水","frequency":0.0,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","submitted":281663,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6035160618516733,"acs":121422,"articleLive":2,"columnArticles":679,"formTitle":"[178]分数排名","frequency":0.0,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","submitted":201191,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.4096528800101252,"acs":122995,"articleLive":2,"columnArticles":976,"formTitle":"[179]最大数","frequency":0.0,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"ac","submitted":300242,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.48691050669006364,"acs":88793,"articleLive":2,"columnArticles":523,"formTitle":"[180]连续出现的数字","frequency":0.0,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","submitted":182360,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.7018339145578828,"acs":166435,"articleLive":2,"columnArticles":683,"formTitle":"[181]超过经理收入的员工","frequency":0.0,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","submitted":237143,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7966978903429114,"acs":183799,"articleLive":2,"columnArticles":599,"formTitle":"[182]查找重复的电子邮箱","frequency":0.0,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","submitted":230701,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.6768817537918747,"acs":152714,"articleLive":2,"columnArticles":553,"formTitle":"[183]从不订购的客户","frequency":0.0,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","submitted":225614,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.4774078505255534,"acs":104147,"articleLive":2,"columnArticles":683,"formTitle":"[184]部门工资最高的员工","frequency":0.0,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","submitted":218151,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.49712776448358376,"acs":72088,"articleLive":2,"columnArticles":640,"formTitle":"[185]部门工资前三高的所有员工","frequency":0.0,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","submitted":145009,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7568546807677242,"acs":7729,"articleLive":2,"columnArticles":118,"formTitle":"[186]翻转字符串里的单词 II","frequency":0.0,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"lock","submitted":10212,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.5211594689497908,"acs":74506,"articleLive":2,"columnArticles":543,"formTitle":"[187]重复的DNA序列","frequency":0.0,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"ac","submitted":142962,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.39293437837233597,"acs":91393,"articleLive":2,"columnArticles":707,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":0.0,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"","submitted":232591,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.44997575355401853,"acs":352610,"articleLive":2,"columnArticles":1760,"formTitle":"[189]旋转数组","frequency":0.0,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"ac","submitted":783620,"title":"旋转数组","titleSlug":"rotate-array"},{"acceptance":0.6986663606824144,"acs":133956,"articleLive":2,"columnArticles":839,"formTitle":"[190]颠倒二进制位","frequency":0.0,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"ac","submitted":191731,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7493789505912081,"acs":193363,"articleLive":2,"columnArticles":1217,"formTitle":"[191]位1的个数","frequency":0.0,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"ac","submitted":258031,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.3563009384030912,"acs":21946,"articleLive":2,"columnArticles":178,"formTitle":"[192]统计词频","frequency":0.0,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","submitted":61594,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.325288406906944,"acs":26336,"articleLive":2,"columnArticles":140,"formTitle":"[193]有效电话号码","frequency":0.0,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","submitted":80962,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.3450886630802949,"acs":10392,"articleLive":2,"columnArticles":71,"formTitle":"[194]转置文件","frequency":0.0,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","submitted":30114,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.4362638563432609,"acs":35932,"articleLive":2,"columnArticles":143,"formTitle":"[195]第十行","frequency":0.0,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","submitted":82363,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6653905645784997,"acs":103242,"articleLive":2,"columnArticles":397,"formTitle":"[196]删除重复的电子邮箱","frequency":0.0,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","submitted":155160,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5339972929164647,"acs":95868,"articleLive":2,"columnArticles":514,"formTitle":"[197]上升的温度","frequency":0.0,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","submitted":179529,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.5161755403644903,"acs":397402,"articleLive":2,"columnArticles":2739,"formTitle":"[198]打家劫舍","frequency":0.0,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"ac","submitted":769897,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6527035807103667,"acs":144660,"articleLive":2,"columnArticles":1614,"formTitle":"[199]二叉树的右视图","frequency":0.0,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"ac","submitted":221632,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.557990485529042,"acs":337452,"articleLive":2,"columnArticles":2153,"formTitle":"[200]岛屿数量","frequency":0.0,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"ac","submitted":604763,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5245012670372186,"acs":50296,"articleLive":2,"columnArticles":330,"formTitle":"[201]数字范围按位与","frequency":0.0,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"ac","submitted":95893,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6195072771539196,"acs":173283,"articleLive":2,"columnArticles":1413,"formTitle":"[202]快乐数","frequency":0.0,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"ac","submitted":279711,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5169012988360631,"acs":239102,"articleLive":2,"columnArticles":1689,"formTitle":"[203]移除链表元素","frequency":0.0,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"ac","submitted":462568,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.3779217502169178,"acs":170739,"articleLive":2,"columnArticles":738,"formTitle":"[204]计数质数","frequency":0.0,"frontendQuestionId":"204","leaf":true,"level":2,"nodeType":"def","questionId":"204","status":"","submitted":451784,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.5004794404647752,"acs":115349,"articleLive":2,"columnArticles":885,"formTitle":"[205]同构字符串","frequency":0.0,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"ac","submitted":230477,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7234314980793854,"acs":728285,"articleLive":2,"columnArticles":7431,"formTitle":"[206]反转链表","frequency":0.0,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"ac","submitted":1006709,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.5429440963097725,"acs":145041,"articleLive":2,"columnArticles":955,"formTitle":"[207]课程表","frequency":0.0,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","submitted":267138,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.7167164674634794,"acs":146795,"articleLive":2,"columnArticles":995,"formTitle":"[208]实现 Trie (前缀树)","frequency":0.0,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"ac","submitted":204816,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.47335060444971344,"acs":200437,"articleLive":2,"columnArticles":1416,"formTitle":"[209]长度最小的子数组","frequency":0.0,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"ac","submitted":423443,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.542964062964063,"acs":91408,"articleLive":2,"columnArticles":686,"formTitle":"[210]课程表 II","frequency":0.0,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","submitted":168350,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.48308127162559494,"acs":29738,"articleLive":2,"columnArticles":329,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":0.0,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"","submitted":61559,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.4628536776560027,"acs":62588,"articleLive":2,"columnArticles":576,"formTitle":"[212]单词搜索 II","frequency":0.0,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"ac","submitted":135222,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.43326359779456064,"acs":170442,"articleLive":2,"columnArticles":1563,"formTitle":"[213]打家劫舍 II","frequency":0.0,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"ac","submitted":393391,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.37175966478066336,"acs":31407,"articleLive":2,"columnArticles":309,"formTitle":"[214]最短回文串","frequency":0.0,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","submitted":84482,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.6463665379089635,"acs":450798,"articleLive":2,"columnArticles":2340,"formTitle":"[215]数组中的第K个最大元素","frequency":0.0,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"ac","submitted":697434,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7369002331574427,"acs":102085,"articleLive":2,"columnArticles":1050,"formTitle":"[216]组合总和 III","frequency":0.0,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","submitted":138533,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5576125166739135,"acs":378315,"articleLive":2,"columnArticles":1766,"formTitle":"[217]存在重复元素","frequency":0.0,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"ac","submitted":678455,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5422099504013909,"acs":31812,"articleLive":2,"columnArticles":282,"formTitle":"[218]天际线问题","frequency":0.0,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"ac","submitted":58671,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.4247883352558448,"acs":112687,"articleLive":2,"columnArticles":904,"formTitle":"[219]存在重复元素 II","frequency":0.0,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"ac","submitted":265278,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.28678420490177536,"acs":65211,"articleLive":2,"columnArticles":426,"formTitle":"[220]存在重复元素 III","frequency":0.0,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"ac","submitted":227387,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.47727699845627225,"acs":142219,"articleLive":2,"columnArticles":1009,"formTitle":"[221]最大正方形","frequency":0.0,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","submitted":297980,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7821590811972836,"acs":118975,"articleLive":2,"columnArticles":894,"formTitle":"[222]完全二叉树的节点个数","frequency":0.0,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","submitted":152111,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.5235217682011429,"acs":41498,"articleLive":2,"columnArticles":516,"formTitle":"[223]矩形面积","frequency":0.0,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"ac","submitted":79267,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.4178852480817823,"acs":72272,"articleLive":2,"columnArticles":662,"formTitle":"[224]基本计算器","frequency":0.0,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"ac","submitted":172947,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.6754916348693866,"acs":138084,"articleLive":2,"columnArticles":4765,"formTitle":"[225]用队列实现栈","frequency":0.0,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"ac","submitted":204420,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7882568381544298,"acs":312506,"articleLive":2,"columnArticles":1889,"formTitle":"[226]翻转二叉树","frequency":0.0,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"ac","submitted":396452,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.43767595983755636,"acs":87835,"articleLive":2,"columnArticles":708,"formTitle":"[227]基本计算器 II","frequency":0.0,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"ac","submitted":200685,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5797097097097097,"acs":57913,"articleLive":2,"columnArticles":654,"formTitle":"[228]汇总区间","frequency":0.0,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","submitted":99900,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.46486807730880186,"acs":37546,"articleLive":2,"columnArticles":320,"formTitle":"[229]求众数 II","frequency":0.0,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"","submitted":80767,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.504377740701915,"acs":170805,"articleLive":2,"columnArticles":1230,"formTitle":"[231]2 的幂","frequency":0.0,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"ac","submitted":338645,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6909832524333528,"acs":163137,"articleLive":2,"columnArticles":1289,"formTitle":"[232]用栈实现队列","frequency":0.0,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"ac","submitted":236094,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.4769656988465706,"acs":34777,"articleLive":2,"columnArticles":418,"formTitle":"[233]数字 1 的个数","frequency":0.0,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"ac","submitted":72913,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.4974492876353571,"acs":317206,"articleLive":2,"columnArticles":2026,"formTitle":"[234]回文链表","frequency":0.0,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"ac","submitted":637665,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.6662123038880655,"acs":173507,"articleLive":2,"columnArticles":997,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":0.0,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"","submitted":260438,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6810190011249987,"acs":263933,"articleLive":2,"columnArticles":1417,"formTitle":"[236]二叉树的最近公共祖先","frequency":0.0,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","submitted":387556,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.847992932692692,"acs":212139,"articleLive":2,"columnArticles":1021,"formTitle":"[237]删除链表中的节点","frequency":0.0,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"ac","submitted":250166,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7236677027698264,"acs":141320,"articleLive":2,"columnArticles":895,"formTitle":"[238]除自身以外数组的乘积","frequency":0.0,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","submitted":195283,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.49691894096147166,"acs":197409,"articleLive":2,"columnArticles":1354,"formTitle":"[239]滑动窗口最大值","frequency":0.0,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"ac","submitted":397266,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.47887089248816905,"acs":172428,"articleLive":2,"columnArticles":780,"formTitle":"[240]搜索二维矩阵 II","frequency":0.0,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"","submitted":360072,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7381148856186678,"acs":32201,"articleLive":2,"columnArticles":290,"formTitle":"[241]为运算表达式设计优先级","frequency":0.0,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","submitted":43626,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.645952566770725,"acs":297965,"articleLive":2,"columnArticles":1723,"formTitle":"[242]有效的字母异位词","frequency":0.0,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"ac","submitted":461280,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6569380440348183,"acs":8981,"articleLive":2,"columnArticles":105,"formTitle":"[243]最短单词距离","frequency":0.0,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"lock","submitted":13671,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.5509983810037776,"acs":5105,"articleLive":2,"columnArticles":59,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"lock","submitted":9265,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.601041952289553,"acs":4384,"articleLive":2,"columnArticles":60,"formTitle":"[245]最短单词距离 III","frequency":0.0,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"lock","submitted":7294,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.4755001214870009,"acs":5871,"articleLive":2,"columnArticles":108,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"lock","submitted":12347,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5246097245699513,"acs":5276,"articleLive":2,"columnArticles":92,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"lock","submitted":10057,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.46552924791086353,"acs":2674,"articleLive":2,"columnArticles":52,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"lock","submitted":5744,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.6384565499351491,"acs":5907,"articleLive":2,"columnArticles":102,"formTitle":"[249]移位字符串分组","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"lock","submitted":9252,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.634785044111469,"acs":4533,"articleLive":2,"columnArticles":77,"formTitle":"[250]统计同值子树","frequency":0.0,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"lock","submitted":7141,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5441587068332109,"acs":3703,"articleLive":2,"columnArticles":69,"formTitle":"[251]展开二维向量","frequency":0.0,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"lock","submitted":6805,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5646177187255759,"acs":12281,"articleLive":2,"columnArticles":159,"formTitle":"[252]会议室","frequency":0.0,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"lock","submitted":21751,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.501602293810086,"acs":32714,"articleLive":2,"columnArticles":352,"formTitle":"[253]会议室 II","frequency":0.0,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"lock","submitted":65219,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5687039445166884,"acs":5248,"articleLive":2,"columnArticles":77,"formTitle":"[254]因子的组合","frequency":0.0,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"lock","submitted":9228,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.4756405629736557,"acs":5272,"articleLive":2,"columnArticles":62,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"lock","submitted":11084,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.6412300070009155,"acs":11907,"articleLive":2,"columnArticles":187,"formTitle":"[256]粉刷房子","frequency":0.0,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"lock","submitted":18569,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6831689696421676,"acs":145060,"articleLive":2,"columnArticles":1075,"formTitle":"[257]二叉树的所有路径","frequency":0.0,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"ac","submitted":212334,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6922439653969583,"acs":79381,"articleLive":2,"columnArticles":658,"formTitle":"[258]各位相加","frequency":0.0,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","submitted":114672,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5649304737214236,"acs":7191,"articleLive":2,"columnArticles":85,"formTitle":"[259]较小的三数之和","frequency":0.0,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"lock","submitted":12729,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7233882236896183,"acs":52803,"articleLive":2,"columnArticles":450,"formTitle":"[260]只出现一次的数字 III","frequency":0.0,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"ac","submitted":72994,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.4947572372919991,"acs":8682,"articleLive":2,"columnArticles":119,"formTitle":"[261]以图判树","frequency":0.0,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"lock","submitted":17548,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.4342673978355317,"acs":38883,"articleLive":2,"columnArticles":377,"formTitle":"[262]行程和用户","frequency":0.0,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","submitted":89537,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.5152397416067692,"acs":107597,"articleLive":2,"columnArticles":840,"formTitle":"[263]丑数","frequency":0.0,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"ac","submitted":208829,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.5801824174315077,"acs":101395,"articleLive":2,"columnArticles":617,"formTitle":"[264]丑数 II","frequency":0.0,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","submitted":174764,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5902960386801256,"acs":6959,"articleLive":2,"columnArticles":155,"formTitle":"[265]粉刷房子 II","frequency":0.0,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"lock","submitted":11789,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6750098931539374,"acs":6823,"articleLive":2,"columnArticles":103,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"lock","submitted":10108,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.4470527537727331,"acs":3466,"articleLive":2,"columnArticles":77,"formTitle":"[267]回文排列 II","frequency":0.0,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"lock","submitted":7753,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6260312199164056,"acs":154122,"articleLive":2,"columnArticles":1123,"formTitle":"[268]丢失的数字","frequency":0.0,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"ac","submitted":246189,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.3381878705919068,"acs":6502,"articleLive":2,"columnArticles":109,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"lock","submitted":19226,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.5546527159394479,"acs":9966,"articleLive":2,"columnArticles":141,"formTitle":"[270]最接近的二叉搜索树值","frequency":0.0,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"lock","submitted":17968,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.5542491749174917,"acs":2687,"articleLive":2,"columnArticles":46,"formTitle":"[271]字符串的编码与解码","frequency":0.0,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"lock","submitted":4848,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.649203998519067,"acs":3507,"articleLive":2,"columnArticles":76,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":0.0,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"lock","submitted":5402,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.36678677132930126,"acs":28503,"articleLive":2,"columnArticles":351,"formTitle":"[273]整数转换英文表示","frequency":0.0,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"ac","submitted":77710,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.4400919786791472,"acs":54163,"articleLive":2,"columnArticles":564,"formTitle":"[274]H 指数","frequency":0.0,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"ac","submitted":123072,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.46218639125371275,"acs":51195,"articleLive":2,"columnArticles":419,"formTitle":"[275]H 指数 II","frequency":0.0,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"ac","submitted":110767,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.49264099037138925,"acs":7163,"articleLive":2,"columnArticles":131,"formTitle":"[276]栅栏涂色","frequency":0.0,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"lock","submitted":14540,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.570400666515186,"acs":7531,"articleLive":2,"columnArticles":85,"formTitle":"[277]搜寻名人","frequency":0.0,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"lock","submitted":13203,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.4534274064579715,"acs":191384,"articleLive":2,"columnArticles":1092,"formTitle":"[278]第一个错误的版本","frequency":0.0,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"ac","submitted":422083,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6325136361132027,"acs":206646,"articleLive":2,"columnArticles":1216,"formTitle":"[279]完全平方数","frequency":0.0,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"ac","submitted":326706,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6851941162285989,"acs":5683,"articleLive":2,"columnArticles":71,"formTitle":"[280]摆动排序","frequency":0.0,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"lock","submitted":8294,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7599766967666763,"acs":2609,"articleLive":2,"columnArticles":65,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"lock","submitted":3433,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.4867613351950892,"acs":18476,"articleLive":2,"columnArticles":158,"formTitle":"[282]给表达式添加运算符","frequency":0.0,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"ac","submitted":37957,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.6391906550170807,"acs":505006,"articleLive":2,"columnArticles":3434,"formTitle":"[283]移动零","frequency":0.0,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"ac","submitted":790071,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.7712013860957272,"acs":24926,"articleLive":2,"columnArticles":210,"formTitle":"[284]窥探迭代器","frequency":0.0,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"ac","submitted":32321,"title":"窥探迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.635340109460516,"acs":8126,"articleLive":2,"columnArticles":104,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"lock","submitted":12790,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5098056344179952,"acs":11672,"articleLive":2,"columnArticles":150,"formTitle":"[286]墙与门","frequency":0.0,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"lock","submitted":22895,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.6591244716169881,"acs":181658,"articleLive":2,"columnArticles":1243,"formTitle":"[287]寻找重复数","frequency":0.0,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","submitted":275605,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.43457602339181284,"acs":3567,"articleLive":2,"columnArticles":55,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"lock","submitted":8208,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7535684594682185,"acs":53480,"articleLive":2,"columnArticles":831,"formTitle":"[289]生命游戏","frequency":0.0,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","submitted":70969,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.4565295579387915,"acs":83775,"articleLive":2,"columnArticles":1115,"formTitle":"[290]单词规律","frequency":0.0,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","submitted":183504,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.5315091210613598,"acs":2564,"articleLive":2,"columnArticles":56,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"lock","submitted":4824,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.708313644146328,"acs":115419,"articleLive":2,"columnArticles":770,"formTitle":"[292]Nim 游戏","frequency":0.0,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"ac","submitted":162949,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7121017288184026,"acs":4984,"articleLive":2,"columnArticles":84,"formTitle":"[293]翻转游戏","frequency":0.0,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"lock","submitted":6999,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.581233158979236,"acs":3667,"articleLive":2,"columnArticles":55,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"lock","submitted":6309,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.5233424555795048,"acs":64828,"articleLive":2,"columnArticles":507,"formTitle":"[295]数据流的中位数","frequency":0.0,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"ac","submitted":123873,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.6203473945409429,"acs":2500,"articleLive":2,"columnArticles":46,"formTitle":"[296]最佳的碰头地点","frequency":0.0,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"lock","submitted":4030,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.5606231997905211,"acs":107051,"articleLive":2,"columnArticles":768,"formTitle":"[297]二叉树的序列化与反序列化","frequency":0.0,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"ac","submitted":190950,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5780580951278788,"acs":4995,"articleLive":2,"columnArticles":82,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"lock","submitted":8641,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.504725057622654,"acs":30657,"articleLive":2,"columnArticles":364,"formTitle":"[299]猜数字游戏","frequency":0.0,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"","submitted":60740,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5170905776780707,"acs":368789,"articleLive":2,"columnArticles":2040,"formTitle":"[300]最长递增子序列","frequency":0.0,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"ac","submitted":713200,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5239560986226409,"acs":33704,"articleLive":2,"columnArticles":237,"formTitle":"[301]删除无效的括号","frequency":0.0,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"","submitted":64326,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.6565526145900581,"acs":2034,"articleLive":2,"columnArticles":39,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"lock","submitted":3098,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.7268244795966177,"acs":130308,"articleLive":2,"columnArticles":799,"formTitle":"[303]区域和检索 - 数组不可变","frequency":0.0,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","submitted":179284,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.547982430654065,"acs":64126,"articleLive":2,"columnArticles":571,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":0.0,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","submitted":117022,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.38323668950975226,"acs":4362,"articleLive":2,"columnArticles":65,"formTitle":"[305]岛屿数量 II","frequency":0.0,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"lock","submitted":11382,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.33782318023152624,"acs":17130,"articleLive":2,"columnArticles":256,"formTitle":"[306]累加数","frequency":0.0,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","submitted":50707,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5390020457173352,"acs":24240,"articleLive":2,"columnArticles":232,"formTitle":"[307]区域和检索 - 数组可修改","frequency":0.0,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"ac","submitted":44972,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6107977437550363,"acs":2274,"articleLive":2,"columnArticles":43,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"lock","submitted":3723,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.6090466688385731,"acs":119646,"articleLive":2,"columnArticles":952,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":0.0,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"","submitted":196448,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.3795702977761025,"acs":22154,"articleLive":2,"columnArticles":214,"formTitle":"[310]最小高度树","frequency":0.0,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","submitted":58366,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7618343195266272,"acs":3605,"articleLive":2,"columnArticles":45,"formTitle":"[311]稀疏矩阵的乘法","frequency":0.0,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"lock","submitted":4732,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6832494004796164,"acs":56983,"articleLive":2,"columnArticles":386,"formTitle":"[312]戳气球","frequency":0.0,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","submitted":83400,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6282131565683564,"acs":41131,"articleLive":2,"columnArticles":356,"formTitle":"[313]超级丑数","frequency":0.0,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"ac","submitted":65473,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5466932926113004,"acs":4654,"articleLive":2,"columnArticles":88,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"lock","submitted":8513,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.4178918146426401,"acs":50880,"articleLive":2,"columnArticles":481,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":0.0,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"ac","submitted":121754,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.47622632041149165,"acs":68328,"articleLive":2,"columnArticles":541,"formTitle":"[316]去除重复字母","frequency":0.0,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"ac","submitted":143478,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.4842704149933066,"acs":4341,"articleLive":2,"columnArticles":64,"formTitle":"[317]离建筑物最近的距离","frequency":0.0,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"lock","submitted":8964,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.6858967927494064,"acs":20509,"articleLive":2,"columnArticles":182,"formTitle":"[318]最大单词长度乘积","frequency":0.0,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","submitted":29901,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5188883676250474,"acs":23227,"articleLive":2,"columnArticles":229,"formTitle":"[319]灯泡开关","frequency":0.0,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"ac","submitted":44763,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.677397415552029,"acs":2988,"articleLive":2,"columnArticles":50,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"lock","submitted":4411,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.42394433022299544,"acs":26806,"articleLive":2,"columnArticles":232,"formTitle":"[321]拼接最大数","frequency":0.0,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","submitted":63230,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.44513761362921267,"acs":311242,"articleLive":2,"columnArticles":1842,"formTitle":"[322]零钱兑换","frequency":0.0,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"ac","submitted":699204,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.6322890464212211,"acs":11060,"articleLive":2,"columnArticles":153,"formTitle":"[323]无向图中连通分量的数目","frequency":0.0,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"lock","submitted":17492,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.37854968824798324,"acs":25621,"articleLive":2,"columnArticles":169,"formTitle":"[324]摆动排序 II","frequency":0.0,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"ac","submitted":67682,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5368906081119518,"acs":9438,"articleLive":2,"columnArticles":107,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":0.0,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"lock","submitted":17579,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.5045314211731899,"acs":136782,"articleLive":2,"columnArticles":585,"formTitle":"[326]3的幂","frequency":0.0,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"ac","submitted":271107,"title":"3的幂","titleSlug":"power-of-three"},{"acceptance":0.42073604662984176,"acs":24831,"articleLive":2,"columnArticles":206,"formTitle":"[327]区间和的个数","frequency":0.0,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","submitted":59018,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6557603732979344,"acs":130415,"articleLive":2,"columnArticles":1074,"formTitle":"[328]奇偶链表","frequency":0.0,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"ac","submitted":198876,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.48661331331160523,"acs":57034,"articleLive":2,"columnArticles":501,"formTitle":"[329]矩阵中的最长递增路径","frequency":0.0,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","submitted":117206,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5333913482862196,"acs":19001,"articleLive":2,"columnArticles":150,"formTitle":"[330]按要求补齐数组","frequency":0.0,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","submitted":35623,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.47987040577862755,"acs":45175,"articleLive":2,"columnArticles":508,"formTitle":"[331]验证二叉树的前序序列化","frequency":0.0,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"ac","submitted":94140,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.44972882303606376,"acs":40217,"articleLive":2,"columnArticles":331,"formTitle":"[332]重新安排行程","frequency":0.0,"frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","questionId":"332","status":"","submitted":89425,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.47004112003132953,"acs":4801,"articleLive":2,"columnArticles":81,"formTitle":"[333]最大 BST 子树","frequency":0.0,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"lock","submitted":10214,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.4120046926161335,"acs":47060,"articleLive":2,"columnArticles":310,"formTitle":"[334]递增的三元子序列","frequency":0.0,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","submitted":114222,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.36976716129810594,"acs":3065,"articleLive":2,"columnArticles":38,"formTitle":"[335]路径交叉","frequency":0.0,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"","submitted":8289,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.4012842249558097,"acs":22248,"articleLive":2,"columnArticles":193,"formTitle":"[336]回文对","frequency":0.0,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","submitted":55442,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6079281809795255,"acs":132456,"articleLive":2,"columnArticles":938,"formTitle":"[337]打家劫舍 III","frequency":0.0,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","submitted":217881,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7869131515337214,"acs":161798,"articleLive":2,"columnArticles":1393,"formTitle":"[338]比特位计数","frequency":0.0,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"","submitted":205611,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8098924731182796,"acs":3766,"articleLive":2,"columnArticles":58,"formTitle":"[339]嵌套列表权重和","frequency":0.0,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"lock","submitted":4650,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.49423305832615033,"acs":12041,"articleLive":2,"columnArticles":178,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":0.0,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","questionId":"340","status":"lock","submitted":24363,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.7270554628503549,"acs":51413,"articleLive":2,"columnArticles":490,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":0.0,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"ac","submitted":70714,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5162894013116142,"acs":87858,"articleLive":2,"columnArticles":774,"formTitle":"[342]4的幂","frequency":0.0,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"ac","submitted":170172,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.6065246266319666,"acs":112332,"articleLive":2,"columnArticles":1064,"formTitle":"[343]整数拆分","frequency":0.0,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"ac","submitted":185206,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.7694882224219212,"acs":375905,"articleLive":2,"columnArticles":1985,"formTitle":"[344]反转字符串","frequency":0.0,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"ac","submitted":488513,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.539279074011057,"acs":109348,"articleLive":2,"columnArticles":1039,"formTitle":"[345]反转字符串中的元音字母","frequency":0.0,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"ac","submitted":202767,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7057623661397247,"acs":12456,"articleLive":2,"columnArticles":135,"formTitle":"[346]数据流中的移动平均值","frequency":0.0,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"lock","submitted":17649,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.622242163847646,"acs":205941,"articleLive":2,"columnArticles":1519,"formTitle":"[347]前 K 个高频元素","frequency":0.0,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"ac","submitted":330966,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.6004848484848485,"acs":4954,"articleLive":2,"columnArticles":80,"formTitle":"[348]设计井字棋","frequency":0.0,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"lock","submitted":8250,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.7378670694045619,"acs":217901,"articleLive":2,"columnArticles":1536,"formTitle":"[349]两个数组的交集","frequency":0.0,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"ac","submitted":295312,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5504919428555376,"acs":254744,"articleLive":2,"columnArticles":1426,"formTitle":"[350]两个数组的交集 II","frequency":0.0,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"ac","submitted":462757,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5904406928305196,"acs":5386,"articleLive":2,"columnArticles":100,"formTitle":"[351]安卓系统手势解锁","frequency":0.0,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"lock","submitted":9122,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.6795634272269786,"acs":20796,"articleLive":2,"columnArticles":343,"formTitle":"[352]将数据流变为多个不相交区间","frequency":0.0,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"ac","submitted":30602,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.42835336767792404,"acs":2245,"articleLive":2,"columnArticles":48,"formTitle":"[353]贪吃蛇","frequency":0.0,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"lock","submitted":5241,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.4541667201602239,"acs":70751,"articleLive":2,"columnArticles":547,"formTitle":"[354]俄罗斯套娃信封问题","frequency":0.0,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","submitted":155782,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.4081310200237003,"acs":26864,"articleLive":2,"columnArticles":440,"formTitle":"[355]设计推特","frequency":0.0,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","submitted":65822,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.35288966725043786,"acs":1612,"articleLive":2,"columnArticles":40,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"lock","submitted":4568,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.5205828855762998,"acs":24900,"articleLive":2,"columnArticles":390,"formTitle":"[357]计算各个位数不同的数字个数","frequency":0.0,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","submitted":47831,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.351638827607942,"acs":4463,"articleLive":2,"columnArticles":60,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.0,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"lock","submitted":12692,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.7265694733710205,"acs":4884,"articleLive":2,"columnArticles":58,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"lock","submitted":6722,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.6015381417584702,"acs":2894,"articleLive":2,"columnArticles":63,"formTitle":"[360]有序转化数组","frequency":0.0,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"lock","submitted":4811,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5670471971375022,"acs":3328,"articleLive":2,"columnArticles":65,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"lock","submitted":5869,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6913070410902333,"acs":3348,"articleLive":2,"columnArticles":63,"formTitle":"[362]敲击计数器","frequency":0.0,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"lock","submitted":4843,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.4894942440294753,"acs":33081,"articleLive":2,"columnArticles":214,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":0.0,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"ac","submitted":67582,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.7222222222222222,"acs":1859,"articleLive":2,"columnArticles":48,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"lock","submitted":2574,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.36593848961408404,"acs":34089,"articleLive":2,"columnArticles":484,"formTitle":"[365]水壶问题","frequency":0.0,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","submitted":93155,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7654976974849451,"acs":4322,"articleLive":2,"columnArticles":122,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.0,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"lock","submitted":5646,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.4386207588949561,"acs":78639,"articleLive":2,"columnArticles":632,"formTitle":"[367]有效的完全平方数","frequency":0.0,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","submitted":179287,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.4589741067427397,"acs":41992,"articleLive":2,"columnArticles":455,"formTitle":"[368]最大整除子集","frequency":0.0,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"ac","submitted":91491,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.618084961070892,"acs":4525,"articleLive":2,"columnArticles":131,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"lock","submitted":7321,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.723643581826202,"acs":3281,"articleLive":2,"columnArticles":49,"formTitle":"[370]区间加法","frequency":0.0,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"lock","submitted":4534,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.6127438369224716,"acs":80979,"articleLive":2,"columnArticles":508,"formTitle":"[371]两整数之和","frequency":0.0,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"ac","submitted":132158,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5110116510372265,"acs":14386,"articleLive":2,"columnArticles":136,"formTitle":"[372]超级次方","frequency":0.0,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","submitted":28152,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.4157889437116101,"acs":20646,"articleLive":2,"columnArticles":211,"formTitle":"[373]查找和最小的K对数字","frequency":0.0,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"ac","submitted":49655,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5156352651517477,"acs":83981,"articleLive":2,"columnArticles":573,"formTitle":"[374]猜数字大小","frequency":0.0,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"ac","submitted":162869,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.4702678599866229,"acs":14765,"articleLive":2,"columnArticles":125,"formTitle":"[375]猜数字大小 II","frequency":0.0,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"","submitted":31397,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.46482990198150753,"acs":76967,"articleLive":2,"columnArticles":827,"formTitle":"[376]摆动序列","frequency":0.0,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"ac","submitted":165581,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5093266817463514,"acs":65750,"articleLive":2,"columnArticles":558,"formTitle":"[377]组合总和 Ⅳ","frequency":0.0,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"ac","submitted":129092,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6390736106145474,"acs":80437,"articleLive":2,"columnArticles":566,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":0.0,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"ac","submitted":125865,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6389884508164078,"acs":3209,"articleLive":2,"columnArticles":69,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"lock","submitted":5022,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.5033868092691622,"acs":35300,"articleLive":2,"columnArticles":221,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":0.0,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"ac","submitted":70125,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.44132706156599927,"acs":21204,"articleLive":2,"columnArticles":176,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":0.0,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","submitted":48046,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.6324362606232294,"acs":16074,"articleLive":2,"columnArticles":126,"formTitle":"[382]链表随机节点","frequency":0.0,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","submitted":25416,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.6026657272033351,"acs":71848,"articleLive":2,"columnArticles":786,"formTitle":"[383]赎金信","frequency":0.0,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"ac","submitted":119217,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.579820681935406,"acs":52835,"articleLive":2,"columnArticles":200,"formTitle":"[384]打乱数组","frequency":0.0,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"ac","submitted":91123,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.41782055611842844,"acs":7423,"articleLive":2,"columnArticles":86,"formTitle":"[385]迷你语法分析器","frequency":0.0,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"ac","submitted":17766,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.749850864983098,"acs":22626,"articleLive":2,"columnArticles":242,"formTitle":"[386]字典序排数","frequency":0.0,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","submitted":30174,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5346015024772875,"acs":225728,"articleLive":2,"columnArticles":1224,"formTitle":"[387]字符串中的第一个唯一字符","frequency":0.0,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"ac","submitted":422236,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5289973365409399,"acs":6157,"articleLive":2,"columnArticles":112,"formTitle":"[388]文件的最长绝对路径","frequency":0.0,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","submitted":11639,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6915249625901237,"acs":101668,"articleLive":2,"columnArticles":999,"formTitle":"[389]找不同","frequency":0.0,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","submitted":147020,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.4664357147525982,"acs":7136,"articleLive":2,"columnArticles":97,"formTitle":"[390]消除游戏","frequency":0.0,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","submitted":15299,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.3589802480477722,"acs":4689,"articleLive":2,"columnArticles":67,"formTitle":"[391]完美矩形","frequency":0.0,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","submitted":13062,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.515175973396148,"acs":148721,"articleLive":2,"columnArticles":1594,"formTitle":"[392]判断子序列","frequency":0.0,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"ac","submitted":288680,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.3911488287277318,"acs":11154,"articleLive":2,"columnArticles":128,"formTitle":"[393]UTF-8 编码验证","frequency":0.0,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","submitted":28516,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5529760998629929,"acs":123505,"articleLive":2,"columnArticles":1316,"formTitle":"[394]字符串解码","frequency":0.0,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"ac","submitted":223346,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5205185739217153,"acs":52195,"articleLive":2,"columnArticles":431,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":0.0,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"","submitted":100275,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.4293145086383058,"acs":9244,"articleLive":2,"columnArticles":149,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","submitted":21532,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.37681159420289856,"acs":15730,"articleLive":2,"columnArticles":196,"formTitle":"[397]整数替换","frequency":0.0,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","submitted":41745,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6583652330556181,"acs":14619,"articleLive":2,"columnArticles":123,"formTitle":"[398]随机数索引","frequency":0.0,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","submitted":22205,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.5919373711483813,"acs":42494,"articleLive":2,"columnArticles":533,"formTitle":"[399]除法求值","frequency":0.0,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","submitted":71788,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.41738591693727567,"acs":19537,"articleLive":2,"columnArticles":201,"formTitle":"[400]第 N 位数字","frequency":0.0,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"ac","submitted":46808,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6140989856355096,"acs":54123,"articleLive":2,"columnArticles":658,"formTitle":"[401]二进制手表","frequency":0.0,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","submitted":88134,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.32714971366457396,"acs":81863,"articleLive":2,"columnArticles":593,"formTitle":"[402]移掉 K 位数字","frequency":0.0,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"ac","submitted":250231,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.4556959526159921,"acs":46162,"articleLive":2,"columnArticles":463,"formTitle":"[403]青蛙过河","frequency":0.0,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"ac","submitted":101300,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5845037372800842,"acs":102128,"articleLive":2,"columnArticles":1135,"formTitle":"[404]左叶子之和","frequency":0.0,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"ac","submitted":174726,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5616975052482547,"acs":46021,"articleLive":2,"columnArticles":463,"formTitle":"[405]数字转换为十六进制数","frequency":0.0,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"ac","submitted":81932,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7376994255569296,"acs":121100,"articleLive":2,"columnArticles":803,"formTitle":"[406]根据身高重建队列","frequency":0.0,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","submitted":164159,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.4832124878769685,"acs":10463,"articleLive":2,"columnArticles":130,"formTitle":"[407]接雨水 II","frequency":0.0,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"","submitted":21653,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.3248772504091653,"acs":3573,"articleLive":2,"columnArticles":83,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"lock","submitted":10998,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.556176576534703,"acs":95728,"articleLive":2,"columnArticles":1339,"formTitle":"[409]最长回文串","frequency":0.0,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","submitted":172118,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5648565398437054,"acs":39610,"articleLive":2,"columnArticles":321,"formTitle":"[410]分割数组的最大值","frequency":0.0,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","submitted":70124,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.5049614112458655,"acs":916,"articleLive":2,"columnArticles":22,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"lock","submitted":1814,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.7082379467033689,"acs":102402,"articleLive":2,"columnArticles":590,"formTitle":"[412]Fizz Buzz","frequency":0.0,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"ac","submitted":144587,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6881974654813694,"acs":72770,"articleLive":2,"columnArticles":941,"formTitle":"[413]等差数列划分","frequency":0.0,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"ac","submitted":105740,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.39347091328528766,"acs":88010,"articleLive":2,"columnArticles":1146,"formTitle":"[414]第三大的数","frequency":0.0,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"ac","submitted":223676,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5386623083441935,"acs":151279,"articleLive":2,"columnArticles":1097,"formTitle":"[415]字符串相加","frequency":0.0,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","submitted":280842,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.5078799023820163,"acs":177309,"articleLive":2,"columnArticles":1006,"formTitle":"[416]分割等和子集","frequency":0.0,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"ac","submitted":349116,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.48129114315670063,"acs":28002,"articleLive":2,"columnArticles":330,"formTitle":"[417]太平洋大西洋水流问题","frequency":0.0,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"ac","submitted":58181,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.3610837438423645,"acs":2199,"articleLive":2,"columnArticles":34,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"lock","submitted":6090,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7556516970324783,"acs":12401,"articleLive":2,"columnArticles":158,"formTitle":"[419]甲板上的战舰","frequency":0.0,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","submitted":16411,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.20871456427178642,"acs":2783,"articleLive":2,"columnArticles":53,"formTitle":"[420]强密码检验器","frequency":0.0,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","submitted":13334,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6219221011789285,"acs":33340,"articleLive":2,"columnArticles":307,"formTitle":"[421]数组中两个数的最大异或值","frequency":0.0,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"ac","submitted":53608,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.42772361169987283,"acs":2018,"articleLive":2,"columnArticles":49,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"lock","submitted":4718,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.5689873840197583,"acs":8524,"articleLive":2,"columnArticles":138,"formTitle":"[423]从英文中重建数字","frequency":0.0,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","submitted":14981,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.5316833708324811,"acs":51988,"articleLive":2,"columnArticles":455,"formTitle":"[424]替换后的最长重复字符","frequency":0.0,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"ac","submitted":97780,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6168597682780663,"acs":1544,"articleLive":2,"columnArticles":32,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"lock","submitted":2503,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6695189199467579,"acs":7042,"articleLive":2,"columnArticles":115,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":0.0,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"lock","submitted":10518,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.6136330031051309,"acs":4150,"articleLive":2,"columnArticles":67,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","submitted":6763,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.65380859375,"acs":2678,"articleLive":2,"columnArticles":54,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"lock","submitted":4096,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.7003195338564917,"acs":59614,"articleLive":2,"columnArticles":479,"formTitle":"[429]N 叉树的层序遍历","frequency":0.0,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"ac","submitted":85124,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5879019276563477,"acs":44192,"articleLive":2,"columnArticles":674,"formTitle":"[430]扁平化多级双向链表","frequency":0.0,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"ac","submitted":75169,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7333333333333333,"acs":880,"articleLive":2,"columnArticles":29,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"771","status":"lock","submitted":1200,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.37931230140717204,"acs":6685,"articleLive":2,"columnArticles":86,"formTitle":"[432]全 O(1) 的数据结构","frequency":0.0,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","submitted":17624,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.5318914588965655,"acs":15936,"articleLive":2,"columnArticles":216,"formTitle":"[433]最小基因变化","frequency":0.0,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","submitted":29961,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.3990489824490594,"acs":63276,"articleLive":2,"columnArticles":875,"formTitle":"[434]字符串中的单词数","frequency":0.0,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"ac","submitted":158567,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.507437778144058,"acs":98516,"articleLive":2,"columnArticles":866,"formTitle":"[435]无重叠区间","frequency":0.0,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"ac","submitted":194144,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.48853750615527713,"acs":8929,"articleLive":2,"columnArticles":147,"formTitle":"[436]寻找右区间","frequency":0.0,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"ac","submitted":18277,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.574352339896411,"acs":125639,"articleLive":2,"columnArticles":1034,"formTitle":"[437]路径总和 III","frequency":0.0,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"ac","submitted":218749,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5188871682597319,"acs":97172,"articleLive":2,"columnArticles":853,"formTitle":"[438]找到字符串中所有字母异位词","frequency":0.0,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"ac","submitted":187270,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.590982940698619,"acs":2910,"articleLive":2,"columnArticles":68,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"lock","submitted":4924,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.3803503496662794,"acs":16697,"articleLive":2,"columnArticles":124,"formTitle":"[440]字典序的第K小数字","frequency":0.0,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","submitted":43899,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.45900980026851673,"acs":77608,"articleLive":2,"columnArticles":745,"formTitle":"[441]排列硬币","frequency":0.0,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"ac","submitted":169077,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6973952327546716,"acs":44150,"articleLive":2,"columnArticles":445,"formTitle":"[442]数组中重复的数据","frequency":0.0,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","submitted":63307,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.47733724172204955,"acs":56669,"articleLive":2,"columnArticles":694,"formTitle":"[443]压缩字符串","frequency":0.0,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"ac","submitted":118719,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.2523378141437756,"acs":3454,"articleLive":2,"columnArticles":54,"formTitle":"[444]序列重建","frequency":0.0,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"lock","submitted":13688,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5885230532822996,"acs":83492,"articleLive":2,"columnArticles":941,"formTitle":"[445]两数相加 II","frequency":0.0,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"ac","submitted":141867,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5510634658151338,"acs":19328,"articleLive":2,"columnArticles":173,"formTitle":"[446]等差数列划分 II - 子序列","frequency":0.0,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"ac","submitted":35074,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6629132791327913,"acs":48923,"articleLive":2,"columnArticles":378,"formTitle":"[447]回旋镖的数量","frequency":0.0,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"ac","submitted":73800,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6488786632271258,"acs":139603,"articleLive":2,"columnArticles":1102,"formTitle":"[448]找到所有数组中消失的数字","frequency":0.0,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","submitted":215145,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5587170757928687,"acs":15591,"articleLive":2,"columnArticles":137,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":0.0,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"","submitted":27905,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.48701879333605247,"acs":62091,"articleLive":2,"columnArticles":627,"formTitle":"[450]删除二叉搜索树中的节点","frequency":0.0,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","submitted":127492,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.711600777705768,"acs":82350,"articleLive":2,"columnArticles":955,"formTitle":"[451]根据字符出现频率排序","frequency":0.0,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"ac","submitted":115725,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5088491915808626,"acs":98444,"articleLive":2,"columnArticles":859,"formTitle":"[452]用最少数量的箭引爆气球","frequency":0.0,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"ac","submitted":193464,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.5566279535442531,"acs":27798,"articleLive":2,"columnArticles":315,"formTitle":"[453]最小操作次数使数组元素相等","frequency":0.0,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"","submitted":49940,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.6035335262904004,"acs":80072,"articleLive":2,"columnArticles":503,"formTitle":"[454]四数相加 II","frequency":0.0,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"ac","submitted":132672,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5769016964075855,"acs":154631,"articleLive":2,"columnArticles":1271,"formTitle":"[455]分发饼干","frequency":0.0,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"ac","submitted":268037,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.3625230878222807,"acs":57312,"articleLive":2,"columnArticles":463,"formTitle":"[456]132 模式","frequency":0.0,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"ac","submitted":158092,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.43608466726008177,"acs":28905,"articleLive":2,"columnArticles":332,"formTitle":"[457]环形数组是否存在循环","frequency":0.0,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"ac","submitted":66283,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6123363815671508,"acs":6830,"articleLive":2,"columnArticles":65,"formTitle":"[458]可怜的小猪","frequency":0.0,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","submitted":11154,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5111653563276692,"acs":80621,"articleLive":2,"columnArticles":649,"formTitle":"[459]重复的子字符串","frequency":0.0,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","submitted":157720,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.43763863039543127,"acs":34331,"articleLive":2,"columnArticles":405,"formTitle":"[460]LFU 缓存","frequency":0.0,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","submitted":78446,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8123276553534222,"acs":171155,"articleLive":2,"columnArticles":1366,"formTitle":"[461]汉明距离","frequency":0.0,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"ac","submitted":210697,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6053391053391053,"acs":14263,"articleLive":2,"columnArticles":133,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":0.0,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","submitted":23562,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7085539751676275,"acs":78410,"articleLive":2,"columnArticles":945,"formTitle":"[463]岛屿的周长","frequency":0.0,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","submitted":110662,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.35573496483648176,"acs":11280,"articleLive":2,"columnArticles":112,"formTitle":"[464]我能赢吗","frequency":0.0,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","submitted":31709,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.5302432610124918,"acs":1613,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.0,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"lock","submitted":3042,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.37401713790558105,"acs":11654,"articleLive":2,"columnArticles":181,"formTitle":"[466]统计重复个数","frequency":0.0,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","submitted":31159,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.44173495902458526,"acs":8840,"articleLive":2,"columnArticles":114,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":0.0,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","submitted":20012,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.25165990776081426,"acs":25319,"articleLive":2,"columnArticles":299,"formTitle":"[468]验证IP地址","frequency":0.0,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","submitted":100608,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.434331797235023,"acs":1508,"articleLive":2,"columnArticles":21,"formTitle":"[469]凸多边形","frequency":0.0,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"lock","submitted":3472,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.5470428963097934,"acs":64248,"articleLive":2,"columnArticles":337,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":0.0,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"ac","submitted":117446,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6181818181818182,"acs":1360,"articleLive":2,"columnArticles":25,"formTitle":"[471]编码最短长度的字符串","frequency":0.0,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"lock","submitted":2200,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.39833602681510744,"acs":6655,"articleLive":2,"columnArticles":81,"formTitle":"[472]连接词","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","submitted":16707,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.4202121344045593,"acs":21235,"articleLive":2,"columnArticles":182,"formTitle":"[473]火柴拼正方形","frequency":0.0,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","submitted":50534,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.612214917033933,"acs":76263,"articleLive":2,"columnArticles":608,"formTitle":"[474]一和零","frequency":0.0,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"ac","submitted":124569,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.33482361587457127,"acs":21868,"articleLive":2,"columnArticles":244,"formTitle":"[475]供暖器","frequency":0.0,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","submitted":65312,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7011614657992429,"acs":38153,"articleLive":2,"columnArticles":490,"formTitle":"[476]数字的补数","frequency":0.0,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"","submitted":54414,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6039070602622251,"acs":39013,"articleLive":2,"columnArticles":329,"formTitle":"[477]汉明距离总和","frequency":0.0,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"ac","submitted":64601,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.43827039718254746,"acs":6720,"articleLive":2,"columnArticles":49,"formTitle":"[478]在圆内随机生成点","frequency":0.0,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","submitted":15333,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.4198752711496746,"acs":3097,"articleLive":2,"columnArticles":25,"formTitle":"[479]最大回文数乘积","frequency":0.0,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"ac","submitted":7376,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.4478641509433962,"acs":29671,"articleLive":2,"columnArticles":405,"formTitle":"[480]滑动窗口中位数","frequency":0.0,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"ac","submitted":66250,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.5415440129142531,"acs":5703,"articleLive":2,"columnArticles":98,"formTitle":"[481]神奇字符串","frequency":0.0,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","submitted":10531,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.472257855747784,"acs":40864,"articleLive":2,"columnArticles":435,"formTitle":"[482]密钥格式化","frequency":0.0,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"ac","submitted":86529,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5906594447180031,"acs":15594,"articleLive":2,"columnArticles":117,"formTitle":"[483]最小好进制","frequency":0.0,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"notac","submitted":26401,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6361674579197237,"acs":1474,"articleLive":2,"columnArticles":34,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"lock","submitted":2317,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6071981651735832,"acs":123900,"articleLive":2,"columnArticles":999,"formTitle":"[485]最大连续 1 的个数","frequency":0.0,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","submitted":204052,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5864781853427657,"acs":46591,"articleLive":2,"columnArticles":404,"formTitle":"[486]预测赢家","frequency":0.0,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"ac","submitted":79442,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5786005039736383,"acs":5970,"articleLive":2,"columnArticles":115,"formTitle":"[487]最大连续1的个数 II","frequency":0.0,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"lock","submitted":10318,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.3880171184022825,"acs":3536,"articleLive":2,"columnArticles":73,"formTitle":"[488]祖玛游戏","frequency":0.0,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"","submitted":9113,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.7207563764291997,"acs":1639,"articleLive":2,"columnArticles":24,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"lock","submitted":2274,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.4840628984275393,"acs":6834,"articleLive":2,"columnArticles":82,"formTitle":"[490]迷宫","frequency":0.0,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"lock","submitted":14118,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.5457449700924415,"acs":48174,"articleLive":2,"columnArticles":408,"formTitle":"[491]递增子序列","frequency":0.0,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"ac","submitted":88272,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.5522959897085967,"acs":19749,"articleLive":2,"columnArticles":185,"formTitle":"[492]构造矩形","frequency":0.0,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","submitted":35758,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.34591211302721797,"acs":26638,"articleLive":2,"columnArticles":268,"formTitle":"[493]翻转对","frequency":0.0,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","submitted":77008,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.49294682744519136,"acs":152605,"articleLive":2,"columnArticles":1051,"formTitle":"[494]目标和","frequency":0.0,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"ac","submitted":309577,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.5431398170617883,"acs":29096,"articleLive":2,"columnArticles":444,"formTitle":"[495]提莫攻击","frequency":0.0,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"","submitted":53570,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.6873925331541396,"acs":104340,"articleLive":2,"columnArticles":1079,"formTitle":"[496]下一个更大元素 I","frequency":0.0,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"ac","submitted":151791,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.40399406287950346,"acs":2994,"articleLive":2,"columnArticles":36,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.0,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","submitted":7411,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.46941769245487597,"acs":44160,"articleLive":2,"columnArticles":456,"formTitle":"[498]对角线遍历","frequency":0.0,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","submitted":94074,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.37256003370313157,"acs":2653,"articleLive":2,"columnArticles":49,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"lock","submitted":7121,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.7093919367010451,"acs":31021,"articleLive":2,"columnArticles":484,"formTitle":"[500]键盘行","frequency":0.0,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"","submitted":43729,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5133179012345679,"acs":66526,"articleLive":2,"columnArticles":550,"formTitle":"[501]二叉搜索树中的众数","frequency":0.0,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","submitted":129600,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.44135899863258654,"acs":29372,"articleLive":2,"columnArticles":357,"formTitle":"[502]IPO","frequency":0.0,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"ac","submitted":66549,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6361155874597129,"acs":104211,"articleLive":2,"columnArticles":989,"formTitle":"[503]下一个更大元素 II","frequency":0.0,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"ac","submitted":163824,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5037503847586956,"acs":31095,"articleLive":2,"columnArticles":329,"formTitle":"[504]七进制数","frequency":0.0,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","submitted":61727,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.48430034129692834,"acs":5676,"articleLive":2,"columnArticles":69,"formTitle":"[505]迷宫 II","frequency":0.0,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"lock","submitted":11720,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.5631087923102625,"acs":21910,"articleLive":2,"columnArticles":297,"formTitle":"[506]相对名次","frequency":0.0,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","submitted":38909,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.41259341267644617,"acs":29814,"articleLive":2,"columnArticles":236,"formTitle":"[507]完美数","frequency":0.0,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","submitted":72260,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6776481354381149,"acs":14810,"articleLive":2,"columnArticles":212,"formTitle":"[508]出现次数最多的子树元素和","frequency":0.0,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","submitted":21855,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6741916297177463,"acs":249370,"articleLive":2,"columnArticles":1510,"formTitle":"[509]斐波那契数","frequency":0.0,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"ac","submitted":369880,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6077093323496865,"acs":3295,"articleLive":2,"columnArticles":55,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":0.0,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"lock","submitted":5422,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7321588868940754,"acs":19575,"articleLive":2,"columnArticles":108,"formTitle":"[511]游戏玩法分析 I","frequency":0.0,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"lock","submitted":26736,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5378951674165838,"acs":18410,"articleLive":2,"columnArticles":150,"formTitle":"[512]游戏玩法分析 II","frequency":0.0,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"lock","submitted":34226,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7309928349216628,"acs":51929,"articleLive":2,"columnArticles":578,"formTitle":"[513]找树左下角的值","frequency":0.0,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","submitted":71039,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.5000252946830577,"acs":19768,"articleLive":2,"columnArticles":244,"formTitle":"[514]自由之路","frequency":0.0,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","submitted":39534,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.6448792809342606,"acs":39317,"articleLive":2,"columnArticles":427,"formTitle":"[515]在每个树行中找最大值","frequency":0.0,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","submitted":60968,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6544573121465123,"acs":87480,"articleLive":2,"columnArticles":630,"formTitle":"[516]最长回文子序列","frequency":0.0,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"ac","submitted":133668,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.5099129145821752,"acs":19264,"articleLive":2,"columnArticles":167,"formTitle":"[517]超级洗衣机","frequency":0.0,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"ac","submitted":37779,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.657775221387401,"acs":109784,"articleLive":2,"columnArticles":690,"formTitle":"[518]零钱兑换 II","frequency":0.0,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"ac","submitted":166902,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.39770582256425147,"acs":2739,"articleLive":2,"columnArticles":39,"formTitle":"[519]随机翻转矩阵","frequency":0.0,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","submitted":6887,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5639602966597892,"acs":40454,"articleLive":2,"columnArticles":653,"formTitle":"[520]检测大写字母","frequency":0.0,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"","submitted":71732,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7134695242607508,"acs":25600,"articleLive":2,"columnArticles":254,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":0.0,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","submitted":35881,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.36222584547414927,"acs":6887,"articleLive":2,"columnArticles":108,"formTitle":"[522]最长特殊序列 II","frequency":0.0,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","submitted":19013,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.27466261393351876,"acs":69218,"articleLive":2,"columnArticles":607,"formTitle":"[523]连续的子数组和","frequency":0.0,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"ac","submitted":252011,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.49571139233623773,"acs":72936,"articleLive":2,"columnArticles":759,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":0.0,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"ac","submitted":147134,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5359670297321166,"acs":45517,"articleLive":2,"columnArticles":518,"formTitle":"[525]连续数组","frequency":0.0,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"ac","submitted":84925,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7350082644628099,"acs":33351,"articleLive":2,"columnArticles":381,"formTitle":"[526]优美的排列","frequency":0.0,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"ac","submitted":45375,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5784908933217693,"acs":2001,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"lock","submitted":3459,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.4770792354239553,"acs":31773,"articleLive":2,"columnArticles":258,"formTitle":"[528]按权重随机选择","frequency":0.0,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"ac","submitted":66599,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6450850967449686,"acs":39874,"articleLive":2,"columnArticles":464,"formTitle":"[529]扫雷游戏","frequency":0.0,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","submitted":61812,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6211127763207194,"acs":79572,"articleLive":2,"columnArticles":642,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":0.0,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"ac","submitted":128112,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6587971738755816,"acs":3823,"articleLive":2,"columnArticles":78,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"lock","submitted":5803,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.37531504601137095,"acs":25613,"articleLive":2,"columnArticles":279,"formTitle":"[532]数组中的 k-diff 数对","frequency":0.0,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","submitted":68244,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5261813537675607,"acs":1648,"articleLive":2,"columnArticles":34,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"lock","submitted":3132,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6752132789317508,"acs":14563,"articleLive":2,"columnArticles":140,"formTitle":"[534]游戏玩法分析 III","frequency":0.0,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"lock","submitted":21568,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.842325187771078,"acs":15925,"articleLive":2,"columnArticles":104,"formTitle":"[535]TinyURL 的加密与解密","frequency":0.0,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","submitted":18906,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5388223032829599,"acs":3102,"articleLive":2,"columnArticles":50,"formTitle":"[536]从字符串生成二叉树","frequency":0.0,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"lock","submitted":5757,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7123511275013602,"acs":11783,"articleLive":2,"columnArticles":175,"formTitle":"[537]复数乘法","frequency":0.0,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","submitted":16541,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.7016824588905037,"acs":110562,"articleLive":2,"columnArticles":843,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":0.0,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","submitted":157567,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5981324135610331,"acs":14220,"articleLive":2,"columnArticles":191,"formTitle":"[539]最小时间差","frequency":0.0,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","submitted":23774,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5823908929715554,"acs":39086,"articleLive":2,"columnArticles":410,"formTitle":"[540]有序数组中的单一元素","frequency":0.0,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"ac","submitted":67113,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6069548624819056,"acs":73796,"articleLive":2,"columnArticles":810,"formTitle":"[541]反转字符串 II","frequency":0.0,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"ac","submitted":121584,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.45802866335185727,"acs":70470,"articleLive":2,"columnArticles":650,"formTitle":"[542]01 矩阵","frequency":0.0,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"ac","submitted":153855,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.5529580447828002,"acs":151949,"articleLive":2,"columnArticles":1245,"formTitle":"[543]二叉树的直径","frequency":0.0,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","submitted":274793,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.71124150710315,"acs":2303,"articleLive":2,"columnArticles":53,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"lock","submitted":3238,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.41901877649909147,"acs":3459,"articleLive":2,"columnArticles":79,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"lock","submitted":8255,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6285583865880986,"acs":15147,"articleLive":2,"columnArticles":121,"formTitle":"[546]移除盒子","frequency":0.0,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","submitted":24098,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6188875282663081,"acs":164759,"articleLive":2,"columnArticles":1157,"formTitle":"[547]省份数量","frequency":0.0,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"ac","submitted":266218,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.3550645373003719,"acs":1623,"articleLive":2,"columnArticles":40,"formTitle":"[548]将数组分割成和相等的子数组","frequency":0.0,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","questionId":"548","status":"lock","submitted":4571,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.4818423383525244,"acs":2176,"articleLive":2,"columnArticles":53,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"lock","submitted":4516,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.43832441460172467,"acs":12860,"articleLive":2,"columnArticles":180,"formTitle":"[550]游戏玩法分析 IV","frequency":0.0,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"lock","submitted":29339,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.5677327005658401,"acs":59097,"articleLive":2,"columnArticles":760,"formTitle":"[551]学生出勤记录 I","frequency":0.0,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"ac","submitted":104093,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5776077151904807,"acs":24077,"articleLive":2,"columnArticles":287,"formTitle":"[552]学生出勤记录 II","frequency":0.0,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"ac","submitted":41684,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6052364522021514,"acs":5964,"articleLive":2,"columnArticles":87,"formTitle":"[553]最优除法","frequency":0.0,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","submitted":9854,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.503237712526071,"acs":46085,"articleLive":2,"columnArticles":487,"formTitle":"[554]砖墙","frequency":0.0,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"ac","submitted":91577,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.34375,"acs":1111,"articleLive":2,"columnArticles":23,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"lock","submitted":3232,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.3258972943125345,"acs":14755,"articleLive":2,"columnArticles":215,"formTitle":"[556]下一个更大元素 III","frequency":0.0,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","submitted":45275,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7450393956917739,"acs":164910,"articleLive":2,"columnArticles":1367,"formTitle":"[557]反转字符串中的单词 III","frequency":0.0,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"ac","submitted":221344,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5048209366391184,"acs":2932,"articleLive":2,"columnArticles":39,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","questionId":"773","status":"","submitted":5808,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7282571553136084,"acs":61805,"articleLive":2,"columnArticles":553,"formTitle":"[559]N 叉树的最大深度","frequency":0.0,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","submitted":84867,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.4465399097810925,"acs":153336,"articleLive":2,"columnArticles":942,"formTitle":"[560]和为 K 的子数组","frequency":0.0,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","submitted":343387,"title":"和为 K 的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7749420747086636,"acs":90638,"articleLive":2,"columnArticles":755,"formTitle":"[561]数组拆分 I","frequency":0.0,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"ac","submitted":116961,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.4667459845330161,"acs":3923,"articleLive":2,"columnArticles":64,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.0,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"lock","submitted":8405,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.6064193584358621,"acs":32629,"articleLive":2,"columnArticles":328,"formTitle":"[563]二叉树的坡度","frequency":0.0,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","submitted":53806,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.1797473430920393,"acs":4482,"articleLive":2,"columnArticles":77,"formTitle":"[564]寻找最近的回文数","frequency":0.0,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"notac","submitted":24935,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6107160995429152,"acs":14430,"articleLive":2,"columnArticles":140,"formTitle":"[565]数组嵌套","frequency":0.0,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","submitted":23628,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.6878126155582803,"acs":70681,"articleLive":2,"columnArticles":657,"formTitle":"[566]重塑矩阵","frequency":0.0,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"ac","submitted":102762,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.43220269484883816,"acs":121216,"articleLive":2,"columnArticles":1100,"formTitle":"[567]字符串的排列","frequency":0.0,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"ac","submitted":280461,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.5087048832271762,"acs":1198,"articleLive":2,"columnArticles":26,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"lock","submitted":2355,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.565478551595172,"acs":9979,"articleLive":2,"columnArticles":157,"formTitle":"[569]员工薪水中位数","frequency":0.0,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"lock","submitted":17647,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6612756033258974,"acs":13043,"articleLive":2,"columnArticles":114,"formTitle":"[570]至少有5名直接下属的经理","frequency":0.0,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"lock","submitted":19724,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.48786012599985845,"acs":6892,"articleLive":2,"columnArticles":96,"formTitle":"[571]给定数字的频率查询中位数","frequency":0.0,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"lock","submitted":14127,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.47337858429145313,"acs":85433,"articleLive":2,"columnArticles":744,"formTitle":"[572]另一棵树的子树","frequency":0.0,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"ac","submitted":180475,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6621621621621622,"acs":1029,"articleLive":2,"columnArticles":31,"formTitle":"[573]松鼠模拟","frequency":0.0,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"lock","submitted":1554,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.6482793522267206,"acs":12810,"articleLive":2,"columnArticles":114,"formTitle":"[574]当选者","frequency":0.0,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"lock","submitted":19760,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.6836623857900453,"acs":42800,"articleLive":2,"columnArticles":443,"formTitle":"[575]分糖果","frequency":0.0,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"","submitted":62604,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.4684261833411561,"acs":25948,"articleLive":2,"columnArticles":282,"formTitle":"[576]出界的路径数","frequency":0.0,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"ac","submitted":55394,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.7016014316523654,"acs":15290,"articleLive":2,"columnArticles":86,"formTitle":"[577]员工奖金","frequency":0.0,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"lock","submitted":21793,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.49611981612377043,"acs":10037,"articleLive":2,"columnArticles":113,"formTitle":"[578]查询回答率最高的问题","frequency":0.0,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"lock","submitted":20231,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.4111704355108878,"acs":7855,"articleLive":2,"columnArticles":132,"formTitle":"[579]查询员工的累计薪水","frequency":0.0,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"lock","submitted":19104,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5237238472215082,"acs":10188,"articleLive":2,"columnArticles":81,"formTitle":"[580]统计各专业学生人数","frequency":0.0,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"lock","submitted":19453,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.4050944780105115,"acs":99968,"articleLive":2,"columnArticles":866,"formTitle":"[581]最短无序连续子数组","frequency":0.0,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"ac","submitted":246777,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.4087856743144936,"acs":8766,"articleLive":2,"columnArticles":134,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"lock","submitted":21444,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.6196626283940287,"acs":51098,"articleLive":2,"columnArticles":494,"formTitle":"[583]两个字符串的删除操作","frequency":0.0,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"ac","submitted":82461,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7745806021553161,"acs":13944,"articleLive":2,"columnArticles":62,"formTitle":"[584]寻找用户推荐人","frequency":0.0,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"lock","submitted":18002,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.5948305972755851,"acs":8515,"articleLive":2,"columnArticles":102,"formTitle":"[585]2016年的投资","frequency":0.0,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"lock","submitted":14315,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7456813819577736,"acs":14763,"articleLive":2,"columnArticles":88,"formTitle":"[586]订单最多的客户","frequency":0.0,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"lock","submitted":19798,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.38497150997151,"acs":2162,"articleLive":2,"columnArticles":38,"formTitle":"[587]安装栅栏","frequency":0.0,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","submitted":5616,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.4258836944127708,"acs":1494,"articleLive":2,"columnArticles":29,"formTitle":"[588]设计内存文件系统","frequency":0.0,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"lock","submitted":3508,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7455359379958909,"acs":89266,"articleLive":2,"columnArticles":568,"formTitle":"[589]N 叉树的前序遍历","frequency":0.0,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","submitted":119734,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7615342927681098,"acs":63234,"articleLive":2,"columnArticles":467,"formTitle":"[590]N 叉树的后序遍历","frequency":0.0,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","submitted":83035,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.33994708994708994,"acs":1799,"articleLive":2,"columnArticles":41,"formTitle":"[591]标签验证器","frequency":0.0,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"ac","submitted":5292,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5228268388286834,"acs":4535,"articleLive":2,"columnArticles":111,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","submitted":8674,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.44274409098055656,"acs":8448,"articleLive":2,"columnArticles":136,"formTitle":"[593]有效的正方形","frequency":0.0,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","submitted":19081,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5183279067324861,"acs":29610,"articleLive":2,"columnArticles":272,"formTitle":"[594]最长和谐子序列","frequency":0.0,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","submitted":57126,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.7968745216885542,"acs":104126,"articleLive":2,"columnArticles":239,"formTitle":"[595]大的国家","frequency":0.0,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","submitted":130668,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.42120602139963226,"acs":82235,"articleLive":2,"columnArticles":291,"formTitle":"[596]超过5名学生的课","frequency":0.0,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","submitted":195237,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.4416656140794072,"acs":10490,"articleLive":2,"columnArticles":84,"formTitle":"[597]好友申请 I：总体通过率","frequency":0.0,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"lock","submitted":23751,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5178944701336543,"acs":16352,"articleLive":2,"columnArticles":211,"formTitle":"[598]范围求和 II","frequency":0.0,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","submitted":31574,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5221382771615853,"acs":29234,"articleLive":2,"columnArticles":276,"formTitle":"[599]两个列表的最小索引总和","frequency":0.0,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"ac","submitted":55989,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.48134756371253307,"acs":19303,"articleLive":2,"columnArticles":230,"formTitle":"[600]不含连续1的非负整数","frequency":0.0,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"ac","submitted":40102,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.5013118411336821,"acs":31909,"articleLive":2,"columnArticles":379,"formTitle":"[601]体育馆的人流量","frequency":0.0,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","submitted":63651,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.629507694663502,"acs":8222,"articleLive":2,"columnArticles":89,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":0.0,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"lock","submitted":13061,"title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6707838232228476,"acs":12871,"articleLive":2,"columnArticles":114,"formTitle":"[603]连续空余座位","frequency":0.0,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"lock","submitted":19188,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.3738048262255274,"acs":2463,"articleLive":2,"columnArticles":56,"formTitle":"[604]迭代压缩字符串","frequency":0.0,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"lock","submitted":6589,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.33369160434769446,"acs":110215,"articleLive":2,"columnArticles":1269,"formTitle":"[605]种花问题","frequency":0.0,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","submitted":330290,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.5689450575531031,"acs":28767,"articleLive":2,"columnArticles":315,"formTitle":"[606]根据二叉树创建字符串","frequency":0.0,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","submitted":50562,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6600850056491095,"acs":12269,"articleLive":2,"columnArticles":86,"formTitle":"[607]销售员","frequency":0.0,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"lock","submitted":18587,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.656595744680851,"acs":7715,"articleLive":2,"columnArticles":102,"formTitle":"[608]树节点","frequency":0.0,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"lock","submitted":11750,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.48446609106339017,"acs":6565,"articleLive":2,"columnArticles":102,"formTitle":"[609]在系统中查找重复文件","frequency":0.0,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","submitted":13551,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6648093658047955,"acs":10619,"articleLive":2,"columnArticles":73,"formTitle":"[610]判断三角形","frequency":0.0,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"lock","submitted":15973,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.5319387178467527,"acs":50831,"articleLive":2,"columnArticles":397,"formTitle":"[611]有效三角形的个数","frequency":0.0,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"ac","submitted":95558,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6698628909400484,"acs":7475,"articleLive":2,"columnArticles":65,"formTitle":"[612]平面上的最近距离","frequency":0.0,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"lock","submitted":11159,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8170774036792781,"acs":11770,"articleLive":2,"columnArticles":81,"formTitle":"[613]直线上的最近距离","frequency":0.0,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"lock","submitted":14405,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.34672375435503505,"acs":8260,"articleLive":2,"columnArticles":68,"formTitle":"[614]二级关注者","frequency":0.0,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"lock","submitted":23823,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.4249742655792224,"acs":5367,"articleLive":2,"columnArticles":92,"formTitle":"[615]平均工资：部门与公司比较","frequency":0.0,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"lock","submitted":12629,"title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.4625916194164016,"acs":3345,"articleLive":2,"columnArticles":56,"formTitle":"[616]给字符串添加加粗标签","frequency":0.0,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"lock","submitted":7231,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7879466214575815,"acs":191486,"articleLive":2,"columnArticles":1261,"formTitle":"[617]合并二叉树","frequency":0.0,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"ac","submitted":243019,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6200873362445415,"acs":4686,"articleLive":2,"columnArticles":46,"formTitle":"[618]学生地理信息报告","frequency":0.0,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"lock","submitted":7557,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.4662496953943628,"acs":11480,"articleLive":2,"columnArticles":80,"formTitle":"[619]只出现一次的最大数字","frequency":0.0,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"lock","submitted":24622,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7735914304298782,"acs":93955,"articleLive":2,"columnArticles":311,"formTitle":"[620]有趣的电影","frequency":0.0,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","submitted":121453,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.5711741055524454,"acs":78561,"articleLive":2,"columnArticles":503,"formTitle":"[621]任务调度器","frequency":0.0,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","submitted":137543,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.4377310735062216,"acs":66065,"articleLive":2,"columnArticles":427,"formTitle":"[622]设计循环队列","frequency":0.0,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"ac","submitted":150926,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5458251473477407,"acs":11113,"articleLive":2,"columnArticles":192,"formTitle":"[623]在二叉树中增加一行","frequency":0.0,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","submitted":20360,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.4205803741886216,"acs":2203,"articleLive":2,"columnArticles":50,"formTitle":"[624]数组列表中的最大距离","frequency":0.0,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"lock","submitted":5238,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.3433038749150238,"acs":2525,"articleLive":2,"columnArticles":55,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"lock","submitted":7355,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.6841750841750842,"acs":45720,"articleLive":2,"columnArticles":357,"formTitle":"[626]换座位","frequency":0.0,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","submitted":66825,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.8080698030449606,"acs":86036,"articleLive":2,"columnArticles":343,"formTitle":"[627]变更性别","frequency":0.0,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","submitted":106471,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5246447717691146,"acs":80640,"articleLive":2,"columnArticles":768,"formTitle":"[628]三个数的最大乘积","frequency":0.0,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"ac","submitted":153704,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.40664911767573364,"acs":4171,"articleLive":2,"columnArticles":58,"formTitle":"[629]K个逆序对数组","frequency":0.0,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"","submitted":10257,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.368107302533532,"acs":6422,"articleLive":2,"columnArticles":76,"formTitle":"[630]课程表 III","frequency":0.0,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","submitted":17446,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.2889300847457627,"acs":1091,"articleLive":2,"columnArticles":35,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"lock","submitted":3776,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5980977659809776,"acs":18928,"articleLive":2,"columnArticles":239,"formTitle":"[632]最小区间","frequency":0.0,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","submitted":31647,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.39757234030931865,"acs":94625,"articleLive":2,"columnArticles":771,"formTitle":"[633]平方数之和","frequency":0.0,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"ac","submitted":238007,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.4403728704596593,"acs":1370,"articleLive":2,"columnArticles":21,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"lock","submitted":3111,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.5521339816315505,"acs":4088,"articleLive":2,"columnArticles":68,"formTitle":"[635]设计日志存储系统","frequency":0.0,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"lock","submitted":7404,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.5529575892857143,"acs":9909,"articleLive":2,"columnArticles":113,"formTitle":"[636]函数的独占时间","frequency":0.0,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"ac","submitted":17920,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6901232314011867,"acs":75603,"articleLive":2,"columnArticles":656,"formTitle":"[637]二叉树的层平均值","frequency":0.0,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","submitted":109550,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.592388788891746,"acs":11519,"articleLive":2,"columnArticles":119,"formTitle":"[638]大礼包","frequency":0.0,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"","submitted":19445,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.3768091583095225,"acs":20177,"articleLive":2,"columnArticles":273,"formTitle":"[639]解码方法 II","frequency":0.0,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"ac","submitted":53547,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.4250448482957648,"acs":10899,"articleLive":2,"columnArticles":213,"formTitle":"[640]求解方程","frequency":0.0,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","submitted":25642,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5331346078044935,"acs":21641,"articleLive":2,"columnArticles":242,"formTitle":"[641]设计循环双端队列","frequency":0.0,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","submitted":40592,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.4897999603881957,"acs":2473,"articleLive":2,"columnArticles":56,"formTitle":"[642]设计搜索自动补全系统","frequency":0.0,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"lock","submitted":5049,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.4505395809652114,"acs":64210,"articleLive":2,"columnArticles":574,"formTitle":"[643]子数组最大平均数 I","frequency":0.0,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","submitted":142518,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.4022307424189613,"acs":1154,"articleLive":2,"columnArticles":24,"formTitle":"[644]子数组最大平均数 II","frequency":0.0,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"lock","submitted":2869,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.43358526572171097,"acs":69071,"articleLive":2,"columnArticles":697,"formTitle":"[645]错误的集合","frequency":0.0,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"ac","submitted":159302,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5779107390478146,"acs":22505,"articleLive":2,"columnArticles":202,"formTitle":"[646]最长数对链","frequency":0.0,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","submitted":38942,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.656843952554306,"acs":125760,"articleLive":2,"columnArticles":925,"formTitle":"[647]回文子串","frequency":0.0,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","submitted":191461,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.584752437600152,"acs":21530,"articleLive":2,"columnArticles":281,"formTitle":"[648]单词替换","frequency":0.0,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","submitted":36819,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.48178084225458984,"acs":29207,"articleLive":2,"columnArticles":309,"formTitle":"[649]Dota2 参议院","frequency":0.0,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","submitted":60623,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5671682909191088,"acs":49410,"articleLive":2,"columnArticles":656,"formTitle":"[650]只有两个键的键盘","frequency":0.0,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"ac","submitted":87117,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.5841538461538461,"acs":3797,"articleLive":2,"columnArticles":63,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"lock","submitted":6500,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.5713841099680125,"acs":33046,"articleLive":2,"columnArticles":238,"formTitle":"[652]寻找重复的子树","frequency":0.0,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"ac","submitted":57835,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.5984610552763819,"acs":41921,"articleLive":2,"columnArticles":397,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"","submitted":70048,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.8108338664960546,"acs":60832,"articleLive":2,"columnArticles":618,"formTitle":"[654]最大二叉树","frequency":0.0,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","submitted":75024,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.5977899164940039,"acs":9521,"articleLive":2,"columnArticles":143,"formTitle":"[655]输出二叉树","frequency":0.0,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","submitted":15927,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.3081669691470054,"acs":849,"articleLive":2,"columnArticles":25,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"lock","submitted":2755,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.7834166175827935,"acs":82464,"articleLive":2,"columnArticles":629,"formTitle":"[657]机器人能否返回原点","frequency":0.0,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","submitted":105262,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.45473910199426376,"acs":27112,"articleLive":2,"columnArticles":242,"formTitle":"[658]找到 K 个最接近的元素","frequency":0.0,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","submitted":59621,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.5419781975914617,"acs":28488,"articleLive":2,"columnArticles":261,"formTitle":"[659]分割数组为连续子序列","frequency":0.0,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","submitted":52563,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.6563380281690141,"acs":699,"articleLive":2,"columnArticles":23,"formTitle":"[660]移除 9","frequency":0.0,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"lock","submitted":1065,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5611363254328459,"acs":16691,"articleLive":2,"columnArticles":214,"formTitle":"[661]图片平滑器","frequency":0.0,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","submitted":29745,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.40944594803045814,"acs":29198,"articleLive":2,"columnArticles":278,"formTitle":"[662]二叉树最大宽度","frequency":0.0,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","submitted":71311,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.46459143968871597,"acs":1791,"articleLive":2,"columnArticles":36,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"lock","submitted":3855,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.6536164172925661,"acs":22104,"articleLive":2,"columnArticles":190,"formTitle":"[664]奇怪的打印机","frequency":0.0,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"ac","submitted":33818,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.27083618103466883,"acs":75293,"articleLive":2,"columnArticles":943,"formTitle":"[665]非递减数列","frequency":0.0,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","questionId":"665","status":"","submitted":278002,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6189785258270458,"acs":2133,"articleLive":2,"columnArticles":76,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"lock","submitted":3446,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.6243509261412075,"acs":8056,"articleLive":2,"columnArticles":121,"formTitle":"[667]优美的排列 II","frequency":0.0,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","submitted":12903,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5087537859200709,"acs":6887,"articleLive":2,"columnArticles":68,"formTitle":"[668]乘法表中第k小的数","frequency":0.0,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","submitted":13537,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6655919431966382,"acs":36746,"articleLive":2,"columnArticles":309,"formTitle":"[669]修剪二叉搜索树","frequency":0.0,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","submitted":55208,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.45208793273521536,"acs":19249,"articleLive":2,"columnArticles":286,"formTitle":"[670]最大交换","frequency":0.0,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","submitted":42578,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.4857644164676941,"acs":53710,"articleLive":2,"columnArticles":674,"formTitle":"[671]二叉树中第二小的节点","frequency":0.0,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"ac","submitted":110568,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5475837533353098,"acs":3694,"articleLive":2,"columnArticles":42,"formTitle":"[672]灯泡开关 Ⅱ","frequency":0.0,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","submitted":6746,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.4354697901131279,"acs":47886,"articleLive":2,"columnArticles":418,"formTitle":"[673]最长递增子序列的个数","frequency":0.0,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"ac","submitted":109964,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.4973154861893725,"acs":93553,"articleLive":2,"columnArticles":775,"formTitle":"[674]最长连续递增序列","frequency":0.0,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","submitted":188116,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.40112529161520516,"acs":2923,"articleLive":2,"columnArticles":48,"formTitle":"[675]为高尔夫比赛砍树","frequency":0.0,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","submitted":7287,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5889331274884212,"acs":7248,"articleLive":2,"columnArticles":131,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","submitted":12307,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6179756818928689,"acs":15044,"articleLive":2,"columnArticles":253,"formTitle":"[677]键值映射","frequency":0.0,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","submitted":24344,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.3857349134515487,"acs":43811,"articleLive":2,"columnArticles":479,"formTitle":"[678]有效的括号字符串","frequency":0.0,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"ac","submitted":113578,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5415844668258748,"acs":26080,"articleLive":2,"columnArticles":263,"formTitle":"[679]24 点游戏","frequency":0.0,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","submitted":48155,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.40164499063154413,"acs":87459,"articleLive":2,"columnArticles":829,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":0.0,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","submitted":217752,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5034735623311463,"acs":2609,"articleLive":2,"columnArticles":63,"formTitle":"[681]最近时刻","frequency":0.0,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"lock","submitted":5182,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6952104717392285,"acs":46260,"articleLive":2,"columnArticles":511,"formTitle":"[682]棒球比赛","frequency":0.0,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"ac","submitted":66541,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.4347319347319347,"acs":2238,"articleLive":2,"columnArticles":51,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"lock","submitted":5148,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.665810590361977,"acs":60405,"articleLive":2,"columnArticles":609,"formTitle":"[684]冗余连接","frequency":0.0,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","submitted":90724,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.431053319337632,"acs":20122,"articleLive":2,"columnArticles":253,"formTitle":"[685]冗余连接 II","frequency":0.0,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","submitted":46681,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.3563371343173583,"acs":17406,"articleLive":2,"columnArticles":197,"formTitle":"[686]重复叠加字符串匹配","frequency":0.0,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","submitted":48847,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.44146377859659997,"acs":38459,"articleLive":2,"columnArticles":273,"formTitle":"[687]最长同值路径","frequency":0.0,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","submitted":87117,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5108551174124945,"acs":8071,"articleLive":2,"columnArticles":106,"formTitle":"[688]“马”在棋盘上的概率","frequency":0.0,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","submitted":15799,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.4886280264123258,"acs":3330,"articleLive":2,"columnArticles":70,"formTitle":"[689]三个无重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","submitted":6815,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.647866222585887,"acs":56216,"articleLive":2,"columnArticles":571,"formTitle":"[690]员工的重要性","frequency":0.0,"frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","questionId":"690","status":"ac","submitted":86771,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.49260816492608167,"acs":3632,"articleLive":2,"columnArticles":48,"formTitle":"[691]贴纸拼词","frequency":0.0,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","submitted":7373,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.577684270885158,"acs":68507,"articleLive":2,"columnArticles":742,"formTitle":"[692]前K个高频单词","frequency":0.0,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"ac","submitted":118589,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6096988021863007,"acs":26214,"articleLive":2,"columnArticles":285,"formTitle":"[693]交替位二进制数","frequency":0.0,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","submitted":42995,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5353509000782677,"acs":4104,"articleLive":2,"columnArticles":79,"formTitle":"[694]不同岛屿的数量","frequency":0.0,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"lock","submitted":7666,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.665289485219652,"acs":132042,"articleLive":2,"columnArticles":1308,"formTitle":"[695]岛屿的最大面积","frequency":0.0,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"ac","submitted":198473,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6315732473346009,"acs":52485,"articleLive":2,"columnArticles":477,"formTitle":"[696]计数二进制子串","frequency":0.0,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","submitted":83102,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.6047747275585997,"acs":66928,"articleLive":2,"columnArticles":850,"formTitle":"[697]数组的度","frequency":0.0,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","submitted":110666,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.4468059966029097,"acs":30251,"articleLive":2,"columnArticles":219,"formTitle":"[698]划分为k个相等的子集","frequency":0.0,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","submitted":67705,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.47805965032567704,"acs":2789,"articleLive":2,"columnArticles":41,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","submitted":5834,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.7608149926515559,"acs":83345,"articleLive":2,"columnArticles":528,"formTitle":"[700]二叉搜索树中的搜索","frequency":0.0,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"","submitted":109547,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7230659683509317,"acs":77175,"articleLive":2,"columnArticles":572,"formTitle":"[701]二叉搜索树中的插入操作","frequency":0.0,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"","submitted":106733,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7424472573839662,"acs":4399,"articleLive":2,"columnArticles":77,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"786","status":"lock","submitted":5925,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5130953388038237,"acs":60653,"articleLive":2,"columnArticles":554,"formTitle":"[703]数据流中的第 K 大元素","frequency":0.0,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","submitted":118210,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.5548839261219981,"acs":299351,"articleLive":2,"columnArticles":1484,"formTitle":"[704]二分查找","frequency":0.0,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"ac","submitted":539484,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6450581146300368,"acs":67764,"articleLive":2,"columnArticles":434,"formTitle":"[705]设计哈希集合","frequency":0.0,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"ac","submitted":105051,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.644176962408655,"acs":58709,"articleLive":2,"columnArticles":391,"formTitle":"[706]设计哈希映射","frequency":0.0,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"ac","submitted":91138,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.32257474762947114,"acs":65283,"articleLive":2,"columnArticles":450,"formTitle":"[707]设计链表","frequency":0.0,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"ac","submitted":202381,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.33970937129300116,"acs":2291,"articleLive":2,"columnArticles":52,"formTitle":"[708]循环有序列表的插入","frequency":0.0,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"850","status":"lock","submitted":6744,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.758635039533916,"acs":71097,"articleLive":2,"columnArticles":511,"formTitle":"[709]转换成小写字母","frequency":0.0,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","submitted":93717,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.3526582954849052,"acs":5280,"articleLive":2,"columnArticles":65,"formTitle":"[710]黑名单中的随机数","frequency":0.0,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","submitted":14972,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.559190031152648,"acs":718,"articleLive":2,"columnArticles":25,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"lock","submitted":1284,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6727584237578527,"acs":15314,"articleLive":2,"columnArticles":173,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":0.0,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","submitted":22763,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.41535477003897064,"acs":24194,"articleLive":2,"columnArticles":224,"formTitle":"[713]乘积小于K的子数组","frequency":0.0,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"ac","submitted":58249,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7221284204976953,"acs":101363,"articleLive":2,"columnArticles":677,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":0.0,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"","submitted":140367,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.40926405607191835,"acs":2686,"articleLive":2,"columnArticles":46,"formTitle":"[715]Range 模块","frequency":0.0,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","submitted":6563,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.46095173041894355,"acs":4049,"articleLive":2,"columnArticles":75,"formTitle":"[716]最大栈","frequency":0.0,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"lock","submitted":8784,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5116013019238825,"acs":31751,"articleLive":2,"columnArticles":382,"formTitle":"[717]1比特与2比特字符","frequency":0.0,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","submitted":62062,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5647262331557299,"acs":85534,"articleLive":2,"columnArticles":594,"formTitle":"[718]最长重复子数组","frequency":0.0,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","submitted":151461,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.3699892553103562,"acs":8953,"articleLive":2,"columnArticles":87,"formTitle":"[719]找出第 k 小的距离对","frequency":0.0,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","submitted":24198,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.48403700354733253,"acs":20877,"articleLive":2,"columnArticles":279,"formTitle":"[720]词典中最长的单词","frequency":0.0,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","submitted":43131,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.4692888975004844,"acs":29064,"articleLive":2,"columnArticles":338,"formTitle":"[721]账户合并","frequency":0.0,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","submitted":61932,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.32219251336898397,"acs":5061,"articleLive":2,"columnArticles":75,"formTitle":"[722]删除注释","frequency":0.0,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","submitted":15708,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7195909580193757,"acs":1337,"articleLive":2,"columnArticles":41,"formTitle":"[723]粉碎糖果","frequency":0.0,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"lock","submitted":1858,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.46334531666994294,"acs":139068,"articleLive":2,"columnArticles":869,"formTitle":"[724]寻找数组的中心下标","frequency":0.0,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"","submitted":300139,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.6085767557489123,"acs":48960,"articleLive":2,"columnArticles":625,"formTitle":"[725]分隔链表","frequency":0.0,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"ac","submitted":80450,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5524899567952702,"acs":21867,"articleLive":2,"columnArticles":398,"formTitle":"[726]原子的数量","frequency":0.0,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"ac","submitted":39579,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.4100237330727349,"acs":2937,"articleLive":2,"columnArticles":50,"formTitle":"[727]最小窗口子序列","frequency":0.0,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"lock","submitted":7163,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7602680067001675,"acs":34041,"articleLive":2,"columnArticles":311,"formTitle":"[728]自除数","frequency":0.0,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","submitted":44775,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.5148721730580138,"acs":8378,"articleLive":2,"columnArticles":94,"formTitle":"[729]我的日程安排表 I","frequency":0.0,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","submitted":16272,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.49058006941001486,"acs":3958,"articleLive":2,"columnArticles":48,"formTitle":"[730]统计不同回文子序列","frequency":0.0,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","submitted":8068,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5042257022122794,"acs":4057,"articleLive":2,"columnArticles":43,"formTitle":"[731]我的日程安排表 II","frequency":0.0,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","submitted":8046,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6100427350427351,"acs":3426,"articleLive":2,"columnArticles":54,"formTitle":"[732]我的日程安排表 III","frequency":0.0,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","submitted":5616,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5805102287232208,"acs":67309,"articleLive":2,"columnArticles":575,"formTitle":"[733]图像渲染","frequency":0.0,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"ac","submitted":115948,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.4811908608354489,"acs":2085,"articleLive":2,"columnArticles":37,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"lock","submitted":4333,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.4076003677597303,"acs":21280,"articleLive":2,"columnArticles":267,"formTitle":"[735]行星碰撞","frequency":0.0,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"ac","submitted":52208,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.46386255924170616,"acs":1566,"articleLive":2,"columnArticles":46,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","submitted":3376,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.4622317087631922,"acs":3898,"articleLive":2,"columnArticles":66,"formTitle":"[737]句子相似性 II","frequency":0.0,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"lock","submitted":8433,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.5015986390454014,"acs":41574,"articleLive":2,"columnArticles":591,"formTitle":"[738]单调递增的数字","frequency":0.0,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"ac","submitted":82883,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6802358368024534,"acs":214711,"articleLive":2,"columnArticles":1531,"formTitle":"[739]每日温度","frequency":0.0,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"ac","submitted":315642,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.6294041622881714,"acs":52109,"articleLive":2,"columnArticles":603,"formTitle":"[740]删除并获得点数","frequency":0.0,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","submitted":82791,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.3674649050371594,"acs":4005,"articleLive":2,"columnArticles":46,"formTitle":"[741]摘樱桃","frequency":0.0,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","submitted":10899,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.4950431723696834,"acs":1548,"articleLive":2,"columnArticles":45,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"lock","submitted":3127,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.5208078114866326,"acs":57818,"articleLive":2,"columnArticles":527,"formTitle":"[743]网络延迟时间","frequency":0.0,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"ac","submitted":111016,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.4590016638935108,"acs":41379,"articleLive":2,"columnArticles":367,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":0.0,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","submitted":90150,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.39242919389978215,"acs":2882,"articleLive":2,"columnArticles":55,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","submitted":7344,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.58895852906226,"acs":137288,"articleLive":2,"columnArticles":1314,"formTitle":"[746]使用最小花费爬楼梯","frequency":0.0,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","submitted":233103,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.41689226266691054,"acs":45583,"articleLive":2,"columnArticles":405,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":0.0,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","submitted":109340,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.6018961884696419,"acs":12570,"articleLive":2,"columnArticles":176,"formTitle":"[748]最短补全词","frequency":0.0,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","submitted":20884,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.499275887038378,"acs":1379,"articleLive":2,"columnArticles":32,"formTitle":"[749]隔离病毒","frequency":0.0,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","submitted":2762,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.7216235632183908,"acs":2009,"articleLive":2,"columnArticles":43,"formTitle":"[750]角矩形的数量","frequency":0.0,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"lock","submitted":2784,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5028776978417266,"acs":1398,"articleLive":2,"columnArticles":28,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","questionId":"752","status":"lock","submitted":2780,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5304090297819616,"acs":70206,"articleLive":2,"columnArticles":592,"formTitle":"[752]打开转盘锁","frequency":0.0,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"ac","submitted":132362,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5915211062590975,"acs":3251,"articleLive":2,"columnArticles":41,"formTitle":"[753]破解保险箱","frequency":0.0,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","submitted":5496,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.4311460505909407,"acs":8062,"articleLive":2,"columnArticles":95,"formTitle":"[754]到达终点数字","frequency":0.0,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","submitted":18699,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.49923547400611623,"acs":1306,"articleLive":2,"columnArticles":31,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"lock","submitted":2616,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.5647116444226766,"acs":4612,"articleLive":2,"columnArticles":68,"formTitle":"[756]金字塔转换矩阵","frequency":0.0,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","submitted":8167,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.4196687724090831,"acs":2458,"articleLive":2,"columnArticles":38,"formTitle":"[757]设置交集大小至少为2","frequency":0.0,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","submitted":5857,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.4624292670088169,"acs":3514,"articleLive":2,"columnArticles":67,"formTitle":"[758]字符串中的加粗单词","frequency":0.0,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","questionId":"760","status":"lock","submitted":7599,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6618830941547077,"acs":1891,"articleLive":2,"columnArticles":46,"formTitle":"[759]员工空闲时间","frequency":0.0,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"lock","submitted":2857,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.8393650793650793,"acs":3966,"articleLive":2,"columnArticles":90,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"lock","submitted":4725,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.5910112359550562,"acs":2104,"articleLive":2,"columnArticles":34,"formTitle":"[761]特殊的二进制序列","frequency":0.0,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","submitted":3560,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.700394886030418,"acs":17914,"articleLive":2,"columnArticles":143,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"767","status":"","submitted":25577,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.763312132529675,"acs":82569,"articleLive":2,"columnArticles":992,"formTitle":"[763]划分字母区间","frequency":0.0,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","submitted":108172,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.49346981997882106,"acs":4194,"articleLive":2,"columnArticles":54,"formTitle":"[764]最大加号标志","frequency":0.0,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","submitted":8499,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.6654378299654106,"acs":29242,"articleLive":2,"columnArticles":442,"formTitle":"[765]情侣牵手","frequency":0.0,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","submitted":43944,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7080490781781975,"acs":55111,"articleLive":2,"columnArticles":637,"formTitle":"[766]托普利茨矩阵","frequency":0.0,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","submitted":77835,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.47789398621345375,"acs":40210,"articleLive":2,"columnArticles":499,"formTitle":"[767]重构字符串","frequency":0.0,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","submitted":84140,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.5061855670103093,"acs":5401,"articleLive":2,"columnArticles":80,"formTitle":"[768]最多能完成排序的块 II","frequency":0.0,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","submitted":10670,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5876891653514066,"acs":12660,"articleLive":2,"columnArticles":152,"formTitle":"[769]最多能完成排序的块","frequency":0.0,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","submitted":21542,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.554368029739777,"acs":1193,"articleLive":2,"columnArticles":26,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","submitted":2152,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8512492994712048,"acs":153413,"articleLive":2,"columnArticles":1120,"formTitle":"[771]宝石与石头","frequency":0.0,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"ac","submitted":180221,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.494522070498571,"acs":6229,"articleLive":2,"columnArticles":125,"formTitle":"[772]基本计算器 III","frequency":0.0,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"lock","submitted":12596,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7131292227159292,"acs":23432,"articleLive":2,"columnArticles":334,"formTitle":"[773]滑动谜题","frequency":0.0,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","submitted":32858,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5901725039205437,"acs":1129,"articleLive":2,"columnArticles":22,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.0,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"lock","submitted":1913,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.45901934322986954,"acs":5102,"articleLive":2,"columnArticles":81,"formTitle":"[775]全局倒置与局部倒置","frequency":0.0,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","submitted":11115,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5689270932823941,"acs":1787,"articleLive":2,"columnArticles":39,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"lock","submitted":3141,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.32378422086173037,"acs":5606,"articleLive":2,"columnArticles":61,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":0.0,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","submitted":17314,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5939299454348864,"acs":23620,"articleLive":2,"columnArticles":348,"formTitle":"[778]水位上升的泳池中游泳","frequency":0.0,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","submitted":39769,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.4363222722676717,"acs":18987,"articleLive":2,"columnArticles":236,"formTitle":"[779]第K个语法符号","frequency":0.0,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","submitted":43516,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.2853679653679654,"acs":3296,"articleLive":2,"columnArticles":50,"formTitle":"[780]到达终点","frequency":0.0,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","submitted":11550,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.616859273596721,"acs":43343,"articleLive":2,"columnArticles":663,"formTitle":"[781]森林中的兔子","frequency":0.0,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","submitted":70264,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.4280453257790368,"acs":1511,"articleLive":2,"columnArticles":31,"formTitle":"[782]变为棋盘","frequency":0.0,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","submitted":3530,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5960569289411524,"acs":69899,"articleLive":2,"columnArticles":673,"formTitle":"[783]二叉搜索树节点最小距离","frequency":0.0,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"ac","submitted":117269,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6870382082092891,"acs":44540,"articleLive":2,"columnArticles":492,"formTitle":"[784]字母大小写全排列","frequency":0.0,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"ac","submitted":64829,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5124223993552693,"acs":40693,"articleLive":2,"columnArticles":407,"formTitle":"[785]判断二分图","frequency":0.0,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"ac","submitted":79413,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.47408469342743714,"acs":4299,"articleLive":2,"columnArticles":58,"formTitle":"[786]第 K 个最小的素数分数","frequency":0.0,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","submitted":9068,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.390911431040506,"acs":42521,"articleLive":2,"columnArticles":403,"formTitle":"[787]K 站中转内最便宜的航班","frequency":0.0,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"ac","submitted":108774,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.6081955900233315,"acs":18508,"articleLive":2,"columnArticles":191,"formTitle":"[788]旋转数字","frequency":0.0,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","questionId":"804","status":"","submitted":30431,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6922059892906723,"acs":20942,"articleLive":2,"columnArticles":296,"formTitle":"[789]逃脱阻碍者","frequency":0.0,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"ac","submitted":30254,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.449045318610536,"acs":3904,"articleLive":2,"columnArticles":67,"formTitle":"[790]多米诺和托米诺平铺","frequency":0.0,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","submitted":8694,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6949193646174366,"acs":11462,"articleLive":2,"columnArticles":201,"formTitle":"[791]自定义字符串排序","frequency":0.0,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","submitted":16494,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.46490160275918035,"acs":9166,"articleLive":2,"columnArticles":99,"formTitle":"[792]匹配子序列的单词数","frequency":0.0,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","submitted":19716,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.3931511104208728,"acs":5063,"articleLive":2,"columnArticles":68,"formTitle":"[793]阶乘函数后 K 个零","frequency":0.0,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","submitted":12878,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3408156667128539,"acs":7379,"articleLive":2,"columnArticles":106,"formTitle":"[794]有效的井字游戏","frequency":0.0,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","submitted":21651,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5330611169652265,"acs":8094,"articleLive":2,"columnArticles":89,"formTitle":"[795]区间子数组个数","frequency":0.0,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","submitted":15184,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5308617189765553,"acs":23798,"articleLive":2,"columnArticles":282,"formTitle":"[796]旋转字符串","frequency":0.0,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","submitted":44829,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.7926833676752341,"acs":43856,"articleLive":2,"columnArticles":543,"formTitle":"[797]所有可能的路径","frequency":0.0,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"ac","submitted":55326,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.46502331778814127,"acs":1396,"articleLive":2,"columnArticles":35,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","submitted":3002,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.4085594191822698,"acs":5346,"articleLive":2,"columnArticles":69,"formTitle":"[799]香槟塔","frequency":0.0,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","submitted":13085,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7068292682926829,"acs":1449,"articleLive":2,"columnArticles":36,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"lock","submitted":2050,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.41940685286495827,"acs":7283,"articleLive":2,"columnArticles":88,"formTitle":"[801]使序列递增的最小交换次数","frequency":0.0,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","questionId":"819","status":"","submitted":17365,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5763699387860461,"acs":31260,"articleLive":2,"columnArticles":334,"formTitle":"[802]找到最终的安全状态","frequency":0.0,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"ac","submitted":54236,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.48196837107091,"acs":12282,"articleLive":2,"columnArticles":125,"formTitle":"[803]打砖块","frequency":0.0,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","submitted":25483,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7714545560092108,"acs":39868,"articleLive":2,"columnArticles":401,"formTitle":"[804]唯一摩尔斯密码词","frequency":0.0,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","submitted":51679,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.2908714145490239,"acs":2667,"articleLive":2,"columnArticles":41,"formTitle":"[805]数组的均值分割","frequency":0.0,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","submitted":9169,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.6564955855244009,"acs":13533,"articleLive":2,"columnArticles":152,"formTitle":"[806]写字符串需要的行数","frequency":0.0,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","submitted":20614,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.845771144278607,"acs":16660,"articleLive":2,"columnArticles":222,"formTitle":"[807]保持城市天际线","frequency":0.0,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","submitted":19698,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.480880270181937,"acs":4414,"articleLive":2,"columnArticles":42,"formTitle":"[808]分汤","frequency":0.0,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","submitted":9179,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.41931093151850274,"acs":4929,"articleLive":2,"columnArticles":91,"formTitle":"[809]情感丰富的文字","frequency":0.0,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","submitted":11755,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7334185923443288,"acs":16631,"articleLive":2,"columnArticles":134,"formTitle":"[810]黑板异或游戏","frequency":0.0,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"ac","submitted":22676,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7048974841077984,"acs":15746,"articleLive":2,"columnArticles":200,"formTitle":"[811]子域名访问计数","frequency":0.0,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","questionId":"829","status":"","submitted":22338,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.6304573804573804,"acs":10917,"articleLive":2,"columnArticles":100,"formTitle":"[812]最大三角形面积","frequency":0.0,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","submitted":17316,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5507098595968312,"acs":7021,"articleLive":2,"columnArticles":83,"formTitle":"[813]最大平均值和的分组","frequency":0.0,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","submitted":12749,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.6990385490279336,"acs":23048,"articleLive":2,"columnArticles":358,"formTitle":"[814]二叉树剪枝","frequency":0.0,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","submitted":32971,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.43362788891046805,"acs":26793,"articleLive":2,"columnArticles":317,"formTitle":"[815]公交路线","frequency":0.0,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"ac","submitted":61788,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.51146233803218,"acs":3592,"articleLive":2,"columnArticles":65,"formTitle":"[816]模糊坐标","frequency":0.0,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","submitted":7023,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5912751970046585,"acs":13581,"articleLive":2,"columnArticles":166,"formTitle":"[817]链表组件","frequency":0.0,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"ac","submitted":22969,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.43334514110284567,"acs":3670,"articleLive":2,"columnArticles":45,"formTitle":"[818]赛车","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","submitted":8469,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.42146106502542147,"acs":22050,"articleLive":2,"columnArticles":250,"formTitle":"[819]最常见的单词","frequency":0.0,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","submitted":52318,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5077796486966443,"acs":55186,"articleLive":2,"columnArticles":603,"formTitle":"[820]单词的压缩编码","frequency":0.0,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","submitted":108681,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.6927460426703372,"acs":25164,"articleLive":2,"columnArticles":339,"formTitle":"[821]字符的最短距离","frequency":0.0,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","submitted":36325,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5025256923880858,"acs":2885,"articleLive":2,"columnArticles":41,"formTitle":"[822]翻转卡片游戏","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","submitted":5741,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.4286128845037725,"acs":2954,"articleLive":2,"columnArticles":54,"formTitle":"[823]带因子的二叉树","frequency":0.0,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","submitted":6892,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6157908153975017,"acs":16909,"articleLive":2,"columnArticles":239,"formTitle":"[824]山羊拉丁文","frequency":0.0,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","submitted":27459,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.3927255716039998,"acs":6716,"articleLive":2,"columnArticles":91,"formTitle":"[825]适龄的朋友","frequency":0.0,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"","submitted":17101,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.37496988096959183,"acs":7781,"articleLive":2,"columnArticles":117,"formTitle":"[826]安排工作以达到最大收益","frequency":0.0,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","submitted":20751,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.3895410433529686,"acs":9192,"articleLive":2,"columnArticles":183,"formTitle":"[827]最大人工岛","frequency":0.0,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","submitted":23597,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.49179829890643983,"acs":3238,"articleLive":2,"columnArticles":53,"formTitle":"[828]统计子串中的唯一字符","frequency":0.0,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"855","status":"","submitted":6584,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.3658434840647422,"acs":8770,"articleLive":2,"columnArticles":101,"formTitle":"[829]连续整数求和","frequency":0.0,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","submitted":23972,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5431688854085095,"acs":52022,"articleLive":2,"columnArticles":582,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","submitted":95775,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.4056695464362851,"acs":7513,"articleLive":2,"columnArticles":73,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","submitted":18520,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.7958527523233296,"acs":85894,"articleLive":2,"columnArticles":919,"formTitle":"[832]翻转图像","frequency":0.0,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","submitted":107927,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.43130246862272464,"acs":5189,"articleLive":2,"columnArticles":78,"formTitle":"[833]字符串中的查找与替换","frequency":0.0,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","submitted":12031,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5282135975777594,"acs":13433,"articleLive":2,"columnArticles":133,"formTitle":"[834]树中距离之和","frequency":0.0,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","submitted":25431,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5747675962815405,"acs":4328,"articleLive":2,"columnArticles":49,"formTitle":"[835]图像重叠","frequency":0.0,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","submitted":7530,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.47953920437983955,"acs":37839,"articleLive":2,"columnArticles":657,"formTitle":"[836]矩形重叠","frequency":0.0,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","submitted":78907,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.3958923946074932,"acs":19411,"articleLive":2,"columnArticles":245,"formTitle":"[837]新21点","frequency":0.0,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","submitted":49031,"title":"新21点","titleSlug":"new-21-game"},{"acceptance":0.5009031540919827,"acs":7210,"articleLive":2,"columnArticles":124,"formTitle":"[838]推多米诺","frequency":0.0,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","submitted":14394,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5747743425195669,"acs":19167,"articleLive":2,"columnArticles":270,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","submitted":33347,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.3600446072964792,"acs":9040,"articleLive":2,"columnArticles":114,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","submitted":25108,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.658098990280268,"acs":55791,"articleLive":2,"columnArticles":546,"formTitle":"[841]钥匙和房间","frequency":0.0,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"ac","submitted":84776,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.48812365822241305,"acs":28421,"articleLive":2,"columnArticles":321,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":0.0,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","submitted":58225,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.37989432326243056,"acs":2804,"articleLive":2,"columnArticles":35,"formTitle":"[843]猜猜这个单词","frequency":0.0,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","submitted":7381,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5123913851979579,"acs":90930,"articleLive":2,"columnArticles":993,"formTitle":"[844]比较含退格的字符串","frequency":0.0,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"ac","submitted":177462,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.42128166317945065,"acs":37853,"articleLive":2,"columnArticles":557,"formTitle":"[845]数组中的最长山脉","frequency":0.0,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","submitted":89852,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5116523567548624,"acs":8760,"articleLive":2,"columnArticles":123,"formTitle":"[846]一手顺子","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","submitted":17121,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.6807073604706053,"acs":18746,"articleLive":2,"columnArticles":158,"formTitle":"[847]访问所有节点的最短路径","frequency":0.0,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"ac","submitted":27539,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.4492989731437599,"acs":9101,"articleLive":2,"columnArticles":97,"formTitle":"[848]字母移位","frequency":0.0,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","submitted":20256,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.4269815490295269,"acs":16037,"articleLive":2,"columnArticles":187,"formTitle":"[849]到最近的人的最大距离","frequency":0.0,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","submitted":37559,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.44958677685950416,"acs":2448,"articleLive":2,"columnArticles":42,"formTitle":"[850]矩形面积 II","frequency":0.0,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","submitted":5445,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.482265573043671,"acs":4351,"articleLive":2,"columnArticles":72,"formTitle":"[851]喧闹和富有","frequency":0.0,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","submitted":9022,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7157347290866206,"acs":85876,"articleLive":2,"columnArticles":743,"formTitle":"[852]山脉数组的峰顶索引","frequency":0.0,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"ac","submitted":119983,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.3838462973325872,"acs":10289,"articleLive":2,"columnArticles":123,"formTitle":"[853]车队","frequency":0.0,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","submitted":26805,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.3596325760682359,"acs":4385,"articleLive":2,"columnArticles":68,"formTitle":"[854]相似度为 K 的字符串","frequency":0.0,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","submitted":12193,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.40834028356964136,"acs":4896,"articleLive":2,"columnArticles":58,"formTitle":"[855]考场就座","frequency":0.0,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","submitted":11990,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6271018037297462,"acs":16410,"articleLive":2,"columnArticles":219,"formTitle":"[856]括号的分数","frequency":0.0,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"ac","submitted":26168,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.46654360867558836,"acs":3033,"articleLive":2,"columnArticles":47,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":0.0,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","submitted":6501,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5561087705859824,"acs":2904,"articleLive":2,"columnArticles":49,"formTitle":"[858]镜面反射","frequency":0.0,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","submitted":5222,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.3023330963614037,"acs":28068,"articleLive":2,"columnArticles":365,"formTitle":"[859]亲密字符串","frequency":0.0,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","submitted":92838,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5871085337692328,"acs":90511,"articleLive":2,"columnArticles":777,"formTitle":"[860]柠檬水找零","frequency":0.0,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"ac","submitted":154164,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8084811814172905,"acs":31534,"articleLive":2,"columnArticles":441,"formTitle":"[861]翻转矩阵后的得分","frequency":0.0,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"ac","submitted":39004,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.1925734635158719,"acs":16331,"articleLive":2,"columnArticles":129,"formTitle":"[862]和至少为 K 的最短子数组","frequency":0.0,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","submitted":84804,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.604456777093051,"acs":35507,"articleLive":2,"columnArticles":564,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":0.0,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"ac","submitted":58742,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.45676241771394377,"acs":3053,"articleLive":2,"columnArticles":44,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.0,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","submitted":6684,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.6588048039357546,"acs":9106,"articleLive":2,"columnArticles":132,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.0,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","submitted":13822,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.22483952828780415,"acs":7531,"articleLive":2,"columnArticles":85,"formTitle":"[866]回文素数","frequency":0.0,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","submitted":33495,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6701660546064186,"acs":83945,"articleLive":2,"columnArticles":753,"formTitle":"[867]转置矩阵","frequency":0.0,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","submitted":125260,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6248479781088476,"acs":16441,"articleLive":2,"columnArticles":237,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","submitted":26312,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.5513114336643749,"acs":6495,"articleLive":2,"columnArticles":97,"formTitle":"[869]重新排序得到 2 的幂","frequency":0.0,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"","submitted":11781,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.4297343616109683,"acs":15045,"articleLive":2,"columnArticles":192,"formTitle":"[870]优势洗牌","frequency":0.0,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"ac","submitted":35010,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.3430479659987857,"acs":9605,"articleLive":2,"columnArticles":129,"formTitle":"[871]最低加油次数","frequency":0.0,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","submitted":27999,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6519739034168467,"acs":60659,"articleLive":2,"columnArticles":725,"formTitle":"[872]叶子相似的树","frequency":0.0,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"ac","submitted":93039,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5117839497930298,"acs":15331,"articleLive":2,"columnArticles":113,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":0.0,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","submitted":29956,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.4161287736038167,"acs":20759,"articleLive":2,"columnArticles":229,"formTitle":"[874]模拟行走机器人","frequency":0.0,"frontendQuestionId":"874","leaf":true,"level":2,"nodeType":"def","questionId":"906","status":"","submitted":49886,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.47985628335140423,"acs":45142,"articleLive":2,"columnArticles":355,"formTitle":"[875]爱吃香蕉的珂珂","frequency":0.0,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","submitted":94074,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.706402924651876,"acs":154775,"articleLive":2,"columnArticles":1671,"formTitle":"[876]链表的中间结点","frequency":0.0,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"ac","submitted":219103,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7574264551201851,"acs":68410,"articleLive":2,"columnArticles":485,"formTitle":"[877]石子游戏","frequency":0.0,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"ac","submitted":90319,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.2812440252373972,"acs":4413,"articleLive":2,"columnArticles":62,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","submitted":15691,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5544600334663405,"acs":21538,"articleLive":2,"columnArticles":181,"formTitle":"[879]盈利计划","frequency":0.0,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"ac","submitted":38845,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.2528837248463417,"acs":6007,"articleLive":2,"columnArticles":78,"formTitle":"[880]索引处的解码字符串","frequency":0.0,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"ac","submitted":23754,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.5377475599895225,"acs":47218,"articleLive":2,"columnArticles":577,"formTitle":"[881]救生艇","frequency":0.0,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"ac","submitted":87807,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.4827956989247312,"acs":1796,"articleLive":2,"columnArticles":32,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","submitted":3720,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.6897856242118537,"acs":10940,"articleLive":2,"columnArticles":111,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","submitted":15860,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.661860543643424,"acs":19601,"articleLive":2,"columnArticles":255,"formTitle":"[884]两句话中的不常见单词","frequency":0.0,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","submitted":29615,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6927969235320219,"acs":4684,"articleLive":2,"columnArticles":71,"formTitle":"[885]螺旋矩阵 III","frequency":0.0,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","submitted":6761,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.4271858927259368,"acs":8721,"articleLive":2,"columnArticles":117,"formTitle":"[886]可能的二分法","frequency":0.0,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","submitted":20415,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.2914179884022292,"acs":51611,"articleLive":2,"columnArticles":338,"formTitle":"[887]鸡蛋掉落","frequency":0.0,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","submitted":177103,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6405485735683025,"acs":54740,"articleLive":2,"columnArticles":457,"formTitle":"[888]公平的糖果棒交换","frequency":0.0,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","submitted":85458,"title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"acceptance":0.6763902735035325,"acs":15605,"articleLive":2,"columnArticles":149,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":0.0,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"925","status":"","submitted":23071,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.7267355982274741,"acs":8856,"articleLive":2,"columnArticles":121,"formTitle":"[890]查找和替换模式","frequency":0.0,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","submitted":12186,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.3304849884526559,"acs":2862,"articleLive":2,"columnArticles":39,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","submitted":8660,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.638660770688566,"acs":33363,"articleLive":2,"columnArticles":682,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","submitted":52239,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.7251328266863946,"acs":10782,"articleLive":2,"columnArticles":105,"formTitle":"[893]特殊等价字符串组","frequency":0.0,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","questionId":"929","status":"","submitted":14869,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7749560117302052,"acs":13213,"articleLive":2,"columnArticles":122,"formTitle":"[894]所有可能的满二叉树","frequency":0.0,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","submitted":17050,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.5468465736810187,"acs":7214,"articleLive":2,"columnArticles":83,"formTitle":"[895]最大频率栈","frequency":0.0,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","submitted":13192,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.586759896687519,"acs":59748,"articleLive":2,"columnArticles":718,"formTitle":"[896]单调数列","frequency":0.0,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","submitted":101827,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.7439108757365395,"acs":62368,"articleLive":2,"columnArticles":711,"formTitle":"[897]递增顺序搜索树","frequency":0.0,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"ac","submitted":83838,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.33824907829781914,"acs":5413,"articleLive":2,"columnArticles":37,"formTitle":"[898]子数组按位或操作","frequency":0.0,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","submitted":16003,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5363740603898586,"acs":4210,"articleLive":2,"columnArticles":47,"formTitle":"[899]有序队列","frequency":0.0,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","submitted":7849,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.49397415420357194,"acs":3402,"articleLive":2,"columnArticles":50,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","submitted":6887,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.546380865395593,"acs":19143,"articleLive":2,"columnArticles":237,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"ac","submitted":35036,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.32939903609717713,"acs":3349,"articleLive":2,"columnArticles":78,"formTitle":"[902]最大为 N 的数字组合","frequency":0.0,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","submitted":10167,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.5311428055605705,"acs":2942,"articleLive":2,"columnArticles":43,"formTitle":"[903]DI 序列的有效排列","frequency":0.0,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","submitted":5539,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.45297856296455885,"acs":21025,"articleLive":2,"columnArticles":291,"formTitle":"[904]水果成篮","frequency":0.0,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","submitted":46415,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.7005126727418987,"acs":58345,"articleLive":2,"columnArticles":605,"formTitle":"[905]按奇偶排序数组","frequency":0.0,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","submitted":83289,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.2777009181235065,"acs":2208,"articleLive":2,"columnArticles":40,"formTitle":"[906]超级回文数","frequency":0.0,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","submitted":7951,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.3181290108431069,"acs":11501,"articleLive":2,"columnArticles":132,"formTitle":"[907]子数组的最小值之和","frequency":0.0,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"ac","submitted":36152,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.6987762995565336,"acs":20957,"articleLive":2,"columnArticles":192,"formTitle":"[908]最小差值 I","frequency":0.0,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","submitted":29991,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.4596534863344733,"acs":16263,"articleLive":2,"columnArticles":193,"formTitle":"[909]蛇梯棋","frequency":0.0,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"ac","submitted":35381,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.3193281332248648,"acs":6673,"articleLive":2,"columnArticles":69,"formTitle":"[910]最小差值 II","frequency":0.0,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","submitted":20897,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.4268120710726709,"acs":4540,"articleLive":2,"columnArticles":69,"formTitle":"[911]在线选举","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","submitted":10637,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.5599452751842162,"acs":233290,"articleLive":2,"columnArticles":1069,"formTitle":"[912]排序数组","frequency":0.0,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"ac","submitted":416630,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.4,"acs":1916,"articleLive":2,"columnArticles":34,"formTitle":"[913]猫和老鼠","frequency":0.0,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","submitted":4790,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.38880098731052815,"acs":49146,"articleLive":2,"columnArticles":620,"formTitle":"[914]卡牌分组","frequency":0.0,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"950","status":"ac","submitted":126404,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.46939787719472276,"acs":9464,"articleLive":2,"columnArticles":116,"formTitle":"[915]分割数组","frequency":0.0,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","submitted":20162,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.4419454984477406,"acs":6406,"articleLive":2,"columnArticles":76,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","submitted":14495,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5701671518633481,"acs":29574,"articleLive":2,"columnArticles":436,"formTitle":"[917]仅仅反转字母","frequency":0.0,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","submitted":51869,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.3583462739401226,"acs":21461,"articleLive":2,"columnArticles":230,"formTitle":"[918]环形子数组的最大和","frequency":0.0,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","submitted":59889,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.634402332361516,"acs":5440,"articleLive":2,"columnArticles":103,"formTitle":"[919]完全二叉树插入器","frequency":0.0,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","submitted":8575,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.48274974253347064,"acs":1875,"articleLive":2,"columnArticles":20,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","submitted":3884,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.7383826402456043,"acs":21165,"articleLive":2,"columnArticles":313,"formTitle":"[921]使括号有效的最少添加","frequency":0.0,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"ac","submitted":28664,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.713995975345027,"acs":90122,"articleLive":2,"columnArticles":829,"formTitle":"[922]按奇偶排序数组 II","frequency":0.0,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"ac","submitted":126222,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.33890176213827666,"acs":6289,"articleLive":2,"columnArticles":83,"formTitle":"[923]三数之和的多种可能","frequency":0.0,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","submitted":18557,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.35938653791536496,"acs":6327,"articleLive":2,"columnArticles":94,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.0,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","submitted":17605,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.3876886539492837,"acs":50605,"articleLive":2,"columnArticles":680,"formTitle":"[925]长按键入","frequency":0.0,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","submitted":130530,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.5234930093972038,"acs":6852,"articleLive":2,"columnArticles":125,"formTitle":"[926]将字符串翻转到单调递增","frequency":0.0,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","submitted":13089,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.3373975809598127,"acs":3459,"articleLive":2,"columnArticles":70,"formTitle":"[927]三等分","frequency":0.0,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","submitted":10252,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.4191785983421251,"acs":2225,"articleLive":2,"columnArticles":43,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","submitted":5308,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6443623289723359,"acs":25808,"articleLive":2,"columnArticles":233,"formTitle":"[929]独特的电子邮件地址","frequency":0.0,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","submitted":40052,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.5449878498205636,"acs":33865,"articleLive":2,"columnArticles":343,"formTitle":"[930]和相同的二元子数组","frequency":0.0,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"ac","submitted":62139,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6653961509622595,"acs":21298,"articleLive":2,"columnArticles":272,"formTitle":"[931]下降路径最小和","frequency":0.0,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","submitted":32008,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6325902024053974,"acs":8626,"articleLive":2,"columnArticles":83,"formTitle":"[932]漂亮数组","frequency":0.0,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","submitted":13636,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.7254464730125232,"acs":36437,"articleLive":2,"columnArticles":314,"formTitle":"[933]最近的请求次数","frequency":0.0,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","submitted":50227,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.4730874806062776,"acs":23784,"articleLive":2,"columnArticles":272,"formTitle":"[934]最短的桥","frequency":0.0,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","submitted":50274,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.4748706863274917,"acs":6151,"articleLive":2,"columnArticles":80,"formTitle":"[935]骑士拨号器","frequency":0.0,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","submitted":12953,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.3789346246973366,"acs":1565,"articleLive":2,"columnArticles":26,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","submitted":4130,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.5871180842279108,"acs":12087,"articleLive":2,"columnArticles":128,"formTitle":"[937]重新排列日志文件","frequency":0.0,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","submitted":20587,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8188206024744487,"acs":97420,"articleLive":2,"columnArticles":804,"formTitle":"[938]二叉搜索树的范围和","frequency":0.0,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"ac","submitted":118976,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.4534559185683796,"acs":5524,"articleLive":2,"columnArticles":63,"formTitle":"[939]最小面积矩形","frequency":0.0,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","submitted":12182,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.41982629029564056,"acs":5027,"articleLive":2,"columnArticles":66,"formTitle":"[940]不同的子序列 II","frequency":0.0,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"notac","submitted":11974,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.3927063242950245,"acs":62306,"articleLive":2,"columnArticles":617,"formTitle":"[941]有效的山脉数组","frequency":0.0,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","submitted":158658,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7303833290455364,"acs":22712,"articleLive":2,"columnArticles":214,"formTitle":"[942]增减字符串匹配","frequency":0.0,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","submitted":31096,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.4685714285714286,"acs":1886,"articleLive":2,"columnArticles":43,"formTitle":"[943]最短超级串","frequency":0.0,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","submitted":4025,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6896139170924142,"acs":21327,"articleLive":2,"columnArticles":181,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","submitted":30926,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.4860761226725082,"acs":35503,"articleLive":2,"columnArticles":537,"formTitle":"[945]使数组唯一的最小增量","frequency":0.0,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","submitted":73040,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.6245299788063171,"acs":27405,"articleLive":2,"columnArticles":301,"formTitle":"[946]验证栈序列","frequency":0.0,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"ac","submitted":43881,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.612549847525217,"acs":26113,"articleLive":2,"columnArticles":340,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"","submitted":42630,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.39144397293267574,"acs":6826,"articleLive":2,"columnArticles":99,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","submitted":17438,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.37107084600802365,"acs":8417,"articleLive":2,"columnArticles":120,"formTitle":"[949]给定数字能组成的最大时间","frequency":0.0,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","submitted":22683,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7750981932443048,"acs":9867,"articleLive":2,"columnArticles":148,"formTitle":"[950]按递增顺序显示卡牌","frequency":0.0,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","submitted":12730,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6636002136625319,"acs":11181,"articleLive":2,"columnArticles":169,"formTitle":"[951]翻转等价二叉树","frequency":0.0,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","submitted":16849,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.35221702952239825,"acs":3090,"articleLive":2,"columnArticles":60,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","submitted":8773,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.5531781487577396,"acs":14116,"articleLive":2,"columnArticles":170,"formTitle":"[953]验证外星语词典","frequency":0.0,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","submitted":25518,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.3011122431652233,"acs":7093,"articleLive":2,"columnArticles":106,"formTitle":"[954]二倍数对数组","frequency":0.0,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","submitted":23556,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.32947272173117953,"acs":3243,"articleLive":2,"columnArticles":51,"formTitle":"[955]删列造序 II","frequency":0.0,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","submitted":9843,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.43788517677586763,"acs":4050,"articleLive":2,"columnArticles":52,"formTitle":"[956]最高的广告牌","frequency":0.0,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","submitted":9249,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.36094015145758934,"acs":14251,"articleLive":2,"columnArticles":140,"formTitle":"[957]N 天后的牢房","frequency":0.0,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","submitted":39483,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5362538732770595,"acs":25094,"articleLive":2,"columnArticles":232,"formTitle":"[958]二叉树的完全性检验","frequency":0.0,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","submitted":46795,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7427880984745506,"acs":19672,"articleLive":2,"columnArticles":305,"formTitle":"[959]由斜杠划分区域","frequency":0.0,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","submitted":26484,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5551257253384912,"acs":2009,"articleLive":2,"columnArticles":33,"formTitle":"[960]删列造序 III","frequency":0.0,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","submitted":3619,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6769414356526529,"acs":36873,"articleLive":2,"columnArticles":306,"formTitle":"[961]重复 N 次的元素","frequency":0.0,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","submitted":54470,"title":"重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.4434264773247824,"acs":13552,"articleLive":2,"columnArticles":137,"formTitle":"[962]最大宽度坡","frequency":0.0,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","submitted":30562,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5044580939171786,"acs":2546,"articleLive":2,"columnArticles":33,"formTitle":"[963]最小面积矩形 II","frequency":0.0,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","submitted":5047,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.4323208493069891,"acs":1466,"articleLive":2,"columnArticles":27,"formTitle":"[964]表示数字的最少运算符","frequency":0.0,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","submitted":3391,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6839802834257548,"acs":33303,"articleLive":2,"columnArticles":394,"formTitle":"[965]单值二叉树","frequency":0.0,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","submitted":48690,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.4042080501829587,"acs":3093,"articleLive":2,"columnArticles":50,"formTitle":"[966]元音拼写检查器","frequency":0.0,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","submitted":7652,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.46401151631477927,"acs":7736,"articleLive":2,"columnArticles":153,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","submitted":16672,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.49874468716022535,"acs":25229,"articleLive":2,"columnArticles":332,"formTitle":"[968]监控二叉树","frequency":0.0,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"","submitted":50585,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6510521885521886,"acs":15469,"articleLive":2,"columnArticles":198,"formTitle":"[969]煎饼排序","frequency":0.0,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","submitted":23760,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.4138433924164236,"acs":11067,"articleLive":2,"columnArticles":127,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","submitted":26742,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.44037462313169545,"acs":6865,"articleLive":2,"columnArticles":108,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":0.0,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","submitted":15589,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.41146496815286626,"acs":1292,"articleLive":2,"columnArticles":28,"formTitle":"[972]相等的有理数","frequency":0.0,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","submitted":3140,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.6413504895949286,"acs":67987,"articleLive":2,"columnArticles":638,"formTitle":"[973]最接近原点的 K 个点","frequency":0.0,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"ac","submitted":106006,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.4662455097237706,"acs":37640,"articleLive":2,"columnArticles":386,"formTitle":"[974]和可被 K 整除的子数组","frequency":0.0,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","submitted":80730,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.44751539452957184,"acs":3125,"articleLive":2,"columnArticles":47,"formTitle":"[975]奇偶跳","frequency":0.0,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","submitted":6983,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.5971858202656479,"acs":53773,"articleLive":2,"columnArticles":502,"formTitle":"[976]三角形的最大周长","frequency":0.0,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"ac","submitted":90044,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7096270236187585,"acs":176695,"articleLive":2,"columnArticles":1385,"formTitle":"[977]有序数组的平方","frequency":0.0,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"ac","submitted":248997,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.47331217069738524,"acs":43389,"articleLive":2,"columnArticles":600,"formTitle":"[978]最长湍流子数组","frequency":0.0,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","submitted":91671,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7133154452456817,"acs":8507,"articleLive":2,"columnArticles":133,"formTitle":"[979]在二叉树中分配硬币","frequency":0.0,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","submitted":11926,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7348399631864199,"acs":14372,"articleLive":2,"columnArticles":213,"formTitle":"[980]不同路径 III","frequency":0.0,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","submitted":19558,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5322183230045546,"acs":21384,"articleLive":2,"columnArticles":314,"formTitle":"[981]基于时间的键值存储","frequency":0.0,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"ac","submitted":40179,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5452802045599829,"acs":2559,"articleLive":2,"columnArticles":30,"formTitle":"[982]按位与为零的三元组","frequency":0.0,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","submitted":4693,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6341287480017156,"acs":32527,"articleLive":2,"columnArticles":455,"formTitle":"[983]最低票价","frequency":0.0,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","submitted":51294,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.4175354797225922,"acs":9091,"articleLive":2,"columnArticles":145,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":0.0,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","submitted":21773,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.6005751364105589,"acs":16290,"articleLive":2,"columnArticles":187,"formTitle":"[985]查询后的偶数和","frequency":0.0,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","questionId":"1027","status":"","submitted":27124,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6787957435764339,"acs":26154,"articleLive":2,"columnArticles":254,"formTitle":"[986]区间列表的交集","frequency":0.0,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"ac","submitted":38530,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5327000114455763,"acs":23271,"articleLive":2,"columnArticles":412,"formTitle":"[987]二叉树的垂序遍历","frequency":0.0,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"ac","submitted":43685,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.4988877118644068,"acs":9419,"articleLive":2,"columnArticles":112,"formTitle":"[988]从叶结点开始的最小字符串","frequency":0.0,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","submitted":18880,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.4713395694241137,"acs":52807,"articleLive":2,"columnArticles":596,"formTitle":"[989]数组形式的整数加法","frequency":0.0,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","submitted":112036,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.5030661968663318,"acs":33552,"articleLive":2,"columnArticles":504,"formTitle":"[990]等式方程的可满足性","frequency":0.0,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","submitted":66695,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.520350731678417,"acs":8783,"articleLive":2,"columnArticles":110,"formTitle":"[991]坏了的计算器","frequency":0.0,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","submitted":16879,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.452882081057336,"acs":23712,"articleLive":2,"columnArticles":273,"formTitle":"[992]K 个不同整数的子数组","frequency":0.0,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","submitted":52358,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5570243790799813,"acs":51112,"articleLive":2,"columnArticles":809,"formTitle":"[993]二叉树的堂兄弟节点","frequency":0.0,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"ac","submitted":91759,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5095075840844142,"acs":55626,"articleLive":2,"columnArticles":1413,"formTitle":"[994]腐烂的橘子","frequency":0.0,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"ac","submitted":109176,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5396877196505673,"acs":21499,"articleLive":2,"columnArticles":251,"formTitle":"[995]K 连续位的最小翻转次数","frequency":0.0,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","submitted":39836,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.49408687741642027,"acs":4345,"articleLive":2,"columnArticles":89,"formTitle":"[996]正方形数组的数目","frequency":0.0,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","submitted":8794,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5102610522242644,"acs":36923,"articleLive":2,"columnArticles":401,"formTitle":"[997]找到小镇的法官","frequency":0.0,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","submitted":72361,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6150707943364531,"acs":7689,"articleLive":2,"columnArticles":111,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","submitted":12501,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6906458545413415,"acs":30530,"articleLive":2,"columnArticles":572,"formTitle":"[999]可以被一步捕获的棋子数","frequency":0.0,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","submitted":44205,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.41026816410726563,"acs":3580,"articleLive":2,"columnArticles":41,"formTitle":"[1000]合并石头的最低成本","frequency":0.0,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","submitted":8726,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.29210999032748375,"acs":2114,"articleLive":2,"columnArticles":54,"formTitle":"[1001]网格照明","frequency":0.0,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","submitted":7237,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7355062235339407,"acs":57318,"articleLive":2,"columnArticles":604,"formTitle":"[1002]查找共用字符","frequency":0.0,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","submitted":77930,"title":"查找共用字符","titleSlug":"find-common-characters"},{"acceptance":0.5770975056689343,"acs":12216,"articleLive":2,"columnArticles":187,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"ac","submitted":21168,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5969804493316236,"acs":67971,"articleLive":2,"columnArticles":717,"formTitle":"[1004]最大连续1的个数 III","frequency":0.0,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"ac","submitted":113858,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5304455095148537,"acs":26230,"articleLive":2,"columnArticles":423,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":0.0,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","submitted":49449,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.6273718493344661,"acs":44305,"articleLive":2,"columnArticles":605,"formTitle":"[1006]笨阶乘","frequency":0.0,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"ac","submitted":70620,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.46535890088898685,"acs":6334,"articleLive":2,"columnArticles":86,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","submitted":13611,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.722732159100306,"acs":17480,"articleLive":2,"columnArticles":222,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":0.0,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","submitted":24186,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5926623851094105,"acs":15411,"articleLive":2,"columnArticles":214,"formTitle":"[1009]十进制整数的反码","frequency":0.0,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","submitted":26003,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.4526413436187872,"acs":18542,"articleLive":2,"columnArticles":247,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":0.0,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","questionId":"1055","status":"","submitted":40964,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6263181268913378,"acs":60642,"articleLive":2,"columnArticles":583,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":0.0,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"ac","submitted":96823,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.3346712952918203,"acs":3085,"articleLive":2,"columnArticles":66,"formTitle":"[1012]至少有 1 位重复的数字","frequency":0.0,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","submitted":9218,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.3969648966109978,"acs":47111,"articleLive":2,"columnArticles":924,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":0.0,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1062","status":"","submitted":118678,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5510482552768105,"acs":38769,"articleLive":2,"columnArticles":459,"formTitle":"[1014]最佳观光组合","frequency":0.0,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","submitted":70355,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.35492077336822214,"acs":4883,"articleLive":2,"columnArticles":42,"formTitle":"[1015]可被 K 整除的最小整数","frequency":0.0,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","submitted":13758,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5823221640877213,"acs":5231,"articleLive":2,"columnArticles":81,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.0,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1065","status":"","submitted":8983,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.560510557831705,"acs":3557,"articleLive":2,"columnArticles":57,"formTitle":"[1017]负二进制转换","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","submitted":6346,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.5163656818741137,"acs":44062,"articleLive":2,"columnArticles":377,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","submitted":85331,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.5990170399364313,"acs":20354,"articleLive":2,"columnArticles":264,"formTitle":"[1019]链表中的下一个更大节点","frequency":0.0,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"ac","submitted":33979,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5370476408612002,"acs":9379,"articleLive":2,"columnArticles":139,"formTitle":"[1020]飞地的数量","frequency":0.0,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","submitted":17464,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7830360885379342,"acs":57911,"articleLive":2,"columnArticles":657,"formTitle":"[1021]删除最外层的括号","frequency":0.0,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"ac","submitted":73957,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7042995544869528,"acs":19919,"articleLive":2,"columnArticles":267,"formTitle":"[1022]从根到叶的二进制数之和","frequency":0.0,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","submitted":28282,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5641349877499408,"acs":7138,"articleLive":2,"columnArticles":156,"formTitle":"[1023]驼峰式匹配","frequency":0.0,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","submitted":12653,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5569239462837389,"acs":33509,"articleLive":2,"columnArticles":384,"formTitle":"[1024]视频拼接","frequency":0.0,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","submitted":60168,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.709597168633415,"acs":75587,"articleLive":2,"columnArticles":651,"formTitle":"[1025]除数博弈","frequency":0.0,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","submitted":106521,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6714333669016449,"acs":10001,"articleLive":2,"columnArticles":170,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","submitted":14895,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.43433000389155535,"acs":13393,"articleLive":2,"columnArticles":120,"formTitle":"[1027]最长等差数列","frequency":0.0,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"ac","submitted":30836,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7319132121560457,"acs":20375,"articleLive":2,"columnArticles":426,"formTitle":"[1028]从先序遍历还原二叉树","frequency":0.0,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","submitted":27838,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6560982243462719,"acs":16886,"articleLive":2,"columnArticles":182,"formTitle":"[1029]两地调度","frequency":0.0,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"ac","submitted":25737,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7105341532208616,"acs":40558,"articleLive":2,"columnArticles":444,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":0.0,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","submitted":57081,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5675927002208532,"acs":4883,"articleLive":2,"columnArticles":74,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","submitted":8603,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.39809464313603,"acs":2549,"articleLive":2,"columnArticles":42,"formTitle":"[1032]字符流","frequency":0.0,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","submitted":6403,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.3908903574220138,"acs":11002,"articleLive":2,"columnArticles":168,"formTitle":"[1033]移动石子直到连续","frequency":0.0,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","questionId":"1103","status":"","submitted":28146,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.4327339167227618,"acs":4500,"articleLive":2,"columnArticles":99,"formTitle":"[1034]边框着色","frequency":0.0,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","submitted":10399,"title":"边框着色","titleSlug":"coloring-a-border"},{"acceptance":0.6338105531733939,"acs":35771,"articleLive":2,"columnArticles":389,"formTitle":"[1035]不相交的线","frequency":0.0,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"ac","submitted":56438,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.3001285347043702,"acs":3269,"articleLive":2,"columnArticles":55,"formTitle":"[1036]逃离大迷宫","frequency":0.0,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","submitted":10892,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.4382892057026477,"acs":9684,"articleLive":2,"columnArticles":113,"formTitle":"[1037]有效的回旋镖","frequency":0.0,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","submitted":22095,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.7935751230759643,"acs":25469,"articleLive":2,"columnArticles":320,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":0.0,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","submitted":32094,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5548505186089079,"acs":4547,"articleLive":2,"columnArticles":61,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","submitted":8195,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.5209886229894076,"acs":2656,"articleLive":2,"columnArticles":31,"formTitle":"[1040]移动石子直到连续 II","frequency":0.0,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","submitted":5098,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.48304907761921334,"acs":6939,"articleLive":2,"columnArticles":115,"formTitle":"[1041]困于环中的机器人","frequency":0.0,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","submitted":14365,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5303839425467268,"acs":11521,"articleLive":2,"columnArticles":153,"formTitle":"[1042]不邻接植花","frequency":0.0,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","submitted":21722,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.690961057520543,"acs":7736,"articleLive":2,"columnArticles":101,"formTitle":"[1043]分隔数组以得到最大和","frequency":0.0,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","submitted":11196,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.20908498152575528,"acs":5772,"articleLive":2,"columnArticles":73,"formTitle":"[1044]最长重复子串","frequency":0.0,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"","submitted":27606,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6402493990384616,"acs":8523,"articleLive":2,"columnArticles":106,"formTitle":"[1045]买下所有产品的客户","frequency":0.0,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"lock","submitted":13312,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6599154684705388,"acs":66045,"articleLive":2,"columnArticles":918,"formTitle":"[1046]最后一块石头的重量","frequency":0.0,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","submitted":100081,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.7247187198870808,"acs":106796,"articleLive":2,"columnArticles":988,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":0.0,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"ac","submitted":147362,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.45607002994701684,"acs":9899,"articleLive":2,"columnArticles":138,"formTitle":"[1048]最长字符串链","frequency":0.0,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","submitted":21705,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6453445993186856,"acs":43382,"articleLive":2,"columnArticles":404,"formTitle":"[1049]最后一块石头的重量 II","frequency":0.0,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"ac","submitted":67223,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7583879293230097,"acs":11460,"articleLive":2,"columnArticles":54,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":0.0,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1136","status":"lock","submitted":15111,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7534805163469659,"acs":31228,"articleLive":2,"columnArticles":372,"formTitle":"[1051]高度检查器","frequency":0.0,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","submitted":41445,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5813757073394384,"acs":48185,"articleLive":2,"columnArticles":750,"formTitle":"[1052]爱生气的书店老板","frequency":0.0,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","submitted":82881,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.4582628747117602,"acs":5962,"articleLive":2,"columnArticles":96,"formTitle":"[1053]交换一次的先前排列","frequency":0.0,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","submitted":13010,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.3762525997352997,"acs":7960,"articleLive":2,"columnArticles":108,"formTitle":"[1054]距离相等的条形码","frequency":0.0,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","submitted":21156,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5872976338729763,"acs":4716,"articleLive":2,"columnArticles":89,"formTitle":"[1055]形成字符串的最短路径","frequency":0.0,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"lock","submitted":8030,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.41030281095427673,"acs":3401,"articleLive":2,"columnArticles":66,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"lock","submitted":8289,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.4661997563946407,"acs":3062,"articleLive":2,"columnArticles":39,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"lock","submitted":6568,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.342360756259581,"acs":1340,"articleLive":2,"columnArticles":31,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"lock","submitted":3914,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.3631151457238414,"acs":2280,"articleLive":2,"columnArticles":37,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"511","status":"lock","submitted":6279,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.5300229551769965,"acs":4387,"articleLive":2,"columnArticles":64,"formTitle":"[1060]有序数组中的缺失元素","frequency":0.0,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"lock","submitted":8277,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.6061985262245341,"acs":2797,"articleLive":2,"columnArticles":60,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"lock","submitted":4614,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.5433868203770058,"acs":3488,"articleLive":2,"columnArticles":49,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"lock","submitted":6419,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.7066666666666667,"acs":1855,"articleLive":2,"columnArticles":40,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"lock","submitted":2625,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6507915031795427,"acs":4810,"articleLive":2,"columnArticles":68,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"lock","submitted":7391,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5429393536963258,"acs":2453,"articleLive":2,"columnArticles":69,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"lock","submitted":4518,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.4747126436781609,"acs":2065,"articleLive":2,"columnArticles":42,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"lock","submitted":4350,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.42333163525216505,"acs":831,"articleLive":2,"columnArticles":26,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"lock","submitted":1963,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.8643426034730383,"acs":13240,"articleLive":2,"columnArticles":64,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"lock","submitted":15318,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8188596491228071,"acs":11202,"articleLive":2,"columnArticles":55,"formTitle":"[1069]产品销售分析 II","frequency":0.0,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"lock","submitted":13680,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.48090531966813077,"acs":7883,"articleLive":2,"columnArticles":71,"formTitle":"[1070]产品销售分析 III","frequency":0.0,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"lock","submitted":16392,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5866790634773054,"acs":34705,"articleLive":2,"columnArticles":673,"formTitle":"[1071]字符串的最大公因子","frequency":0.0,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"ac","submitted":59155,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5799198187205856,"acs":3327,"articleLive":2,"columnArticles":55,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":0.0,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1147","status":"","submitted":5737,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.3341618337475835,"acs":2420,"articleLive":2,"columnArticles":54,"formTitle":"[1073]负二进制数相加","frequency":0.0,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","submitted":7242,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6692930461182593,"acs":18518,"articleLive":2,"columnArticles":186,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":0.0,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"ac","submitted":27668,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6944685780480742,"acs":9592,"articleLive":2,"columnArticles":72,"formTitle":"[1075]项目员工 I","frequency":0.0,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"lock","submitted":13812,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.49617512629299976,"acs":10313,"articleLive":2,"columnArticles":88,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"lock","submitted":20785,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7204791785510554,"acs":7578,"articleLive":2,"columnArticles":87,"formTitle":"[1077]项目员工 III","frequency":0.0,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"lock","submitted":10518,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.6220224010096229,"acs":11829,"articleLive":2,"columnArticles":187,"formTitle":"[1078]Bigram 分词","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","submitted":19017,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.7343638833193196,"acs":11354,"articleLive":2,"columnArticles":188,"formTitle":"[1079]活字印刷","frequency":0.0,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","submitted":15461,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.49105597230236586,"acs":4255,"articleLive":2,"columnArticles":93,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","submitted":8665,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.5707702941402351,"acs":14864,"articleLive":2,"columnArticles":150,"formTitle":"[1081]不同字符的最小子序列","frequency":0.0,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"ac","submitted":26042,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7608781907155138,"acs":11506,"articleLive":2,"columnArticles":92,"formTitle":"[1082]销售分析 I ","frequency":0.0,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"lock","submitted":15122,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.5283977680350738,"acs":10606,"articleLive":2,"columnArticles":96,"formTitle":"[1083]销售分析 II","frequency":0.0,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"lock","submitted":20072,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5371401801051481,"acs":10319,"articleLive":2,"columnArticles":94,"formTitle":"[1084]销售分析III","frequency":0.0,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"lock","submitted":19211,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.7729304107256864,"acs":3632,"articleLive":2,"columnArticles":73,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"lock","submitted":4699,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6905559276624247,"acs":5155,"articleLive":2,"columnArticles":80,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"lock","submitted":7465,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.5343065693430656,"acs":1830,"articleLive":2,"columnArticles":54,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"lock","submitted":3425,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.4510474561778538,"acs":1055,"articleLive":2,"columnArticles":34,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"lock","submitted":2339,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.585080463227553,"acs":19451,"articleLive":2,"columnArticles":292,"formTitle":"[1089]复写零","frequency":0.0,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","submitted":33245,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5450637825845812,"acs":3931,"articleLive":2,"columnArticles":80,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","submitted":7212,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.37866585018437415,"acs":28445,"articleLive":2,"columnArticles":289,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":0.0,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"ac","submitted":75119,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.4898072646404744,"acs":2643,"articleLive":2,"columnArticles":52,"formTitle":"[1092]最短公共超序列","frequency":0.0,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","submitted":5396,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.3786994367639529,"acs":3698,"articleLive":2,"columnArticles":59,"formTitle":"[1093]大样本统计","frequency":0.0,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","submitted":9765,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.6081521616942827,"acs":27050,"articleLive":2,"columnArticles":379,"formTitle":"[1094]拼车","frequency":0.0,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","submitted":44479,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.37275708685162845,"acs":19777,"articleLive":2,"columnArticles":386,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","submitted":53056,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5480925986305837,"acs":1681,"articleLive":2,"columnArticles":47,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","submitted":3067,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.5202273487128051,"acs":6224,"articleLive":2,"columnArticles":111,"formTitle":"[1097]游戏玩法分析 V","frequency":0.0,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"lock","submitted":11964,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.4734550112071726,"acs":7393,"articleLive":2,"columnArticles":103,"formTitle":"[1098]小众书籍","frequency":0.0,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"lock","submitted":15615,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5805876055667896,"acs":4881,"articleLive":2,"columnArticles":91,"formTitle":"[1099]小于 K 的两数之和","frequency":0.0,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"lock","submitted":8407,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.7004765146358066,"acs":5145,"articleLive":2,"columnArticles":101,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":0.0,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1084","status":"lock","submitted":7345,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.667220376522702,"acs":2410,"articleLive":2,"columnArticles":54,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1085","status":"lock","submitted":3612,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.37010502886554913,"acs":5321,"articleLive":2,"columnArticles":68,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"lock","submitted":14377,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6364999732195462,"acs":35651,"articleLive":2,"columnArticles":1105,"formTitle":"[1103]分糖果 II","frequency":0.0,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","submitted":56011,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.7609318616005094,"acs":28678,"articleLive":2,"columnArticles":672,"formTitle":"[1104]二叉树寻路","frequency":0.0,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"ac","submitted":37688,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5591409453917549,"acs":5181,"articleLive":2,"columnArticles":68,"formTitle":"[1105]填充书架","frequency":0.0,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","submitted":9266,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.57703271345188,"acs":4251,"articleLive":2,"columnArticles":126,"formTitle":"[1106]解析布尔表达式","frequency":0.0,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","submitted":7367,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.41209667525457,"acs":6718,"articleLive":2,"columnArticles":94,"formTitle":"[1107]每日新用户统计","frequency":0.0,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"lock","submitted":16302,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.8395058644249865,"acs":67210,"articleLive":2,"columnArticles":686,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","submitted":80059,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.5772010447966378,"acs":58781,"articleLive":2,"columnArticles":589,"formTitle":"[1109]航班预订统计","frequency":0.0,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"ac","submitted":101838,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6298582151793161,"acs":11328,"articleLive":2,"columnArticles":204,"formTitle":"[1110]删点成林","frequency":0.0,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","submitted":17985,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7712945830408984,"acs":24177,"articleLive":2,"columnArticles":399,"formTitle":"[1111]有效括号的嵌套深度","frequency":0.0,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"","submitted":31346,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.6452702702702703,"acs":7640,"articleLive":2,"columnArticles":87,"formTitle":"[1112]每位学生的最高成绩","frequency":0.0,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"lock","submitted":11840,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5410168434185901,"acs":6938,"articleLive":2,"columnArticles":48,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"lock","submitted":12824,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.6536598470411444,"acs":77862,"articleLive":2,"columnArticles":583,"formTitle":"[1114]按序打印","frequency":0.0,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","submitted":119117,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5614391693315554,"acs":43365,"articleLive":2,"columnArticles":480,"formTitle":"[1115]交替打印FooBar","frequency":0.0,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","submitted":77239,"title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.520017327071269,"acs":22809,"articleLive":2,"columnArticles":372,"formTitle":"[1116]打印零与奇偶数","frequency":0.0,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","submitted":43862,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.5213440153055123,"acs":17440,"articleLive":2,"columnArticles":252,"formTitle":"[1117]H2O 生成","frequency":0.0,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","submitted":33452,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.6431297709923665,"acs":2359,"articleLive":2,"columnArticles":37,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"lock","submitted":3668,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8667775122103294,"acs":8341,"articleLive":2,"columnArticles":146,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"lock","submitted":9623,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.6105625717566016,"acs":2659,"articleLive":2,"columnArticles":49,"formTitle":"[1120]子树的最大平均值","frequency":0.0,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"lock","submitted":4355,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5751565762004175,"acs":1102,"articleLive":2,"columnArticles":18,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"lock","submitted":1916,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.7068235701681264,"acs":65290,"articleLive":2,"columnArticles":873,"formTitle":"[1122]数组的相对排序","frequency":0.0,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","submitted":92371,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7027866448106289,"acs":8146,"articleLive":2,"columnArticles":105,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.0,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","submitted":11591,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.3184961213412972,"acs":12851,"articleLive":2,"columnArticles":134,"formTitle":"[1124]表现良好的最长时间段","frequency":0.0,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"ac","submitted":40349,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.4913806992105687,"acs":3050,"articleLive":2,"columnArticles":50,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","submitted":6207,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6939328889391029,"acs":6142,"articleLive":2,"columnArticles":94,"formTitle":"[1126]查询活跃业务","frequency":0.0,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"lock","submitted":8851,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.413297207169654,"acs":3966,"articleLive":2,"columnArticles":74,"formTitle":"[1127]用户购买平台","frequency":0.0,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"lock","submitted":9596,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.5449898948478369,"acs":37213,"articleLive":2,"columnArticles":480,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":0.0,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","submitted":68282,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.38003663003663,"acs":6225,"articleLive":2,"columnArticles":111,"formTitle":"[1129]颜色交替的最短路径","frequency":0.0,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","submitted":16380,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6291860958033065,"acs":5937,"articleLive":2,"columnArticles":104,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.0,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"ac","submitted":9436,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.4556719280129813,"acs":3089,"articleLive":2,"columnArticles":46,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","submitted":6779,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.39007734079315454,"acs":4741,"articleLive":2,"columnArticles":54,"formTitle":"[1132]报告的记录 II","frequency":0.0,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"lock","submitted":12154,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6482334869431644,"acs":2954,"articleLive":2,"columnArticles":63,"formTitle":"[1133]最大唯一数","frequency":0.0,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"lock","submitted":4557,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7765801077902988,"acs":3170,"articleLive":2,"columnArticles":53,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"lock","submitted":4082,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.5363175675675675,"acs":6350,"articleLive":2,"columnArticles":73,"formTitle":"[1135]最低成本联通所有城市","frequency":0.0,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"lock","submitted":11840,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5694275274056029,"acs":2805,"articleLive":2,"columnArticles":49,"formTitle":"[1136]平行课程","frequency":0.0,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"lock","submitted":4926,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.6083912354482842,"acs":79855,"articleLive":2,"columnArticles":879,"formTitle":"[1137]第 N 个泰波那契数","frequency":0.0,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"ac","submitted":131256,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.4328232486311947,"acs":6166,"articleLive":2,"columnArticles":139,"formTitle":"[1138]字母板上的路径","frequency":0.0,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","submitted":14246,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.4783664794291787,"acs":9453,"articleLive":2,"columnArticles":154,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":0.0,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","submitted":19761,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6519066372106426,"acs":6787,"articleLive":2,"columnArticles":96,"formTitle":"[1140]石子游戏 II","frequency":0.0,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","submitted":10411,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.509928393682393,"acs":10041,"articleLive":2,"columnArticles":65,"formTitle":"[1141]查询近30天活跃用户数","frequency":0.0,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1245","status":"lock","submitted":19691,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.37074158980647226,"acs":6954,"articleLive":2,"columnArticles":50,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1246","status":"lock","submitted":18757,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6371427491305005,"acs":168537,"articleLive":2,"columnArticles":1137,"formTitle":"[1143]最长公共子序列","frequency":0.0,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"ac","submitted":264520,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.4420305350040628,"acs":10336,"articleLive":2,"columnArticles":146,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":0.0,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"notac","submitted":23383,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.46902842596521,"acs":6633,"articleLive":2,"columnArticles":107,"formTitle":"[1145]二叉树着色游戏","frequency":0.0,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","submitted":14142,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.2873975756754927,"acs":4244,"articleLive":2,"columnArticles":62,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","submitted":14767,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5617823947512302,"acs":4110,"articleLive":2,"columnArticles":82,"formTitle":"[1147]段式回文","frequency":0.0,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","submitted":7316,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.714572497490647,"acs":7831,"articleLive":2,"columnArticles":35,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"lock","submitted":10959,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.4421740569159497,"acs":5345,"articleLive":2,"columnArticles":47,"formTitle":"[1149]文章浏览 II","frequency":0.0,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"lock","submitted":12088,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.6043533930857875,"acs":4720,"articleLive":2,"columnArticles":83,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":0.0,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1102","status":"lock","submitted":7810,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.48660765605241985,"acs":4233,"articleLive":2,"columnArticles":62,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":0.0,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"lock","submitted":8699,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.3879093198992443,"acs":1386,"articleLive":2,"columnArticles":33,"formTitle":"[1152]用户网站访问行为分析","frequency":0.0,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"lock","submitted":3573,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.37122364703325367,"acs":1708,"articleLive":2,"columnArticles":24,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"lock","submitted":4601,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.569391522960286,"acs":14495,"articleLive":2,"columnArticles":225,"formTitle":"[1154]一年中的第几天","frequency":0.0,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","submitted":25457,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.4784263959390863,"acs":9802,"articleLive":2,"columnArticles":126,"formTitle":"[1155]掷骰子的N种方法","frequency":0.0,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","submitted":20488,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.4308767690714532,"acs":4993,"articleLive":2,"columnArticles":86,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.0,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","submitted":11588,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.32068390325271057,"acs":3076,"articleLive":2,"columnArticles":47,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":0.0,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","submitted":9592,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5503845001498052,"acs":5511,"articleLive":2,"columnArticles":61,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"lock","submitted":10013,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.48794181446982265,"acs":3824,"articleLive":2,"columnArticles":84,"formTitle":"[1159]市场分析 II","frequency":0.0,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"lock","submitted":7837,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6870461304377896,"acs":59604,"articleLive":2,"columnArticles":911,"formTitle":"[1160]拼写单词","frequency":0.0,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1112","status":"","submitted":86754,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6336627732854148,"acs":10579,"articleLive":2,"columnArticles":175,"formTitle":"[1161]最大层内元素和","frequency":0.0,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","submitted":16695,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.46950370207462794,"acs":38427,"articleLive":2,"columnArticles":494,"formTitle":"[1162]地图分析","frequency":0.0,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","submitted":81846,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.2675084554678692,"acs":5932,"articleLive":2,"columnArticles":102,"formTitle":"[1163]按字典序排在最后的子串","frequency":0.0,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","submitted":22175,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6076580398812049,"acs":5729,"articleLive":2,"columnArticles":85,"formTitle":"[1164]指定日期的产品价格","frequency":0.0,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"lock","submitted":9428,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8373652957994282,"acs":7615,"articleLive":2,"columnArticles":113,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"lock","submitted":9094,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.4842105263157895,"acs":2714,"articleLive":2,"columnArticles":48,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"lock","submitted":5605,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.43439584877687176,"acs":2344,"articleLive":2,"columnArticles":35,"formTitle":"[1167]连接棒材的最低费用","frequency":0.0,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"lock","submitted":5396,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5688793718772306,"acs":1594,"articleLive":2,"columnArticles":27,"formTitle":"[1168]水资源分配优化","frequency":0.0,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"lock","submitted":2802,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.32249916599151696,"acs":6767,"articleLive":2,"columnArticles":81,"formTitle":"[1169]查询无效交易","frequency":0.0,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","submitted":20983,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6167258347189143,"acs":13724,"articleLive":2,"columnArticles":216,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":0.0,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","questionId":"1273","status":"","submitted":22253,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.4748896750428535,"acs":13021,"articleLive":2,"columnArticles":154,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":0.0,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"ac","submitted":27419,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.267855225002685,"acs":2494,"articleLive":2,"columnArticles":55,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","submitted":9311,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.7569735982834219,"acs":8114,"articleLive":2,"columnArticles":74,"formTitle":"[1173]即时食物配送 I","frequency":0.0,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"lock","submitted":10719,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.6188669701568033,"acs":4894,"articleLive":2,"columnArticles":62,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"lock","submitted":7908,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.4917052857814494,"acs":7321,"articleLive":2,"columnArticles":114,"formTitle":"[1175]质数排列","frequency":0.0,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","submitted":14889,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.4509457493244648,"acs":4339,"articleLive":2,"columnArticles":61,"formTitle":"[1176]健身计划评估","frequency":0.0,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"lock","submitted":9622,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.2657393850658858,"acs":6171,"articleLive":2,"columnArticles":95,"formTitle":"[1177]构建回文串检测","frequency":0.0,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","submitted":23222,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.46209825642044605,"acs":18605,"articleLive":2,"columnArticles":184,"formTitle":"[1178]猜字谜","frequency":0.0,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","submitted":40262,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.6367699087579914,"acs":30777,"articleLive":2,"columnArticles":185,"formTitle":"[1179]重新格式化部门表","frequency":0.0,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","submitted":48333,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7764851485148515,"acs":3137,"articleLive":2,"columnArticles":69,"formTitle":"[1180]统计只含单一字母的子串","frequency":0.0,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1131","status":"lock","submitted":4040,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.37285180572851806,"acs":1497,"articleLive":2,"columnArticles":28,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"lock","submitted":4015,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.39809967035097926,"acs":2053,"articleLive":2,"columnArticles":42,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"lock","submitted":5157,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.599444958371878,"acs":648,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"lock","submitted":1081,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5850998865916427,"acs":13414,"articleLive":2,"columnArticles":263,"formTitle":"[1184]公交站间的距离","frequency":0.0,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","submitted":22926,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6077175609493569,"acs":11292,"articleLive":2,"columnArticles":205,"formTitle":"[1185]一周中的第几天","frequency":0.0,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","submitted":18581,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.39395051373453555,"acs":7515,"articleLive":2,"columnArticles":107,"formTitle":"[1186]删除一次得到子数组最大和","frequency":0.0,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","submitted":19076,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.4415246212121212,"acs":1865,"articleLive":2,"columnArticles":33,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","submitted":4224,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.694033008887008,"acs":3280,"articleLive":2,"columnArticles":66,"formTitle":"[1188]设计有限阻塞队列","frequency":0.0,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"lock","submitted":4726,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6456295749523282,"acs":20992,"articleLive":2,"columnArticles":328,"formTitle":"[1189]“气球” 的最大数量","frequency":0.0,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","submitted":32514,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6508999942492381,"acs":45274,"articleLive":2,"columnArticles":615,"formTitle":"[1190]反转每对括号间的子串","frequency":0.0,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"ac","submitted":69556,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.26735709840874744,"acs":6015,"articleLive":2,"columnArticles":96,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","submitted":22498,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.49872093023255815,"acs":4289,"articleLive":2,"columnArticles":50,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","submitted":8600,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.601229640815446,"acs":5574,"articleLive":2,"columnArticles":73,"formTitle":"[1193]每月交易 I","frequency":0.0,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"lock","submitted":9271,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5060017147756501,"acs":3541,"articleLive":2,"columnArticles":64,"formTitle":"[1194]锦标赛优胜者","frequency":0.0,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"lock","submitted":6998,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6370735717221537,"acs":13950,"articleLive":2,"columnArticles":265,"formTitle":"[1195]交替打印字符串","frequency":0.0,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","submitted":21897,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6941834899060564,"acs":3473,"articleLive":2,"columnArticles":59,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.0,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"lock","submitted":5003,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.3704267133186278,"acs":4870,"articleLive":2,"columnArticles":61,"formTitle":"[1197]进击的骑士","frequency":0.0,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"lock","submitted":13147,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.746360153256705,"acs":3896,"articleLive":2,"columnArticles":57,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"lock","submitted":5220,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.43812907045589106,"acs":740,"articleLive":2,"columnArticles":17,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"lock","submitted":1689,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6854894169786812,"acs":17942,"articleLive":2,"columnArticles":253,"formTitle":"[1200]最小绝对差","frequency":0.0,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","submitted":26174,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.24737551570605776,"acs":6056,"articleLive":2,"columnArticles":87,"formTitle":"[1201]丑数 III","frequency":0.0,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","submitted":24481,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.5032072260767116,"acs":26908,"articleLive":2,"columnArticles":297,"formTitle":"[1202]交换字符串中的元素","frequency":0.0,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","submitted":53473,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.621596724667349,"acs":12146,"articleLive":2,"columnArticles":144,"formTitle":"[1203]项目管理","frequency":0.0,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","submitted":19540,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7261858850752024,"acs":5649,"articleLive":2,"columnArticles":82,"formTitle":"[1204]最后一个能进入电梯的人","frequency":0.0,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1327","status":"lock","submitted":7779,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.4678605415693399,"acs":5408,"articleLive":2,"columnArticles":83,"formTitle":"[1205]每月交易II","frequency":0.0,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"lock","submitted":11559,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6127723383611184,"acs":6947,"articleLive":2,"columnArticles":91,"formTitle":"[1206]设计跳表","frequency":0.0,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","submitted":11337,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7305177808349261,"acs":60004,"articleLive":2,"columnArticles":834,"formTitle":"[1207]独一无二的出现次数","frequency":0.0,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","submitted":82139,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.496914836971842,"acs":47595,"articleLive":2,"columnArticles":614,"formTitle":"[1208]尽可能使字符串相等","frequency":0.0,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","submitted":95781,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5286972365624051,"acs":12187,"articleLive":2,"columnArticles":159,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":0.0,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"ac","submitted":23051,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.4488626790227464,"acs":2664,"articleLive":2,"columnArticles":54,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":0.0,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","submitted":5935,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6556390977443609,"acs":7412,"articleLive":2,"columnArticles":62,"formTitle":"[1211]查询结果的质量和占比","frequency":0.0,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"lock","submitted":11305,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5097225035446628,"acs":5033,"articleLive":2,"columnArticles":99,"formTitle":"[1212]查询球队积分","frequency":0.0,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"lock","submitted":9874,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7756351791530944,"acs":5953,"articleLive":2,"columnArticles":126,"formTitle":"[1213]三个有序数组的交集","frequency":0.0,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"lock","submitted":7675,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6350666416369438,"acs":3383,"articleLive":2,"columnArticles":71,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":0.0,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"lock","submitted":5327,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.4121848739495798,"acs":1962,"articleLive":2,"columnArticles":40,"formTitle":"[1215]步进数","frequency":0.0,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"lock","submitted":4760,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5384057971014493,"acs":1486,"articleLive":2,"columnArticles":38,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"lock","submitted":2760,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6941344324667089,"acs":21893,"articleLive":2,"columnArticles":356,"formTitle":"[1217]玩筹码","frequency":0.0,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1329","status":"ac","submitted":31540,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.4227597024743207,"acs":8355,"articleLive":2,"columnArticles":114,"formTitle":"[1218]最长定差子序列","frequency":0.0,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"","submitted":19763,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.630426851514046,"acs":12096,"articleLive":2,"columnArticles":173,"formTitle":"[1219]黄金矿工","frequency":0.0,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","submitted":19187,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5267628421194553,"acs":3907,"articleLive":2,"columnArticles":75,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","submitted":7417,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.8439337547074239,"acs":76641,"articleLive":2,"columnArticles":1111,"formTitle":"[1221]分割平衡字符串","frequency":0.0,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"ac","submitted":90814,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.672372475179733,"acs":5892,"articleLive":2,"columnArticles":131,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.0,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","submitted":8763,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.4746118338229123,"acs":3393,"articleLive":2,"columnArticles":56,"formTitle":"[1223]掷骰子模拟","frequency":0.0,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","questionId":"1343","status":"","submitted":7149,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.3272828044894,"acs":4724,"articleLive":2,"columnArticles":70,"formTitle":"[1224]最大相等频率","frequency":0.0,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","submitted":14434,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5379685998077539,"acs":3358,"articleLive":2,"columnArticles":79,"formTitle":"[1225]报告系统状态的连续日期","frequency":0.0,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"lock","submitted":6242,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.5965826527033121,"acs":11906,"articleLive":2,"columnArticles":137,"formTitle":"[1226]哲学家进餐","frequency":0.0,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","submitted":19957,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6627654678151095,"acs":10080,"articleLive":2,"columnArticles":157,"formTitle":"[1227]飞机座位分配概率","frequency":0.0,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","submitted":15209,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5401396160558464,"acs":3095,"articleLive":2,"columnArticles":52,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"lock","submitted":5730,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.41906721536351166,"acs":2444,"articleLive":2,"columnArticles":45,"formTitle":"[1229]安排会议日程","frequency":0.0,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"lock","submitted":5832,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.49526365645721504,"acs":3137,"articleLive":2,"columnArticles":63,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"lock","submitted":6334,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.5647926267281106,"acs":3064,"articleLive":2,"columnArticles":42,"formTitle":"[1231]分享巧克力","frequency":0.0,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"lock","submitted":5425,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.46954737075660086,"acs":33860,"articleLive":2,"columnArticles":422,"formTitle":"[1232]缀点成线","frequency":0.0,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","submitted":72112,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.48246768788894207,"acs":8063,"articleLive":2,"columnArticles":117,"formTitle":"[1233]删除子文件夹","frequency":0.0,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","submitted":16712,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.3440791387838231,"acs":5913,"articleLive":2,"columnArticles":90,"formTitle":"[1234]替换子串得到平衡字符串","frequency":0.0,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","submitted":17185,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.46371463714637146,"acs":6409,"articleLive":2,"columnArticles":111,"formTitle":"[1235]规划兼职工作","frequency":0.0,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","submitted":13821,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.5628259838786155,"acs":1187,"articleLive":2,"columnArticles":32,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"lock","submitted":2109,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.7107120396897492,"acs":10171,"articleLive":2,"columnArticles":132,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","questionId":"1358","status":"","submitted":14311,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.6600881797186647,"acs":3144,"articleLive":2,"columnArticles":72,"formTitle":"[1238]循环码排列","frequency":0.0,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","submitted":4763,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.49109673053335023,"acs":34833,"articleLive":2,"columnArticles":385,"formTitle":"[1239]串联字符串的最大长度","frequency":0.0,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","questionId":"1360","status":"","submitted":70929,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.4956622325043378,"acs":2571,"articleLive":2,"columnArticles":39,"formTitle":"[1240]铺瓷砖","frequency":0.0,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","submitted":5187,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5933432502789141,"acs":6382,"articleLive":2,"columnArticles":64,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"lock","submitted":10756,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.47078907435508344,"acs":1241,"articleLive":2,"columnArticles":20,"formTitle":"[1242]多线程网页爬虫","frequency":0.0,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"lock","submitted":2636,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5412767727178207,"acs":2603,"articleLive":2,"columnArticles":56,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"lock","submitted":4809,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6212540921682196,"acs":2467,"articleLive":2,"columnArticles":42,"formTitle":"[1244]力扣排行榜","frequency":0.0,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"lock","submitted":3971,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5101220387652549,"acs":3553,"articleLive":2,"columnArticles":63,"formTitle":"[1245]树的直径","frequency":0.0,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"lock","submitted":6965,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.4808475957620212,"acs":2950,"articleLive":2,"columnArticles":42,"formTitle":"[1246]删除回文子数组","frequency":0.0,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"lock","submitted":6135,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.6177677182062526,"acs":8734,"articleLive":2,"columnArticles":156,"formTitle":"[1247]交换字符使得字符串相同","frequency":0.0,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"ac","submitted":14138,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5597842564667209,"acs":35080,"articleLive":2,"columnArticles":482,"formTitle":"[1248]统计「优美子数组」","frequency":0.0,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","submitted":62667,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5754830614805521,"acs":22933,"articleLive":2,"columnArticles":321,"formTitle":"[1249]移除无效的括号","frequency":0.0,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"ac","submitted":39850,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5617283950617284,"acs":2730,"articleLive":2,"columnArticles":39,"formTitle":"[1250]检查「好数组」","frequency":0.0,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","submitted":4860,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7715434699348909,"acs":8058,"articleLive":2,"columnArticles":96,"formTitle":"[1251]平均售价","frequency":0.0,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"lock","submitted":10444,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.7486038141728375,"acs":18096,"articleLive":2,"columnArticles":317,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","submitted":24173,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.39414144441114773,"acs":5261,"articleLive":2,"columnArticles":79,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":0.0,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","submitted":13348,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.5989868453305008,"acs":14662,"articleLive":2,"columnArticles":230,"formTitle":"[1254]统计封闭岛屿的数目","frequency":0.0,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"ac","submitted":24478,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6823235761288858,"acs":3007,"articleLive":2,"columnArticles":65,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","submitted":4407,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6675347222222222,"acs":1538,"articleLive":2,"columnArticles":37,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"lock","submitted":2304,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.5635189172562288,"acs":1832,"articleLive":2,"columnArticles":40,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"lock","submitted":3251,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.5559062218214608,"acs":1233,"articleLive":2,"columnArticles":44,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"lock","submitted":2218,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.4798455225681873,"acs":1988,"articleLive":2,"columnArticles":45,"formTitle":"[1259]不相交的握手","frequency":0.0,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"lock","submitted":4143,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6048367593712213,"acs":12505,"articleLive":2,"columnArticles":253,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","submitted":20675,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.7293888528238894,"acs":7865,"articleLive":2,"columnArticles":100,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","submitted":10783,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5253301320528211,"acs":13128,"articleLive":2,"columnArticles":202,"formTitle":"[1262]可被三整除的最大和","frequency":0.0,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","submitted":24990,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.4199140016124698,"acs":3125,"articleLive":2,"columnArticles":58,"formTitle":"[1263]推箱子","frequency":0.0,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","questionId":"1389","status":"","submitted":7442,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.5680046538685282,"acs":4882,"articleLive":2,"columnArticles":86,"formTitle":"[1264]页面推荐","frequency":0.0,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"lock","submitted":8595,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.9223592135954681,"acs":2768,"articleLive":2,"columnArticles":68,"formTitle":"[1265]逆序打印不可变链表","frequency":0.0,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"lock","submitted":3001,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8241882223445239,"acs":29951,"articleLive":2,"columnArticles":456,"formTitle":"[1266]访问所有点的最小时间","frequency":0.0,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","submitted":36340,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6071014305967264,"acs":9421,"articleLive":2,"columnArticles":147,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","submitted":15518,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.5854741285204861,"acs":8045,"articleLive":2,"columnArticles":145,"formTitle":"[1268]搜索推荐系统","frequency":0.0,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"ac","submitted":13741,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.4915132990830461,"acs":30232,"articleLive":2,"columnArticles":321,"formTitle":"[1269]停在原地的方案数","frequency":0.0,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","questionId":"1398","status":"ac","submitted":61508,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.8015481115707994,"acs":6006,"articleLive":2,"columnArticles":85,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":0.0,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","questionId":"1405","status":"lock","submitted":7493,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.5073180787466501,"acs":2461,"articleLive":2,"columnArticles":40,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"lock","submitted":4851,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.5194471231115397,"acs":1616,"articleLive":2,"columnArticles":30,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"lock","submitted":3111,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.5432907899275612,"acs":1575,"articleLive":2,"columnArticles":47,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"lock","submitted":2899,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.6031843233312921,"acs":985,"articleLive":2,"columnArticles":25,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"lock","submitted":1633,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5425285837023329,"acs":8209,"articleLive":2,"columnArticles":170,"formTitle":"[1275]找出井字棋的获胜者","frequency":0.0,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","questionId":"1400","status":"","submitted":15131,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5016463741480971,"acs":6551,"articleLive":2,"columnArticles":97,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","questionId":"1401","status":"","submitted":13059,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7252535917643953,"acs":19233,"articleLive":2,"columnArticles":237,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":0.0,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","submitted":26519,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.5976728941330711,"acs":3647,"articleLive":2,"columnArticles":59,"formTitle":"[1278]分割回文串 III","frequency":0.0,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","submitted":6102,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.621011673151751,"acs":1596,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":0.0,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1410","status":"lock","submitted":2570,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.5057634730538922,"acs":6757,"articleLive":2,"columnArticles":70,"formTitle":"[1280]学生们参加各科测试的次数","frequency":0.0,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"lock","submitted":13360,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.8318198462101795,"acs":45434,"articleLive":2,"columnArticles":620,"formTitle":"[1281]整数的各位积和之差","frequency":0.0,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","questionId":"1406","status":"","submitted":54620,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8105092442426208,"acs":12494,"articleLive":2,"columnArticles":229,"formTitle":"[1282]用户分组","frequency":0.0,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","questionId":"1407","status":"","submitted":15415,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.4173716192064816,"acs":7006,"articleLive":2,"columnArticles":100,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":0.0,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","submitted":16786,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6616865029121296,"acs":2613,"articleLive":2,"columnArticles":59,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":0.0,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","questionId":"1409","status":"","submitted":3949,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8112619222303742,"acs":4423,"articleLive":2,"columnArticles":61,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","questionId":"1420","status":"lock","submitted":5452,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.6458192624611644,"acs":4781,"articleLive":2,"columnArticles":94,"formTitle":"[1286]字母组合迭代器","frequency":0.0,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","submitted":7403,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6032404356758014,"acs":15563,"articleLive":2,"columnArticles":217,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":0.0,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","questionId":"1221","status":"","submitted":25799,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.5631537925093326,"acs":13728,"articleLive":2,"columnArticles":170,"formTitle":"[1288]删除被覆盖区间","frequency":0.0,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","submitted":24377,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.6268571969338507,"acs":6624,"articleLive":2,"columnArticles":99,"formTitle":"[1289]下降路径最小和  II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","submitted":10567,"title":"下降路径最小和  II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8085396150737825,"acs":54025,"articleLive":2,"columnArticles":703,"formTitle":"[1290]二进制链表转整数","frequency":0.0,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","questionId":"1411","status":"ac","submitted":66818,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5189165317238333,"acs":7050,"articleLive":2,"columnArticles":157,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","submitted":13586,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.47063381373004803,"acs":6074,"articleLive":2,"columnArticles":96,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":0.0,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","questionId":"1413","status":"","submitted":12906,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.3603312896633323,"acs":13400,"articleLive":2,"columnArticles":128,"formTitle":"[1293]网格中的最短路径","frequency":0.0,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","questionId":"1414","status":"","submitted":37188,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6556902985074626,"acs":7029,"articleLive":2,"columnArticles":73,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"lock","submitted":10720,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.8080049611987329,"acs":48208,"articleLive":2,"columnArticles":639,"formTitle":"[1295]统计位数为偶数的数字","frequency":0.0,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","submitted":59663,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.4544442491357591,"acs":7756,"articleLive":2,"columnArticles":124,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.0,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","questionId":"1422","status":"","submitted":17067,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.4588900671615412,"acs":6491,"articleLive":2,"columnArticles":93,"formTitle":"[1297]子串的最大出现次数","frequency":0.0,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","submitted":14145,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5967631638933212,"acs":2618,"articleLive":2,"columnArticles":89,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","submitted":4387,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7866278170285184,"acs":30507,"articleLive":2,"columnArticles":434,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","questionId":"1231","status":"","submitted":38782,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.4663054586121127,"acs":24184,"articleLive":2,"columnArticles":365,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":0.0,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","submitted":51863,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.3617614269788183,"acs":3245,"articleLive":2,"columnArticles":79,"formTitle":"[1301]最大得分的路径数目","frequency":0.0,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","submitted":8970,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8194736191770666,"acs":19896,"articleLive":2,"columnArticles":295,"formTitle":"[1302]层数最深叶子节点的和","frequency":0.0,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","submitted":24279,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8219494184973233,"acs":8905,"articleLive":2,"columnArticles":84,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"lock","submitted":10834,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7237194481168853,"acs":21349,"articleLive":2,"columnArticles":384,"formTitle":"[1304]和为零的N个唯一整数","frequency":0.0,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","questionId":"1426","status":"","submitted":29499,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7474421376775603,"acs":15049,"articleLive":2,"columnArticles":227,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":0.0,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","submitted":20134,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5754287025804125,"acs":17550,"articleLive":2,"columnArticles":273,"formTitle":"[1306]跳跃游戏 III","frequency":0.0,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","submitted":30499,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.3307001795332136,"acs":1842,"articleLive":2,"columnArticles":54,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","submitted":5570,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7509825940482875,"acs":5350,"articleLive":2,"columnArticles":61,"formTitle":"[1308]不同性别每日分数总计","frequency":0.0,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"lock","submitted":7124,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7558951569018683,"acs":16669,"articleLive":2,"columnArticles":289,"formTitle":"[1309]解码字母到整数映射","frequency":0.0,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","submitted":22052,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.7129624291342366,"acs":37099,"articleLive":2,"columnArticles":498,"formTitle":"[1310]子数组异或查询","frequency":0.0,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"ac","submitted":52035,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.3782147230915771,"acs":5559,"articleLive":2,"columnArticles":87,"formTitle":"[1311]获取你好友已观看的视频","frequency":0.0,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","submitted":14698,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6665214143426295,"acs":10707,"articleLive":2,"columnArticles":153,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":0.0,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","questionId":"1437","status":"","submitted":16064,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8320447754114689,"acs":35084,"articleLive":2,"columnArticles":544,"formTitle":"[1313]解压缩编码列表","frequency":0.0,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","submitted":42166,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7402079830624572,"acs":11887,"articleLive":2,"columnArticles":194,"formTitle":"[1314]矩阵区域和","frequency":0.0,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","submitted":16059,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.8097962776659959,"acs":12879,"articleLive":2,"columnArticles":264,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","submitted":15904,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.44025851197982346,"acs":2793,"articleLive":2,"columnArticles":60,"formTitle":"[1316]不同的循环子字符串","frequency":0.0,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","submitted":6344,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6149183869419107,"acs":10247,"articleLive":2,"columnArticles":194,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","questionId":"1440","status":"ac","submitted":16664,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6548013245033113,"acs":6328,"articleLive":2,"columnArticles":114,"formTitle":"[1318]或运算的最小翻转次数","frequency":0.0,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","questionId":"1441","status":"","submitted":9664,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6167177364797645,"acs":30995,"articleLive":2,"columnArticles":513,"formTitle":"[1319]连通网络的操作次数","frequency":0.0,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","submitted":50258,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5891968727789624,"acs":2487,"articleLive":2,"columnArticles":57,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","questionId":"1443","status":"","submitted":4221,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.612979106129791,"acs":4430,"articleLive":2,"columnArticles":78,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.0,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"lock","submitted":7227,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5931639107757186,"acs":5345,"articleLive":2,"columnArticles":64,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"lock","submitted":9011,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.7551410513334361,"acs":24493,"articleLive":2,"columnArticles":479,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":0.0,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","submitted":32435,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5893796526054591,"acs":5938,"articleLive":2,"columnArticles":116,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","submitted":10075,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.7276333498618687,"acs":10272,"articleLive":2,"columnArticles":182,"formTitle":"[1325]删除给定值的叶子节点","frequency":0.0,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","submitted":14117,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.4726319239593576,"acs":5768,"articleLive":2,"columnArticles":92,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":0.0,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","questionId":"1451","status":"","submitted":12204,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6883489096573209,"acs":5524,"articleLive":2,"columnArticles":53,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","questionId":"1462","status":"lock","submitted":8025,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.4628323385784048,"acs":5971,"articleLive":2,"columnArticles":122,"formTitle":"[1328]破坏回文串","frequency":0.0,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","submitted":12901,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.77152281473337,"acs":7017,"articleLive":2,"columnArticles":158,"formTitle":"[1329]将矩阵按对角线排序","frequency":0.0,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","submitted":9095,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.3785529715762274,"acs":1172,"articleLive":2,"columnArticles":29,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":0.0,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","submitted":3096,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5358849517626905,"acs":11887,"articleLive":2,"columnArticles":203,"formTitle":"[1331]数组序号转换","frequency":0.0,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","submitted":22182,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6873463485177151,"acs":9506,"articleLive":2,"columnArticles":135,"formTitle":"[1332]删除回文子序列","frequency":0.0,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"ac","submitted":13830,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5441389290882779,"acs":5640,"articleLive":2,"columnArticles":117,"formTitle":"[1333]餐厅过滤器","frequency":0.0,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","questionId":"1455","status":"","submitted":10365,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.49037548554164867,"acs":5681,"articleLive":2,"columnArticles":93,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":0.0,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","questionId":"1456","status":"","submitted":11585,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5853739796768282,"acs":3514,"articleLive":2,"columnArticles":58,"formTitle":"[1335]工作计划的最低难度","frequency":0.0,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","submitted":6003,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.4215594175669328,"acs":1795,"articleLive":2,"columnArticles":49,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"lock","submitted":4258,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.7055324534442234,"acs":39023,"articleLive":2,"columnArticles":626,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":0.0,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"ac","submitted":55310,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6401520484302408,"acs":9094,"articleLive":2,"columnArticles":130,"formTitle":"[1338]数组大小减半","frequency":0.0,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"ac","submitted":14206,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.39877915017406645,"acs":8362,"articleLive":2,"columnArticles":131,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":0.0,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","submitted":20969,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5738197986138355,"acs":4388,"articleLive":2,"columnArticles":95,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","submitted":7647,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.4802418787793559,"acs":3415,"articleLive":2,"columnArticles":49,"formTitle":"[1341]电影评分","frequency":0.0,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"lock","submitted":7111,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.8204993173395748,"acs":42067,"articleLive":2,"columnArticles":641,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.0,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","questionId":"1444","status":"","submitted":51270,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.544956000510139,"acs":12819,"articleLive":2,"columnArticles":214,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","questionId":"1445","status":"","submitted":23523,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.5930289641629848,"acs":6040,"articleLive":2,"columnArticles":121,"formTitle":"[1344]时钟指针的夹角","frequency":0.0,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","submitted":10185,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.36646977504084455,"acs":5832,"articleLive":2,"columnArticles":109,"formTitle":"[1345]跳跃游戏 IV","frequency":0.0,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","submitted":15914,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.43515564844351556,"acs":15824,"articleLive":2,"columnArticles":268,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","submitted":36364,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7405486942585086,"acs":7855,"articleLive":2,"columnArticles":117,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","questionId":"1469","status":"ac","submitted":10607,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.30644105824062823,"acs":3278,"articleLive":2,"columnArticles":51,"formTitle":"[1348]推文计数","frequency":0.0,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","submitted":10697,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5066773934030572,"acs":3149,"articleLive":2,"columnArticles":95,"formTitle":"[1349]参加考试的最大学生数","frequency":0.0,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","submitted":6215,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.8483569490503468,"acs":8442,"articleLive":2,"columnArticles":86,"formTitle":"[1350]院系无效的学生","frequency":0.0,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"lock","submitted":9951,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7546726017349958,"acs":29839,"articleLive":2,"columnArticles":546,"formTitle":"[1351]统计有序矩阵中的负数","frequency":0.0,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","submitted":39539,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.4449697050402823,"acs":6683,"articleLive":2,"columnArticles":73,"formTitle":"[1352]最后 K 个数的乘积","frequency":0.0,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","submitted":15019,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.28529223496971784,"acs":11588,"articleLive":2,"columnArticles":156,"formTitle":"[1353]最多可以参加的会议数目","frequency":0.0,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","questionId":"1478","status":"","submitted":40618,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.2813165537270087,"acs":2906,"articleLive":2,"columnArticles":72,"formTitle":"[1354]多次求和构造目标数组","frequency":0.0,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","submitted":10330,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6611471491976784,"acs":3873,"articleLive":2,"columnArticles":59,"formTitle":"[1355]活动参与者","frequency":0.0,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"lock","submitted":5858,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.7316665073142747,"acs":45915,"articleLive":2,"columnArticles":508,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":0.0,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","questionId":"1458","status":"","submitted":62754,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5311160192282708,"acs":4088,"articleLive":2,"columnArticles":42,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.0,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","submitted":7697,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.4956308982873121,"acs":5672,"articleLive":2,"columnArticles":112,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":0.0,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","submitted":11444,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5499612703330752,"acs":2840,"articleLive":2,"columnArticles":65,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","submitted":5164,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.5055856067732831,"acs":8599,"articleLive":2,"columnArticles":141,"formTitle":"[1360]日期之间隔几天","frequency":0.0,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","submitted":17008,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.4017885830566563,"acs":7503,"articleLive":2,"columnArticles":202,"formTitle":"[1361]验证二叉树","frequency":0.0,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","submitted":18674,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5245772709398349,"acs":5336,"articleLive":2,"columnArticles":68,"formTitle":"[1362]最接近的因数","frequency":0.0,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","submitted":10172,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.3644777434993389,"acs":4962,"articleLive":2,"columnArticles":97,"formTitle":"[1363]形成三的最大倍数","frequency":0.0,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","submitted":13614,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6743907311226528,"acs":3376,"articleLive":2,"columnArticles":65,"formTitle":"[1364]顾客的可信联系人数量","frequency":0.0,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","questionId":"1495","status":"lock","submitted":5006,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8250768903417993,"acs":85308,"articleLive":2,"columnArticles":1090,"formTitle":"[1365]有多少小于当前数字的数字","frequency":0.0,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","questionId":"1482","status":"","submitted":103394,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5382813090469353,"acs":7122,"articleLive":2,"columnArticles":140,"formTitle":"[1366]通过投票对团队排名","frequency":0.0,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","submitted":13231,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.41798275626111947,"acs":15271,"articleLive":2,"columnArticles":223,"formTitle":"[1367]二叉树中的列表","frequency":0.0,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"ac","submitted":36535,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5253348864298194,"acs":3608,"articleLive":2,"columnArticles":88,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.0,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","questionId":"1485","status":"","submitted":6868,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.6061545273411556,"acs":2738,"articleLive":2,"columnArticles":42,"formTitle":"[1369]获取最近第二次的活动","frequency":0.0,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"lock","submitted":4517,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7901327774951172,"acs":48142,"articleLive":2,"columnArticles":580,"formTitle":"[1370]上升下降字符串","frequency":0.0,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","submitted":60929,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5800769000027269,"acs":21272,"articleLive":2,"columnArticles":267,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":0.0,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","questionId":"1473","status":"","submitted":36671,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5133649762677992,"acs":8220,"articleLive":2,"columnArticles":162,"formTitle":"[1372]二叉树中的最长交错路径","frequency":0.0,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","submitted":16012,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.4047335999135416,"acs":7490,"articleLive":2,"columnArticles":168,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":0.0,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","submitted":18506,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7396699612487482,"acs":16988,"articleLive":2,"columnArticles":227,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","questionId":"1490","status":"","submitted":22967,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.5747521480502313,"acs":8696,"articleLive":2,"columnArticles":172,"formTitle":"[1375]灯泡开关 III","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","submitted":15130,"title":"灯泡开关 III","titleSlug":"bulb-switcher-iii"},{"acceptance":0.5034685165421559,"acs":7548,"articleLive":2,"columnArticles":154,"formTitle":"[1376]通知所有员工所需的时间","frequency":0.0,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","submitted":14992,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.3243785703257681,"acs":4202,"articleLive":2,"columnArticles":130,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.0,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","submitted":12954,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.8614450660635639,"acs":7237,"articleLive":2,"columnArticles":61,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","questionId":"1509","status":"lock","submitted":8401,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.837323264781491,"acs":10423,"articleLive":2,"columnArticles":164,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","questionId":"1498","status":"","submitted":12448,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.7281790083148317,"acs":16727,"articleLive":2,"columnArticles":252,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","submitted":22971,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.7316608251860051,"acs":11899,"articleLive":2,"columnArticles":157,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.0,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"ac","submitted":16263,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.693088181035543,"acs":11271,"articleLive":2,"columnArticles":176,"formTitle":"[1382]将二叉搜索树变平衡","frequency":0.0,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","submitted":16262,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.323185341789993,"acs":4586,"articleLive":2,"columnArticles":87,"formTitle":"[1383]最大的团队表现值","frequency":0.0,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","submitted":14190,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5440329218106996,"acs":1983,"articleLive":2,"columnArticles":45,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"lock","submitted":3645,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.7008104226508002,"acs":13663,"articleLive":2,"columnArticles":204,"formTitle":"[1385]两个数组间的距离值","frequency":0.0,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","submitted":19496,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.31255878421860306,"acs":6314,"articleLive":2,"columnArticles":131,"formTitle":"[1386]安排电影院座位","frequency":0.0,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","submitted":20201,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6955232311820364,"acs":9850,"articleLive":2,"columnArticles":171,"formTitle":"[1387]将整数按权重排序","frequency":0.0,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","submitted":14162,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5426037784346485,"acs":4222,"articleLive":2,"columnArticles":54,"formTitle":"[1388]3n 块披萨","frequency":0.0,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","submitted":7781,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.831289790143834,"acs":28204,"articleLive":2,"columnArticles":482,"formTitle":"[1389]按既定顺序创建目标数组","frequency":0.0,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","submitted":33928,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.35421767193411974,"acs":6366,"articleLive":2,"columnArticles":116,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","submitted":17972,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.3998325058323862,"acs":6684,"articleLive":2,"columnArticles":203,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":0.0,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","questionId":"1507","status":"","submitted":16717,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.4051001635322976,"acs":7927,"articleLive":2,"columnArticles":145,"formTitle":"[1392]最长快乐前缀","frequency":0.0,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","submitted":19568,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.856097050826187,"acs":4093,"articleLive":2,"columnArticles":62,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"lock","submitted":4781,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.6654407494870505,"acs":17189,"articleLive":2,"columnArticles":277,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","submitted":25831,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7484141546526868,"acs":14276,"articleLive":2,"columnArticles":212,"formTitle":"[1395]统计作战单位数","frequency":0.0,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","submitted":19075,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.41280519172173635,"acs":10432,"articleLive":2,"columnArticles":145,"formTitle":"[1396]设计地铁系统","frequency":0.0,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","submitted":25271,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.3743159430864648,"acs":1026,"articleLive":2,"columnArticles":37,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","submitted":2741,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7619874913134121,"acs":4386,"articleLive":2,"columnArticles":67,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","questionId":"1536","status":"lock","submitted":5756,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6714478449194063,"acs":9456,"articleLive":2,"columnArticles":153,"formTitle":"[1399]统计最大组的数目","frequency":0.0,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","submitted":14083,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.6056695578591073,"acs":5726,"articleLive":2,"columnArticles":98,"formTitle":"[1400]构造 K 个回文字符串","frequency":0.0,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"ac","submitted":9454,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.4174272978136277,"acs":3933,"articleLive":2,"columnArticles":89,"formTitle":"[1401]圆和矩形是否有重叠","frequency":0.0,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","submitted":9422,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7532507981001324,"acs":9674,"articleLive":2,"columnArticles":178,"formTitle":"[1402]做菜顺序","frequency":0.0,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","submitted":12843,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6912608835859401,"acs":21436,"articleLive":2,"columnArticles":363,"formTitle":"[1403]非递增顺序的最小子序列","frequency":0.0,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","submitted":31010,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.4927388013908775,"acs":7227,"articleLive":2,"columnArticles":154,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":0.0,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","questionId":"1520","status":"","submitted":14667,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5083708370837083,"acs":5648,"articleLive":2,"columnArticles":140,"formTitle":"[1405]最长快乐字符串","frequency":0.0,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","submitted":11110,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.5685131195335277,"acs":4875,"articleLive":2,"columnArticles":81,"formTitle":"[1406]石子游戏 III","frequency":0.0,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","submitted":8575,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6667801998183469,"acs":5873,"articleLive":2,"columnArticles":67,"formTitle":"[1407]排名靠前的旅行者","frequency":0.0,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"lock","submitted":8808,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.6146038132687119,"acs":13442,"articleLive":2,"columnArticles":204,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","submitted":21871,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.8068588469184891,"acs":8117,"articleLive":2,"columnArticles":129,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","submitted":10060,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.4751736885716107,"acs":7455,"articleLive":2,"columnArticles":119,"formTitle":"[1410]HTML 实体解析器","frequency":0.0,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"ac","submitted":15689,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5506293310705699,"acs":7787,"articleLive":2,"columnArticles":141,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":0.0,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","questionId":"1527","status":"","submitted":14142,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5526519550909795,"acs":2855,"articleLive":2,"columnArticles":67,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","questionId":"1546","status":"lock","submitted":5166,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.693799923925447,"acs":10944,"articleLive":2,"columnArticles":225,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":0.0,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","questionId":"1514","status":"","submitted":15774,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.6040192010414124,"acs":7424,"articleLive":2,"columnArticles":149,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":0.0,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","questionId":"1515","status":"","submitted":12291,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.6845207320856168,"acs":6620,"articleLive":2,"columnArticles":181,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":0.0,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","questionId":"1516","status":"","submitted":9671,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.4085710149124077,"acs":2822,"articleLive":2,"columnArticles":51,"formTitle":"[1416]恢复数组","frequency":0.0,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","submitted":6907,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.5192639217415708,"acs":12952,"articleLive":2,"columnArticles":183,"formTitle":"[1417]重新格式化字符串","frequency":0.0,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","submitted":24943,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7327230604057184,"acs":25934,"articleLive":2,"columnArticles":416,"formTitle":"[1418]点菜展示表","frequency":0.0,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","questionId":"1533","status":"ac","submitted":35394,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.41895248665503937,"acs":7927,"articleLive":2,"columnArticles":154,"formTitle":"[1419]数青蛙","frequency":0.0,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","submitted":18921,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.5993159052040068,"acs":2453,"articleLive":2,"columnArticles":43,"formTitle":"[1420]生成数组","frequency":0.0,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","questionId":"1535","status":"","submitted":4093,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.7487193313561606,"acs":2777,"articleLive":2,"columnArticles":35,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","questionId":"1551","status":"lock","submitted":3709,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.5406647266043805,"acs":10590,"articleLive":2,"columnArticles":195,"formTitle":"[1422]分割字符串的最大得分","frequency":0.0,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","submitted":19587,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5541567283238821,"acs":35082,"articleLive":2,"columnArticles":511,"formTitle":"[1423]可获得的最大点数","frequency":0.0,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"ac","submitted":63307,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.39829009433962265,"acs":6755,"articleLive":2,"columnArticles":147,"formTitle":"[1424]对角线遍历 II","frequency":0.0,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","submitted":16960,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.44000545404963187,"acs":3227,"articleLive":2,"columnArticles":69,"formTitle":"[1425]带限制的子序列和","frequency":0.0,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","submitted":7334,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.7094918504314478,"acs":1480,"articleLive":2,"columnArticles":48,"formTitle":"[1426]数元素","frequency":0.0,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"lock","submitted":2086,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6564132327336042,"acs":1131,"articleLive":2,"columnArticles":45,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"lock","submitted":1723,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5959866220735786,"acs":891,"articleLive":2,"columnArticles":20,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","questionId":"1374","status":"lock","submitted":1495,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.5051063829787235,"acs":1187,"articleLive":2,"columnArticles":38,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"lock","submitted":2350,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.5833333333333334,"acs":707,"articleLive":2,"columnArticles":27,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","questionId":"1432","status":"lock","submitted":1212,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.8462581519984503,"acs":78636,"articleLive":2,"columnArticles":1033,"formTitle":"[1431]拥有最多糖果的孩子","frequency":0.0,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","submitted":92922,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.3941028094285466,"acs":4531,"articleLive":2,"columnArticles":99,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","questionId":"1529","status":"","submitted":11497,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6410828025477707,"acs":6039,"articleLive":2,"columnArticles":102,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","questionId":"1530","status":"","submitted":9420,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.46613255644573925,"acs":2560,"articleLive":2,"columnArticles":46,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","questionId":"1531","status":"","submitted":5492,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6189483092507075,"acs":4155,"articleLive":2,"columnArticles":46,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"lock","submitted":6713,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.8216073781291172,"acs":43652,"articleLive":2,"columnArticles":648,"formTitle":"[1436]旅行终点站","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"ac","submitted":53130,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5862876254180602,"acs":10518,"articleLive":2,"columnArticles":177,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":0.0,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","questionId":"1548","status":"","submitted":17940,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.48322491045976174,"acs":33055,"articleLive":2,"columnArticles":466,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":0.0,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","questionId":"1549","status":"","submitted":68405,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.5627633955448526,"acs":3739,"articleLive":2,"columnArticles":57,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":0.0,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","questionId":"1550","status":"","submitted":6644,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.6991912340203496,"acs":2680,"articleLive":2,"columnArticles":37,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"lock","submitted":3833,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.6479298447383554,"acs":18028,"articleLive":2,"columnArticles":378,"formTitle":"[1441]用栈操作构建数组","frequency":0.0,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"ac","submitted":27824,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7915602189781021,"acs":34702,"articleLive":2,"columnArticles":373,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":0.0,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","questionId":"1553","status":"ac","submitted":43840,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.4105079572705472,"acs":5649,"articleLive":2,"columnArticles":141,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","questionId":"1554","status":"","submitted":13761,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5268623926502896,"acs":2638,"articleLive":2,"columnArticles":60,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","submitted":5007,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8573879476731717,"acs":3998,"articleLive":2,"columnArticles":53,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"lock","submitted":4663,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.5729138657345164,"acs":12784,"articleLive":2,"columnArticles":218,"formTitle":"[1446]连续字符","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","submitted":22314,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.6176869329439983,"acs":5923,"articleLive":2,"columnArticles":74,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","submitted":9589,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7115036559762542,"acs":9828,"articleLive":2,"columnArticles":159,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":0.0,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","submitted":13813,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.627605355241138,"acs":16501,"articleLive":2,"columnArticles":208,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":0.0,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","questionId":"1545","status":"ac","submitted":26292,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.8026530137305097,"acs":24143,"articleLive":2,"columnArticles":343,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":0.0,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","questionId":"1560","status":"","submitted":30079,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.5234013817464028,"acs":10076,"articleLive":2,"columnArticles":153,"formTitle":"[1451]重新排列句子中的单词","frequency":0.0,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","submitted":19251,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.49895458727105463,"acs":5966,"articleLive":2,"columnArticles":90,"formTitle":"[1452]收藏清单","frequency":0.0,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","questionId":"1562","status":"","submitted":11957,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.3647111309391033,"acs":1635,"articleLive":2,"columnArticles":31,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":0.0,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","questionId":"1563","status":"","submitted":4483,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.3965503662282429,"acs":5035,"articleLive":2,"columnArticles":81,"formTitle":"[1454]活跃用户","frequency":0.0,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"lock","submitted":12697,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6330405512018092,"acs":12036,"articleLive":2,"columnArticles":206,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","questionId":"1566","status":"","submitted":19013,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.5232212485040343,"acs":13553,"articleLive":2,"columnArticles":211,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.0,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","questionId":"1567","status":"","submitted":25903,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.6322248614410134,"acs":7985,"articleLive":2,"columnArticles":140,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","submitted":12630,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.4423485027116246,"acs":5628,"articleLive":2,"columnArticles":90,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","submitted":12723,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.596875,"acs":2292,"articleLive":2,"columnArticles":48,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"lock","submitted":3840,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7447838505107227,"acs":15385,"articleLive":2,"columnArticles":312,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","questionId":"1556","status":"ac","submitted":20657,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.5015671325709445,"acs":5921,"articleLive":2,"columnArticles":84,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","questionId":"1557","status":"","submitted":11805,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.4271890971039182,"acs":6269,"articleLive":2,"columnArticles":125,"formTitle":"[1462]课程表 IV","frequency":0.0,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","submitted":14675,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.591747146619842,"acs":2696,"articleLive":2,"columnArticles":65,"formTitle":"[1463]摘樱桃 II","frequency":0.0,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","submitted":4556,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7676706654008802,"acs":26685,"articleLive":2,"columnArticles":372,"formTitle":"[1464]数组中两元素的最大乘积","frequency":0.0,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","questionId":"1574","status":"","submitted":34761,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.3098891524275134,"acs":6402,"articleLive":2,"columnArticles":81,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.0,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","questionId":"1575","status":"","submitted":20659,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.48321741759903236,"acs":6392,"articleLive":2,"columnArticles":124,"formTitle":"[1466]重新规划路线","frequency":0.0,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","questionId":"1576","status":"","submitted":13228,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6186755952380952,"acs":1663,"articleLive":2,"columnArticles":49,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","questionId":"1577","status":"","submitted":2688,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.700750469043152,"acs":2988,"articleLive":2,"columnArticles":51,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"lock","submitted":4264,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.7956989247311828,"acs":2220,"articleLive":2,"columnArticles":83,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"lock","submitted":2790,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8428400917171844,"acs":53667,"articleLive":2,"columnArticles":730,"formTitle":"[1470]重新排列数组","frequency":0.0,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","submitted":63674,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.5447399353511607,"acs":7415,"articleLive":2,"columnArticles":106,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.0,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","submitted":13612,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6181653180065039,"acs":8174,"articleLive":2,"columnArticles":131,"formTitle":"[1472]设计浏览器历史记录","frequency":0.0,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","submitted":13223,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.6743368210827942,"acs":15532,"articleLive":2,"columnArticles":166,"formTitle":"[1473]粉刷房子 III","frequency":0.0,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","submitted":23033,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7175908923980904,"acs":1954,"articleLive":2,"columnArticles":63,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","questionId":"1618","status":"lock","submitted":2723,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7215830429178403,"acs":15115,"articleLive":2,"columnArticles":233,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","questionId":"1570","status":"","submitted":20947,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8652690521715378,"acs":12671,"articleLive":2,"columnArticles":118,"formTitle":"[1476]子矩形查询","frequency":0.0,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","submitted":14644,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.2914265553334117,"acs":4956,"articleLive":2,"columnArticles":97,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":0.0,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","questionId":"1573","status":"","submitted":17006,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5807433166702891,"acs":2672,"articleLive":2,"columnArticles":57,"formTitle":"[1478]安排邮筒","frequency":0.0,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","submitted":4601,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.567451205510907,"acs":1977,"articleLive":2,"columnArticles":39,"formTitle":"[1479]周内每天的销售情况","frequency":0.0,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"lock","submitted":3484,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8692430714415855,"acs":128814,"articleLive":2,"columnArticles":1290,"formTitle":"[1480]一维数组的动态和","frequency":0.0,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"ac","submitted":148191,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.514454664914586,"acs":10179,"articleLive":2,"columnArticles":147,"formTitle":"[1481]不同整数的最少数目","frequency":0.0,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","questionId":"1604","status":"","submitted":19786,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5866187645775337,"acs":31187,"articleLive":2,"columnArticles":405,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":0.0,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","questionId":"1605","status":"ac","submitted":53164,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.30039208697201925,"acs":3371,"articleLive":2,"columnArticles":70,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","submitted":11222,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8093306288032455,"acs":798,"articleLive":2,"columnArticles":25,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"lock","submitted":986,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.6596187175043328,"acs":3806,"articleLive":2,"columnArticles":44,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"lock","submitted":5770,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.8582584974893781,"acs":71105,"articleLive":2,"columnArticles":685,"formTitle":"[1486]数组异或操作","frequency":0.0,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"ac","submitted":82848,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.31103880453121235,"acs":7743,"articleLive":2,"columnArticles":107,"formTitle":"[1487]保证文件名唯一","frequency":0.0,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","submitted":24894,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.23692048692048692,"acs":7318,"articleLive":2,"columnArticles":113,"formTitle":"[1488]避免洪水泛滥","frequency":0.0,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","submitted":30888,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.691019968910678,"acs":11558,"articleLive":2,"columnArticles":125,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.0,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","questionId":"1613","status":"","submitted":16726,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8550106609808102,"acs":1203,"articleLive":2,"columnArticles":29,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"lock","submitted":1407,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.6715645069096533,"acs":19973,"articleLive":2,"columnArticles":297,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","questionId":"1584","status":"","submitted":29741,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.6620763746459615,"acs":6779,"articleLive":2,"columnArticles":80,"formTitle":"[1492]n 的第 k 个因子","frequency":0.0,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","submitted":10239,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.5671630948056665,"acs":7807,"articleLive":2,"columnArticles":148,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":0.0,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","questionId":"1586","status":"","submitted":13765,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.3714987714987715,"acs":2268,"articleLive":2,"columnArticles":36,"formTitle":"[1494]并行课程 II","frequency":0.0,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","submitted":6105,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5421883505715841,"acs":3984,"articleLive":2,"columnArticles":38,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"lock","submitted":7348,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5367697259338731,"acs":11007,"articleLive":2,"columnArticles":166,"formTitle":"[1496]判断路径是否相交","frequency":0.0,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","submitted":20506,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.39132054386291676,"acs":8404,"articleLive":2,"columnArticles":114,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":0.0,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","questionId":"1620","status":"","submitted":21476,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.3343331206126356,"acs":5239,"articleLive":2,"columnArticles":67,"formTitle":"[1498]满足条件的子序列数目","frequency":0.0,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","questionId":"1621","status":"","submitted":15670,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.3743801652892562,"acs":2718,"articleLive":2,"columnArticles":59,"formTitle":"[1499]满足不等式的最大值","frequency":0.0,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","submitted":7260,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.30162412993039445,"acs":780,"articleLive":2,"columnArticles":27,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"lock","submitted":2586,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.5905129304186313,"acs":4133,"articleLive":2,"columnArticles":61,"formTitle":"[1501]可以放心投资的国家","frequency":0.0,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"lock","submitted":6999,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7166197975253094,"acs":25483,"articleLive":2,"columnArticles":304,"formTitle":"[1502]判断能否形成等差数列","frequency":0.0,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","submitted":35560,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5130689634547521,"acs":8578,"articleLive":2,"columnArticles":87,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":0.0,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","questionId":"1627","status":"","submitted":16719,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.5950063816209317,"acs":7459,"articleLive":2,"columnArticles":135,"formTitle":"[1504]统计全 1 子矩形","frequency":0.0,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","submitted":12536,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.3625782365213572,"acs":3302,"articleLive":2,"columnArticles":74,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":0.0,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","questionId":"1629","status":"","submitted":9107,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.84,"acs":588,"articleLive":2,"columnArticles":16,"formTitle":"[1506]找到 N 叉树的根节点","frequency":0.0,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"lock","submitted":700,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5898506018266497,"acs":9752,"articleLive":2,"columnArticles":130,"formTitle":"[1507]转变日期格式","frequency":0.0,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","submitted":16533,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.5525482031320721,"acs":6104,"articleLive":2,"columnArticles":53,"formTitle":"[1508]子数组和排序后的区间和","frequency":0.0,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","submitted":11047,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5478343145500421,"acs":5211,"articleLive":2,"columnArticles":78,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.0,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","questionId":"1616","status":"","submitted":9512,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.5771059782608695,"acs":5097,"articleLive":2,"columnArticles":62,"formTitle":"[1510]石子游戏 IV","frequency":0.0,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","submitted":8832,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6781275221953188,"acs":4201,"articleLive":2,"columnArticles":60,"formTitle":"[1511]消费者下单频率","frequency":0.0,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"lock","submitted":6195,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.8488826694750206,"acs":58842,"articleLive":2,"columnArticles":749,"formTitle":"[1512]好数对的数目","frequency":0.0,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","submitted":69317,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.38000205388012187,"acs":11101,"articleLive":2,"columnArticles":150,"formTitle":"[1513]仅含 1 的子串数","frequency":0.0,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","submitted":29213,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.3249622895348363,"acs":7971,"articleLive":2,"columnArticles":140,"formTitle":"[1514]概率最大的路径","frequency":0.0,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","submitted":24529,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.34291938997821353,"acs":3148,"articleLive":2,"columnArticles":59,"formTitle":"[1515]服务中心的最佳位置","frequency":0.0,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","submitted":9180,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5849514563106796,"acs":241,"articleLive":2,"columnArticles":13,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","questionId":"1655","status":"lock","submitted":412,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.733078718438362,"acs":3455,"articleLive":2,"columnArticles":36,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"lock","submitted":4713,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.6742761542405353,"acs":24988,"articleLive":2,"columnArticles":400,"formTitle":"[1518]换酒问题","frequency":0.0,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","submitted":37059,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.29776915615906885,"acs":5526,"articleLive":2,"columnArticles":124,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.0,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","questionId":"1643","status":"","submitted":18558,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.33306857294148795,"acs":2516,"articleLive":2,"columnArticles":71,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","submitted":7554,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.39661625991914956,"acs":2649,"articleLive":2,"columnArticles":51,"formTitle":"[1521]找到最接近目标值的函数值","frequency":0.0,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","questionId":"1645","status":"","submitted":6679,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.7117202268431002,"acs":753,"articleLive":2,"columnArticles":28,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"lock","submitted":1058,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5777867110779303,"acs":10061,"articleLive":2,"columnArticles":173,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","submitted":17413,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.42958579881656805,"acs":5082,"articleLive":2,"columnArticles":101,"formTitle":"[1524]和为奇数的子数组数目","frequency":0.0,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","submitted":11830,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6615515771526002,"acs":5432,"articleLive":2,"columnArticles":110,"formTitle":"[1525]字符串的好分割数目","frequency":0.0,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","questionId":"1632","status":"","submitted":8211,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.6169511249030256,"acs":3181,"articleLive":2,"columnArticles":51,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","questionId":"1633","status":"","submitted":5156,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.5015978880088926,"acs":3610,"articleLive":2,"columnArticles":37,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"lock","submitted":7197,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.7852134784428632,"acs":30014,"articleLive":2,"columnArticles":361,"formTitle":"[1528]重新排列字符串","frequency":0.0,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","submitted":38224,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.691020376539862,"acs":8919,"articleLive":2,"columnArticles":134,"formTitle":"[1529]灯泡开关 IV","frequency":0.0,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","submitted":12907,"title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.5676801875122078,"acs":8719,"articleLive":2,"columnArticles":147,"formTitle":"[1530]好叶子节点对的数量","frequency":0.0,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","submitted":15359,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.3295272078501338,"acs":1847,"articleLive":2,"columnArticles":34,"formTitle":"[1531]压缩字符串 II","frequency":0.0,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","submitted":5605,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6145620022753129,"acs":2701,"articleLive":2,"columnArticles":49,"formTitle":"[1532]最近的三笔订单","frequency":0.0,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"lock","submitted":4395,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6197478991596639,"acs":295,"articleLive":2,"columnArticles":18,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","questionId":"1672","status":"lock","submitted":476,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.7888614088119447,"acs":17224,"articleLive":2,"columnArticles":161,"formTitle":"[1534]统计好三元组","frequency":0.0,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","submitted":21834,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.45336344350920416,"acs":13250,"articleLive":2,"columnArticles":182,"formTitle":"[1535]找出数组游戏的赢家","frequency":0.0,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","submitted":29226,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.4403168825607537,"acs":4113,"articleLive":2,"columnArticles":79,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.0,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","submitted":9341,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.3670387393302692,"acs":4472,"articleLive":2,"columnArticles":89,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","submitted":12184,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.6009389671361502,"acs":128,"articleLive":2,"columnArticles":7,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","questionId":"1681","status":"lock","submitted":213,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5392489242404486,"acs":16542,"articleLive":2,"columnArticles":248,"formTitle":"[1539]第 k 个缺失的正整数","frequency":0.0,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","submitted":30676,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.3175234864300626,"acs":4867,"articleLive":2,"columnArticles":86,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","submitted":15328,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.461372730070791,"acs":5996,"articleLive":2,"columnArticles":92,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"ac","submitted":12996,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.385771235817234,"acs":2516,"articleLive":2,"columnArticles":47,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","submitted":6522,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5516793468175913,"acs":2973,"articleLive":2,"columnArticles":43,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"lock","submitted":5389,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.5467932837875035,"acs":19865,"articleLive":2,"columnArticles":320,"formTitle":"[1544]整理字符串","frequency":0.0,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"ac","submitted":36330,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5541537553489745,"acs":7511,"articleLive":2,"columnArticles":101,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":0.0,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","submitted":13554,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.41432573029211683,"acs":5177,"articleLive":2,"columnArticles":79,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","questionId":"1649","status":"","submitted":12495,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5369100975481149,"acs":4073,"articleLive":2,"columnArticles":71,"formTitle":"[1547]切棍子的最小成本","frequency":0.0,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","submitted":7586,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7131474103585658,"acs":358,"articleLive":2,"columnArticles":14,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","questionId":"1687","status":"lock","submitted":502,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.6637120601665324,"acs":2471,"articleLive":2,"columnArticles":48,"formTitle":"[1549]每件商品的最新订单","frequency":0.0,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","questionId":"1688","status":"lock","submitted":3723,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6593494929507792,"acs":21326,"articleLive":2,"columnArticles":290,"formTitle":"[1550]存在连续三个奇数的数组","frequency":0.0,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","submitted":32344,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8166412102698378,"acs":11228,"articleLive":2,"columnArticles":153,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":0.0,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","submitted":13749,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.5103359893018332,"acs":9159,"articleLive":2,"columnArticles":124,"formTitle":"[1552]两球之间的磁力","frequency":0.0,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","submitted":17947,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.29572414845329364,"acs":7753,"articleLive":2,"columnArticles":122,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":0.0,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","questionId":"1676","status":"","submitted":26217,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.7068062827225131,"acs":540,"articleLive":2,"columnArticles":18,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"lock","submitted":764,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.43778735632183907,"acs":3047,"articleLive":2,"columnArticles":58,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"lock","submitted":6960,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.5786742905548496,"acs":10930,"articleLive":2,"columnArticles":168,"formTitle":"[1556]千位分隔数","frequency":0.0,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","submitted":18888,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7688510308779402,"acs":7943,"articleLive":2,"columnArticles":109,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":0.0,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","questionId":"1661","status":"","submitted":10331,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6220002774309891,"acs":4484,"articleLive":2,"columnArticles":69,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":0.0,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","questionId":"1662","status":"","submitted":7209,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.36721926806380983,"acs":3522,"articleLive":2,"columnArticles":64,"formTitle":"[1559]二维网格图中探测环","frequency":0.0,"frontendQuestionId":"1559","leaf":true,"level":2,"nodeType":"def","questionId":"1663","status":"","submitted":9591,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5723983391550781,"acs":8685,"articleLive":2,"columnArticles":91,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":0.0,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","submitted":15173,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7793255131964809,"acs":11693,"articleLive":2,"columnArticles":168,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":0.0,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","submitted":15004,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.3094147582697201,"acs":4256,"articleLive":2,"columnArticles":87,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":0.0,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","submitted":13755,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.3791036254638881,"acs":3984,"articleLive":2,"columnArticles":66,"formTitle":"[1563]石子游戏 V","frequency":0.0,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","submitted":10509,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5456039441248973,"acs":664,"articleLive":2,"columnArticles":24,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"lock","submitted":1217,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.72348401323043,"acs":3281,"articleLive":2,"columnArticles":41,"formTitle":"[1565]按月统计订单数与顾客数","frequency":0.0,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"lock","submitted":4535,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.44593683264021583,"acs":7935,"articleLive":2,"columnArticles":120,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":0.0,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","questionId":"1689","status":"","submitted":17794,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.4000061186404381,"acs":13075,"articleLive":2,"columnArticles":209,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":0.0,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","submitted":32687,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.45563591462339037,"acs":2583,"articleLive":2,"columnArticles":47,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","submitted":5669,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.4748795595320027,"acs":2070,"articleLive":2,"columnArticles":45,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","questionId":"1692","status":"","submitted":4359,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.8943475964078182,"acs":1693,"articleLive":2,"columnArticles":37,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.0,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"lock","submitted":1893,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.7577296819787986,"acs":3431,"articleLive":2,"columnArticles":43,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"lock","submitted":4528,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.8049026615649834,"acs":19143,"articleLive":2,"columnArticles":322,"formTitle":"[1572]矩阵对角线元素的和","frequency":0.0,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","submitted":23783,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.29500626690414933,"acs":4472,"articleLive":2,"columnArticles":65,"formTitle":"[1573]分割字符串的方案数","frequency":0.0,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","submitted":15159,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.3268418902355985,"acs":4800,"articleLive":2,"columnArticles":84,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":0.0,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","questionId":"1679","status":"","submitted":14686,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.596611593391207,"acs":4261,"articleLive":2,"columnArticles":68,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","submitted":7142,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.47636046327145803,"acs":18015,"articleLive":2,"columnArticles":255,"formTitle":"[1576]替换所有的问号","frequency":0.0,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","questionId":"1698","status":"","submitted":37818,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.32548845470692717,"acs":5131,"articleLive":2,"columnArticles":79,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":0.0,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","questionId":"1699","status":"","submitted":15764,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5824797268459241,"acs":10918,"articleLive":2,"columnArticles":204,"formTitle":"[1578]避免重复字母的最小删除成本","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","submitted":18744,"title":"避免重复字母的最小删除成本","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"acceptance":0.6191262919276136,"acs":16114,"articleLive":2,"columnArticles":294,"formTitle":"[1579]保证图可完全遍历","frequency":0.0,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","questionId":"1701","status":"","submitted":26027,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.636568848758465,"acs":282,"articleLive":2,"columnArticles":18,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"lock","submitted":443,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.804626660558864,"acs":3513,"articleLive":2,"columnArticles":48,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","questionId":"1724","status":"lock","submitted":4366,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6709083239595051,"acs":9543,"articleLive":2,"columnArticles":109,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":0.0,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","submitted":14224,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6853883121170989,"acs":18683,"articleLive":2,"columnArticles":243,"formTitle":"[1583]统计不开心的朋友","frequency":0.0,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","submitted":27259,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6636896455484231,"acs":26158,"articleLive":2,"columnArticles":328,"formTitle":"[1584]连接所有点的最小费用","frequency":0.0,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","submitted":39413,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.4299891735835438,"acs":2383,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","questionId":"1707","status":"","submitted":5542,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6258064516129033,"acs":388,"articleLive":2,"columnArticles":24,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"lock","submitted":620,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.8246277475774049,"acs":3489,"articleLive":2,"columnArticles":41,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"lock","submitted":4231,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8389156833215776,"acs":44007,"articleLive":2,"columnArticles":700,"formTitle":"[1588]所有奇数长度子数组的和","frequency":0.0,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"ac","submitted":52457,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.29411764705882354,"acs":3870,"articleLive":2,"columnArticles":56,"formTitle":"[1589]所有排列中的最大和","frequency":0.0,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","submitted":13158,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.26872149477710755,"acs":3653,"articleLive":2,"columnArticles":57,"formTitle":"[1590]使数组和能被 P 整除","frequency":0.0,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","submitted":13594,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5768041237113402,"acs":1119,"articleLive":2,"columnArticles":33,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","submitted":1940,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.4453680348543912,"acs":7769,"articleLive":2,"columnArticles":126,"formTitle":"[1592]重新排列单词间的空格","frequency":0.0,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","submitted":17444,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.5318813442396767,"acs":5397,"articleLive":2,"columnArticles":89,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":0.0,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","questionId":"1715","status":"","submitted":10147,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.31354221191953935,"acs":4193,"articleLive":2,"columnArticles":100,"formTitle":"[1594]矩阵的最大非负积","frequency":0.0,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","submitted":13373,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.4649791103465225,"acs":1892,"articleLive":2,"columnArticles":39,"formTitle":"[1595]连通两组点的最小成本","frequency":0.0,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","questionId":"1717","status":"","submitted":4069,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7469549330085262,"acs":2453,"articleLive":2,"columnArticles":43,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","questionId":"1735","status":"lock","submitted":3284,"title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.6628959276018099,"acs":293,"articleLive":2,"columnArticles":20,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","questionId":"1736","status":"lock","submitted":442,"title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6719458381188418,"acs":11116,"articleLive":2,"columnArticles":150,"formTitle":"[1598]文件夹操作日志搜集器","frequency":0.0,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"ac","submitted":16543,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.41940379403794037,"acs":3869,"articleLive":2,"columnArticles":69,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","submitted":9225,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.6787421181573557,"acs":16900,"articleLive":2,"columnArticles":207,"formTitle":"[1600]皇位继承顺序","frequency":0.0,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","submitted":24899,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.49000224668613795,"acs":2181,"articleLive":2,"columnArticles":40,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","submitted":4451,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7836322869955157,"acs":699,"articleLive":2,"columnArticles":29,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","questionId":"1745","status":"lock","submitted":892,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8444309837930474,"acs":57157,"articleLive":2,"columnArticles":457,"formTitle":"[1603]设计停车系统","frequency":0.0,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"ac","submitted":67687,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.4155216005276465,"acs":3780,"articleLive":2,"columnArticles":63,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":0.0,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","questionId":"1709","status":"","submitted":9097,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7362896315338475,"acs":3437,"articleLive":2,"columnArticles":69,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","questionId":"1711","status":"ac","submitted":4668,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.340563086548488,"acs":1633,"articleLive":2,"columnArticles":34,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","questionId":"1710","status":"","submitted":4795,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5448015122873346,"acs":2882,"articleLive":2,"columnArticles":37,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"lock","submitted":5290,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6401216198732048,"acs":9895,"articleLive":2,"columnArticles":162,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","questionId":"1730","status":"","submitted":15458,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.5116739776425641,"acs":7232,"articleLive":2,"columnArticles":126,"formTitle":"[1609]奇偶树","frequency":0.0,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"","submitted":14134,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.2705949656750572,"acs":2365,"articleLive":2,"columnArticles":39,"formTitle":"[1610]可见点的最大数目","frequency":0.0,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","submitted":8740,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6102385107620709,"acs":2098,"articleLive":2,"columnArticles":57,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","questionId":"1732","status":"","submitted":3438,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.7364085667215815,"acs":447,"articleLive":2,"columnArticles":21,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","questionId":"1750","status":"lock","submitted":607,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.7213463996591394,"acs":1693,"articleLive":2,"columnArticles":36,"formTitle":"[1613]找到遗失的ID","frequency":0.0,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"lock","submitted":2347,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.8216114385083567,"acs":17009,"articleLive":2,"columnArticles":288,"formTitle":"[1614]括号的最大嵌套深度","frequency":0.0,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","submitted":20702,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.4966200574127234,"acs":5363,"articleLive":2,"columnArticles":64,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","submitted":10799,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.27560735390676294,"acs":5037,"articleLive":2,"columnArticles":93,"formTitle":"[1616]分割两个字符串得到回文串","frequency":0.0,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","submitted":18276,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6216121084125308,"acs":1766,"articleLive":2,"columnArticles":33,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","submitted":2841,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5933456561922366,"acs":321,"articleLive":2,"columnArticles":17,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","questionId":"1384","status":"lock","submitted":541,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6744291822068589,"acs":7414,"articleLive":2,"columnArticles":128,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","submitted":10993,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.3714627938314119,"acs":2481,"articleLive":2,"columnArticles":44,"formTitle":"[1620]网络信号最好的坐标","frequency":0.0,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","submitted":6679,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.441503833786792,"acs":1785,"articleLive":2,"columnArticles":35,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","questionId":"1725","status":"","submitted":4043,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.15,"acs":2499,"articleLive":2,"columnArticles":55,"formTitle":"[1622]奇妙序列","frequency":0.0,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","submitted":16660,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.782312925170068,"acs":3450,"articleLive":2,"columnArticles":45,"formTitle":"[1623]三人国家代表队","frequency":0.0,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","questionId":"1763","status":"lock","submitted":4410,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6256983240223464,"acs":11536,"articleLive":2,"columnArticles":199,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":0.0,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","submitted":18437,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.543205317577548,"acs":2942,"articleLive":2,"columnArticles":66,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","submitted":5416,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.3866287618860896,"acs":3944,"articleLive":2,"columnArticles":85,"formTitle":"[1626]无矛盾的最佳球队","frequency":0.0,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","submitted":10201,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.3815073815073815,"acs":2455,"articleLive":2,"columnArticles":38,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","submitted":6435,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8394308943089431,"acs":413,"articleLive":2,"columnArticles":18,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","questionId":"1768","status":"lock","submitted":492,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.5246905863232905,"acs":8394,"articleLive":2,"columnArticles":99,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","submitted":15998,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.7683569141794898,"acs":7440,"articleLive":2,"columnArticles":116,"formTitle":"[1630]等差子数组","frequency":0.0,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","submitted":9683,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.49355293935703376,"acs":25531,"articleLive":2,"columnArticles":301,"formTitle":"[1631]最小体力消耗路径","frequency":0.0,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"ac","submitted":51729,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.31934227607096494,"acs":1476,"articleLive":2,"columnArticles":27,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","submitted":4622,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6573829531812725,"acs":2738,"articleLive":2,"columnArticles":26,"formTitle":"[1633]各赛事的用户注册率","frequency":0.0,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"lock","submitted":4165,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5261904761904762,"acs":442,"articleLive":2,"columnArticles":24,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","questionId":"1774","status":"lock","submitted":840,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5454965357967667,"acs":1181,"articleLive":2,"columnArticles":31,"formTitle":"[1635]Hopper 公司查询 I","frequency":0.0,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"lock","submitted":2165,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7055143651529193,"acs":9135,"articleLive":2,"columnArticles":179,"formTitle":"[1636]按照频率将数组升序排序","frequency":0.0,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","submitted":12948,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8068198888388163,"acs":5371,"articleLive":2,"columnArticles":70,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","questionId":"1742","status":"","submitted":6657,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7119155354449472,"acs":2832,"articleLive":2,"columnArticles":47,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":0.0,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","submitted":3978,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.4020715630885122,"acs":1281,"articleLive":2,"columnArticles":28,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","questionId":"1744","status":"","submitted":3186,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.6592167209891873,"acs":12742,"articleLive":2,"columnArticles":218,"formTitle":"[1640]能否连接形成数组","frequency":0.0,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","submitted":19329,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.7711923688394277,"acs":12127,"articleLive":2,"columnArticles":279,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":0.0,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","submitted":15725,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.4510700186993559,"acs":6513,"articleLive":2,"columnArticles":107,"formTitle":"[1642]可以到达的最远建筑","frequency":0.0,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","submitted":14439,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.4508670520231214,"acs":2262,"articleLive":2,"columnArticles":48,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","submitted":5017,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.5470167064439141,"acs":1146,"articleLive":2,"columnArticles":25,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":0.0,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","questionId":"1780","status":"lock","submitted":2095,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.40828701364325415,"acs":808,"articleLive":2,"columnArticles":24,"formTitle":"[1645]Hopper Company Queries II","frequency":0.0,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1785","status":"lock","submitted":1979,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5365047295435761,"acs":35052,"articleLive":2,"columnArticles":357,"formTitle":"[1646]获取生成数组中的最大值","frequency":0.0,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"ac","submitted":65334,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5154899894625922,"acs":7338,"articleLive":2,"columnArticles":107,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":0.0,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","submitted":14235,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.2777910400254635,"acs":3491,"articleLive":2,"columnArticles":90,"formTitle":"[1648]销售价值减少的颜色球","frequency":0.0,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","submitted":12567,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.4739776951672863,"acs":2550,"articleLive":2,"columnArticles":65,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","submitted":5380,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.793939393939394,"acs":1310,"articleLive":2,"columnArticles":30,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":0.0,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","questionId":"1790","status":"lock","submitted":1650,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.6842105263157895,"acs":767,"articleLive":2,"columnArticles":23,"formTitle":"[1651]Hopper Company Queries III","frequency":0.0,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1795","status":"lock","submitted":1121,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6564778463264161,"acs":7023,"articleLive":2,"columnArticles":177,"formTitle":"[1652]拆炸弹","frequency":0.0,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","submitted":10698,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.5054495912806539,"acs":3710,"articleLive":2,"columnArticles":86,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":0.0,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","submitted":7340,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.27362250879249705,"acs":3501,"articleLive":2,"columnArticles":48,"formTitle":"[1654]到家的最少跳跃次数","frequency":0.0,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","submitted":12795,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.3837429111531191,"acs":2030,"articleLive":2,"columnArticles":33,"formTitle":"[1655]分配重复整数","frequency":0.0,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","submitted":5290,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.7815966719492868,"acs":7891,"articleLive":2,"columnArticles":93,"formTitle":"[1656]设计有序流","frequency":0.0,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","submitted":10096,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.46484342027517517,"acs":5507,"articleLive":2,"columnArticles":76,"formTitle":"[1657]确定两个字符串是否接近","frequency":0.0,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","submitted":11847,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.29997319573812237,"acs":8953,"articleLive":2,"columnArticles":151,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":0.0,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","submitted":29846,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.4128834355828221,"acs":1346,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":0.0,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","submitted":3260,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7381818181818182,"acs":406,"articleLive":2,"columnArticles":24,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"lock","submitted":550,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.7256267409470752,"acs":2605,"articleLive":2,"columnArticles":54,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":0.0,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"lock","submitted":3590,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8123974689477385,"acs":20799,"articleLive":2,"columnArticles":286,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":0.0,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","submitted":25602,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.57221355907032,"acs":7706,"articleLive":2,"columnArticles":132,"formTitle":"[1663]具有给定数值的最小字符串","frequency":0.0,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","submitted":13467,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.545509403600523,"acs":5424,"articleLive":2,"columnArticles":107,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","submitted":9943,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.662547770700637,"acs":5201,"articleLive":2,"columnArticles":82,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":0.0,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","submitted":7850,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.6985915492957746,"acs":248,"articleLive":2,"columnArticles":13,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","questionId":"1810","status":"lock","submitted":355,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.602896966384258,"acs":2206,"articleLive":2,"columnArticles":32,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"lock","submitted":3659,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.44413677635391846,"acs":6897,"articleLive":2,"columnArticles":130,"formTitle":"[1668]最大重复子字符串","frequency":0.0,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","submitted":15529,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.7580108562423393,"acs":12987,"articleLive":2,"columnArticles":237,"formTitle":"[1669]合并两个链表","frequency":0.0,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"ac","submitted":17133,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5266041641300377,"acs":4325,"articleLive":2,"columnArticles":77,"formTitle":"[1670]设计前中后队列","frequency":0.0,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"ac","submitted":8213,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.46830265848670755,"acs":2061,"articleLive":2,"columnArticles":41,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":0.0,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","questionId":"1766","status":"","submitted":4401,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.8508631115997801,"acs":38693,"articleLive":2,"columnArticles":443,"formTitle":"[1672]最富有客户的资产总量","frequency":0.0,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","submitted":45475,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.35527851706588226,"acs":7609,"articleLive":2,"columnArticles":169,"formTitle":"[1673]找出最具竞争力的子序列","frequency":0.0,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"ac","submitted":21417,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.3643847487001733,"acs":2523,"articleLive":2,"columnArticles":53,"formTitle":"[1674]使数组互补的最少操作次数","frequency":0.0,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","submitted":6924,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.43510568031704094,"acs":2635,"articleLive":2,"columnArticles":43,"formTitle":"[1675]数组的最小偏移量","frequency":0.0,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","submitted":6056,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7659380692167578,"acs":841,"articleLive":2,"columnArticles":22,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":0.0,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","questionId":"1816","status":"lock","submitted":1098,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.3889845094664372,"acs":2034,"articleLive":2,"columnArticles":32,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"lock","submitted":5229,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.8299445471349353,"acs":17511,"articleLive":2,"columnArticles":283,"formTitle":"[1678]设计 Goal 解析器","frequency":0.0,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","submitted":21099,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.49785775492716366,"acs":6972,"articleLive":2,"columnArticles":113,"formTitle":"[1679]K 和数对的最大数目","frequency":0.0,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","submitted":14004,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.4648019844324694,"acs":5434,"articleLive":2,"columnArticles":72,"formTitle":"[1680]连接连续二进制数字","frequency":0.0,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","submitted":11691,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.3839458413926499,"acs":2382,"articleLive":2,"columnArticles":49,"formTitle":"[1681]最小不兼容性","frequency":0.0,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","submitted":6204,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5236593059936908,"acs":332,"articleLive":2,"columnArticles":17,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"lock","submitted":634,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8962432915921288,"acs":3507,"articleLive":2,"columnArticles":37,"formTitle":"[1683]无效的推文","frequency":0.0,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"lock","submitted":3913,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.828348062542488,"acs":17059,"articleLive":2,"columnArticles":357,"formTitle":"[1684]统计一致字符串的数目","frequency":0.0,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","submitted":20594,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.6005798035110324,"acs":3729,"articleLive":2,"columnArticles":86,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","questionId":"1787","status":"","submitted":6209,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.47177848775292863,"acs":2658,"articleLive":2,"columnArticles":49,"formTitle":"[1686]石子游戏 VI","frequency":0.0,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","submitted":5634,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.4028416213957376,"acs":964,"articleLive":2,"columnArticles":21,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","submitted":2393,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.8049458294735994,"acs":19986,"articleLive":2,"columnArticles":267,"formTitle":"[1688]比赛中的配对次数","frequency":0.0,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","submitted":24829,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8670034658990777,"acs":14759,"articleLive":2,"columnArticles":196,"formTitle":"[1689]十-二进制数的最少数目","frequency":0.0,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","questionId":"1807","status":"","submitted":17023,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5180366646954465,"acs":4380,"articleLive":2,"columnArticles":106,"formTitle":"[1690]石子游戏 VII","frequency":0.0,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","submitted":8455,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.48856176646111,"acs":2456,"articleLive":2,"columnArticles":63,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","submitted":5027,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.657243816254417,"acs":186,"articleLive":2,"columnArticles":13,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"lock","submitted":283,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.7999301675977654,"acs":2291,"articleLive":2,"columnArticles":33,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"lock","submitted":2864,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6349723217193096,"acs":7800,"articleLive":2,"columnArticles":137,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","submitted":12284,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.4626975376699743,"acs":6295,"articleLive":2,"columnArticles":132,"formTitle":"[1695]删除子数组的最大得分","frequency":0.0,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","submitted":13605,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.39755680739287297,"acs":6281,"articleLive":2,"columnArticles":115,"formTitle":"[1696]跳跃游戏 VI","frequency":0.0,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","submitted":15799,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.5268998793727382,"acs":2184,"articleLive":2,"columnArticles":41,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","submitted":4145,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5215469613259669,"acs":472,"articleLive":2,"columnArticles":17,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.0,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","questionId":"1838","status":"lock","submitted":905,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.7968197879858657,"acs":1804,"articleLive":2,"columnArticles":41,"formTitle":"[1699]两人之间的通话次数","frequency":0.0,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"lock","submitted":2264,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7098662938040724,"acs":8123,"articleLive":2,"columnArticles":182,"formTitle":"[1700]无法吃午餐的学生数量","frequency":0.0,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","submitted":11443,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6098054474708171,"acs":3918,"articleLive":2,"columnArticles":80,"formTitle":"[1701]平均等待时间","frequency":0.0,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","submitted":6425,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.4785829307568438,"acs":2972,"articleLive":2,"columnArticles":67,"formTitle":"[1702]修改后的最大二进制字符串","frequency":0.0,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","submitted":6210,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.38376603998806325,"acs":1286,"articleLive":2,"columnArticles":23,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.0,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","submitted":3351,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.7813259951363113,"acs":12209,"articleLive":2,"columnArticles":186,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","submitted":15626,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.3471618357487923,"acs":5749,"articleLive":2,"columnArticles":121,"formTitle":"[1705]吃苹果的最大数目","frequency":0.0,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"","submitted":16560,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5856465809072444,"acs":4325,"articleLive":2,"columnArticles":111,"formTitle":"[1706]球会落何处","frequency":0.0,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","submitted":7385,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.503013543217755,"acs":14188,"articleLive":2,"columnArticles":151,"formTitle":"[1707]与数组中元素的最大异或值","frequency":0.0,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","submitted":28206,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.7004437869822485,"acs":947,"articleLive":2,"columnArticles":25,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"lock","submitted":1352,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.7028461167390255,"acs":1457,"articleLive":2,"columnArticles":37,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.0,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"lock","submitted":2073,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.6948465892165624,"acs":11663,"articleLive":2,"columnArticles":186,"formTitle":"[1710]卡车上的最大单元数","frequency":0.0,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"ac","submitted":16785,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.35917365026762194,"acs":30130,"articleLive":2,"columnArticles":360,"formTitle":"[1711]大餐计数","frequency":0.0,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"ac","submitted":83887,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.26232676728214827,"acs":6379,"articleLive":2,"columnArticles":104,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.0,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","submitted":24317,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.4960096275652394,"acs":15662,"articleLive":2,"columnArticles":169,"formTitle":"[1713]得到子序列的最少操作次数","frequency":0.0,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"ac","submitted":31576,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.6323907455012854,"acs":246,"articleLive":2,"columnArticles":9,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","questionId":"1809","status":"lock","submitted":389,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.731349538977368,"acs":1745,"articleLive":2,"columnArticles":36,"formTitle":"[1715]苹果和橘子的个数","frequency":0.0,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"lock","submitted":2386,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6734628092513498,"acs":8357,"articleLive":2,"columnArticles":194,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","submitted":12409,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.43297350343473995,"acs":2206,"articleLive":2,"columnArticles":50,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.0,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","submitted":5095,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.48947759346372866,"acs":1977,"articleLive":2,"columnArticles":48,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.0,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","submitted":4039,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.3700234192037471,"acs":632,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","questionId":"1820","status":"","submitted":1708,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.8690409527009371,"acs":46558,"articleLive":2,"columnArticles":489,"formTitle":"[1720]解码异或后的数组","frequency":0.0,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"ac","submitted":53574,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6458234737340275,"acs":10917,"articleLive":2,"columnArticles":168,"formTitle":"[1721]交换链表中的节点","frequency":0.0,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"ac","submitted":16904,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5155097613882863,"acs":4753,"articleLive":2,"columnArticles":113,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","submitted":9220,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5061714981094354,"acs":23293,"articleLive":2,"columnArticles":176,"formTitle":"[1723]完成所有工作的最短时间","frequency":0.0,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"ac","submitted":46018,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5629139072847682,"acs":340,"articleLive":2,"columnArticles":11,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","questionId":"1865","status":"lock","submitted":604,"title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.7877527187796511,"acs":10793,"articleLive":2,"columnArticles":148,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":0.0,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","questionId":"1843","status":"","submitted":13701,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.4806342604626982,"acs":5547,"articleLive":2,"columnArticles":108,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","submitted":11541,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.5756463719766473,"acs":3451,"articleLive":2,"columnArticles":84,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":0.0,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","submitted":5995,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.35822336659156745,"acs":1113,"articleLive":2,"columnArticles":26,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","submitted":3107,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.6210736721873216,"acs":2175,"articleLive":2,"columnArticles":22,"formTitle":"[1729]求关注者的数量","frequency":0.0,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"lock","submitted":3502,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.5385906040268457,"acs":642,"articleLive":2,"columnArticles":23,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"lock","submitted":1192,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.46952767902488574,"acs":1849,"articleLive":2,"columnArticles":28,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","questionId":"1882","status":"lock","submitted":3938,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.7910870855033292,"acs":12000,"articleLive":2,"columnArticles":207,"formTitle":"[1732]找到最高海拔","frequency":0.0,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","submitted":15169,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.45933734939759036,"acs":2135,"articleLive":2,"columnArticles":54,"formTitle":"[1733]需要教语言的最少人数","frequency":0.0,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","submitted":4648,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7232832812136563,"acs":27986,"articleLive":2,"columnArticles":366,"formTitle":"[1734]解码异或后的排列","frequency":0.0,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"ac","submitted":38693,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.48914069877242683,"acs":1036,"articleLive":2,"columnArticles":26,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","submitted":2118,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.4491686423513526,"acs":28608,"articleLive":2,"columnArticles":351,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":0.0,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"ac","submitted":63691,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.3164514223010045,"acs":3749,"articleLive":2,"columnArticles":105,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":0.0,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","questionId":"1859","status":"","submitted":11847,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6538461538461539,"acs":28475,"articleLive":2,"columnArticles":386,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":0.0,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"ac","submitted":43550,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.4709980839574987,"acs":2704,"articleLive":2,"columnArticles":57,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","submitted":5741,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.7028985507246377,"acs":582,"articleLive":2,"columnArticles":20,"formTitle":"[1740]找到二叉树中的距离","frequency":0.0,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"lock","submitted":828,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8422114608555287,"acs":2087,"articleLive":2,"columnArticles":31,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","questionId":"1892","status":"lock","submitted":2478,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7088375198197446,"acs":8494,"articleLive":2,"columnArticles":129,"formTitle":"[1742]盒子中小球的最大数量","frequency":0.0,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","submitted":11983,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6965722987041238,"acs":22415,"articleLive":2,"columnArticles":327,"formTitle":"[1743]从相邻元素对还原数组","frequency":0.0,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"ac","submitted":32179,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.362842285919209,"acs":28330,"articleLive":2,"columnArticles":368,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":0.0,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","questionId":"1872","status":"ac","submitted":78078,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.4847795163584637,"acs":3408,"articleLive":2,"columnArticles":71,"formTitle":"[1745]回文串分割 IV","frequency":0.0,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","submitted":7030,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.591931216931217,"acs":895,"articleLive":2,"columnArticles":38,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":0.0,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"lock","submitted":1512,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.7037427517132314,"acs":1335,"articleLive":2,"columnArticles":34,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"lock","submitted":1897,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.748162859980139,"acs":11301,"articleLive":2,"columnArticles":225,"formTitle":"[1748]唯一元素的和","frequency":0.0,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","submitted":15105,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5310532341156268,"acs":3711,"articleLive":2,"columnArticles":86,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":0.0,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","submitted":6988,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.4560378408458542,"acs":3278,"articleLive":2,"columnArticles":80,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","questionId":"1850","status":"","submitted":7188,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.4702991452991453,"acs":2201,"articleLive":2,"columnArticles":33,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":0.0,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","questionId":"1851","status":"","submitted":4680,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.6798001427551749,"acs":9524,"articleLive":2,"columnArticles":112,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":0.0,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","submitted":14010,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6300010446046171,"acs":6031,"articleLive":2,"columnArticles":129,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","submitted":9573,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.4218141902005788,"acs":4227,"articleLive":2,"columnArticles":91,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":0.0,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","submitted":10021,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.4112386545648692,"acs":3081,"articleLive":2,"columnArticles":52,"formTitle":"[1755]最接近目标值的子序列和","frequency":0.0,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","submitted":7492,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.7954070981210856,"acs":381,"articleLive":2,"columnArticles":13,"formTitle":"[1756]设计最近使用（MRU）队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"lock","submitted":479,"title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9208009563658099,"acs":3081,"articleLive":2,"columnArticles":32,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"lock","submitted":3346,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6389403973509934,"acs":7236,"articleLive":2,"columnArticles":114,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","submitted":11325,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.42960691385558963,"acs":4623,"articleLive":2,"columnArticles":97,"formTitle":"[1759]统计同构子字符串的数目","frequency":0.0,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","submitted":10761,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5397866049620774,"acs":4199,"articleLive":2,"columnArticles":77,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","submitted":7779,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.43148880105401843,"acs":2620,"articleLive":2,"columnArticles":40,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":0.0,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","questionId":"1887","status":"","submitted":6072,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.695906432748538,"acs":714,"articleLive":2,"columnArticles":21,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"lock","submitted":1026,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.6107766847746293,"acs":4160,"articleLive":2,"columnArticles":82,"formTitle":"[1763]最长的美好子字符串","frequency":0.0,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","submitted":6811,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.47458999797529866,"acs":2344,"articleLive":2,"columnArticles":55,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.0,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","questionId":"1874","status":"","submitted":4939,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5516772438803264,"acs":3651,"articleLive":2,"columnArticles":83,"formTitle":"[1765]地图中的最高点","frequency":0.0,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","submitted":6618,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.3760660980810235,"acs":1411,"articleLive":2,"columnArticles":26,"formTitle":"[1766]互质树","frequency":0.0,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","submitted":3752,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7905468025949953,"acs":853,"articleLive":2,"columnArticles":21,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","questionId":"1914","status":"lock","submitted":1079,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7638861238303802,"acs":11511,"articleLive":2,"columnArticles":202,"formTitle":"[1768]交替合并字符串","frequency":0.0,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","submitted":15069,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8563847708894878,"acs":10167,"articleLive":2,"columnArticles":173,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":0.0,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","questionId":"1895","status":"","submitted":11872,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.37056928034371645,"acs":4140,"articleLive":2,"columnArticles":104,"formTitle":"[1770]执行乘法运算的最大分数","frequency":0.0,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","submitted":11172,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.36576971214017523,"acs":2338,"articleLive":2,"columnArticles":47,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","submitted":6392,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.51698670605613,"acs":350,"articleLive":2,"columnArticles":11,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"lock","submitted":677,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8426525919732442,"acs":16125,"articleLive":2,"columnArticles":199,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":0.0,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","submitted":19136,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5508668929456013,"acs":6005,"articleLive":2,"columnArticles":90,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":0.0,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","submitted":10901,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.4743830917339825,"acs":4287,"articleLive":2,"columnArticles":92,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":0.0,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","questionId":"1901","status":"","submitted":9037,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.4626904208623806,"acs":1792,"articleLive":2,"columnArticles":43,"formTitle":"[1776]车队 II","frequency":0.0,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","submitted":3873,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.782259222046792,"acs":5450,"articleLive":2,"columnArticles":61,"formTitle":"[1777]每家商店的产品价格","frequency":0.0,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"lock","submitted":6967,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5186246418338109,"acs":181,"articleLive":2,"columnArticles":10,"formTitle":"[1778]未知网格中的最短路径","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","questionId":"1931","status":"lock","submitted":349,"title":"未知网格中的最短路径","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.648360655737705,"acs":5537,"articleLive":2,"columnArticles":70,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":0.0,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","questionId":"1888","status":"","submitted":8540,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.6654619925310203,"acs":5524,"articleLive":2,"columnArticles":113,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","questionId":"1889","status":"","submitted":8301,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5197426516967327,"acs":4120,"articleLive":2,"columnArticles":61,"formTitle":"[1781]所有子字符串美丽值之和","frequency":0.0,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","submitted":7927,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.29200968523002424,"acs":1206,"articleLive":2,"columnArticles":33,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","submitted":4130,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7993442622950819,"acs":1219,"articleLive":2,"columnArticles":29,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"lock","submitted":1525,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.42154577883472055,"acs":8863,"articleLive":2,"columnArticles":101,"formTitle":"[1784]检查二进制字符串字段","frequency":0.0,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","questionId":"1910","status":"","submitted":21025,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.35036576045419804,"acs":6418,"articleLive":2,"columnArticles":62,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","questionId":"1911","status":"","submitted":18318,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.342034203420342,"acs":3420,"articleLive":2,"columnArticles":88,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.0,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","questionId":"1912","status":"","submitted":9999,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.6540894462323826,"acs":11788,"articleLive":2,"columnArticles":60,"formTitle":"[1787]使所有区间的异或结果为零","frequency":0.0,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","questionId":"1913","status":"ac","submitted":18022,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.7155963302752294,"acs":234,"articleLive":2,"columnArticles":16,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"lock","submitted":327,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.710728836577637,"acs":1570,"articleLive":2,"columnArticles":30,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"lock","submitted":2209,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6438952777098116,"acs":13158,"articleLive":2,"columnArticles":144,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":0.0,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","questionId":"1915","status":"","submitted":20435,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8078494193031638,"acs":10086,"articleLive":2,"columnArticles":139,"formTitle":"[1791]找出星型图的中心节点","frequency":0.0,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","questionId":"1916","status":"","submitted":12485,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5139968895800933,"acs":6610,"articleLive":2,"columnArticles":105,"formTitle":"[1792]最大平均通过率","frequency":0.0,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","submitted":12860,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.41445834216663135,"acs":3910,"articleLive":2,"columnArticles":94,"formTitle":"[1793]好子数组的最大分数","frequency":0.0,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","submitted":9434,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.5805369127516778,"acs":173,"articleLive":2,"columnArticles":9,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","questionId":"1943","status":"lock","submitted":298,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7851513894649523,"acs":1893,"articleLive":2,"columnArticles":28,"formTitle":"[1795]每个产品在不同商店的价格","frequency":0.0,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"lock","submitted":2411,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.48883863437408814,"acs":6701,"articleLive":2,"columnArticles":122,"formTitle":"[1796]字符串中第二大的数字","frequency":0.0,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"ac","submitted":13708,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.57391743466734,"acs":4546,"articleLive":2,"columnArticles":72,"formTitle":"[1797]设计一个验证系统","frequency":0.0,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"ac","submitted":7921,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5217611336032388,"acs":3093,"articleLive":2,"columnArticles":51,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":0.0,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","questionId":"1930","status":"","submitted":5928,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5185185185185185,"acs":2366,"articleLive":2,"columnArticles":34,"formTitle":"[1799]N 次操作后的最大分数和","frequency":0.0,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","submitted":4563,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6824493196334351,"acs":9830,"articleLive":2,"columnArticles":154,"formTitle":"[1800]最大升序子数组和","frequency":0.0,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"ac","submitted":14404,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.3795687134502924,"acs":4154,"articleLive":2,"columnArticles":110,"formTitle":"[1801]积压订单中的订单总数","frequency":0.0,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"notac","submitted":10944,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.2624945404629687,"acs":4207,"articleLive":2,"columnArticles":108,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","questionId":"1929","status":"","submitted":16027,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.409404990403071,"acs":2133,"articleLive":2,"columnArticles":54,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":0.0,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"ac","submitted":5210,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5731857318573186,"acs":466,"articleLive":2,"columnArticles":29,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":0.0,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"lock","submitted":813,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.4873401424770406,"acs":11356,"articleLive":2,"columnArticles":149,"formTitle":"[1805]字符串中不同整数的数目","frequency":0.0,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","submitted":23302,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.6626659856996936,"acs":5190,"articleLive":2,"columnArticles":81,"formTitle":"[1806]还原排列的最少操作步数","frequency":0.0,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","questionId":"1935","status":"","submitted":7832,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5864077669902913,"acs":5738,"articleLive":2,"columnArticles":87,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","submitted":9785,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.2679158448389218,"acs":2445,"articleLive":2,"columnArticles":47,"formTitle":"[1808]好因子的最大数目","frequency":0.0,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","submitted":9126,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6249549224666426,"acs":1733,"articleLive":2,"columnArticles":31,"formTitle":"[1809]没有广告的剧集","frequency":0.0,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"lock","submitted":2773,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.6241610738255033,"acs":186,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":0.0,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","questionId":"1959","status":"lock","submitted":298,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6641221374045801,"acs":870,"articleLive":2,"columnArticles":27,"formTitle":"[1811]寻找面试候选人","frequency":0.0,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"lock","submitted":1310,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7941637289463377,"acs":8110,"articleLive":2,"columnArticles":192,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.0,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"ac","submitted":10212,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5122159901131286,"acs":5388,"articleLive":2,"columnArticles":74,"formTitle":"[1813]句子相似性 III","frequency":0.0,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"ac","submitted":10519,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.3458646616541353,"acs":3588,"articleLive":2,"columnArticles":79,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":0.0,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"ac","submitted":10374,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.3019366197183099,"acs":1715,"articleLive":2,"columnArticles":40,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","submitted":5680,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.752356962936308,"acs":10454,"articleLive":2,"columnArticles":156,"formTitle":"[1816]截断句子","frequency":0.0,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"ac","submitted":13895,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6989059590316573,"acs":6005,"articleLive":2,"columnArticles":98,"formTitle":"[1817]查找用户活跃分钟数","frequency":0.0,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"ac","submitted":8592,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.3732456585026723,"acs":25770,"articleLive":2,"columnArticles":338,"formTitle":"[1818]绝对差值和","frequency":0.0,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"ac","submitted":69043,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.3686884725309622,"acs":2322,"articleLive":2,"columnArticles":31,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.0,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","submitted":6298,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.5095238095238095,"acs":107,"articleLive":2,"columnArticles":8,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"lock","submitted":210,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.9008683068017366,"acs":2490,"articleLive":2,"columnArticles":22,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":0.0,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","questionId":"1974","status":"lock","submitted":2764,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8092336252471851,"acs":20052,"articleLive":2,"columnArticles":201,"formTitle":"[1822]数组元素积的符号","frequency":0.0,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","submitted":24779,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7160793504645517,"acs":8555,"articleLive":2,"columnArticles":105,"formTitle":"[1823]找出游戏的获胜者","frequency":0.0,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","submitted":11947,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6550416982562547,"acs":7776,"articleLive":2,"columnArticles":154,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","submitted":11871,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.2857451403887689,"acs":2646,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":0.0,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","submitted":9260,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.4296998420221169,"acs":272,"articleLive":2,"columnArticles":22,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"lock","submitted":633,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7934007627259161,"acs":9570,"articleLive":2,"columnArticles":139,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"ac","submitted":12062,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.8670900178253119,"acs":7783,"articleLive":2,"columnArticles":102,"formTitle":"[1828]统计一个圆中点的数目","frequency":0.0,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","questionId":"1939","status":"ac","submitted":8976,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.682580424366872,"acs":3989,"articleLive":2,"columnArticles":83,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"ac","submitted":5844,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.4861816130851664,"acs":862,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","questionId":"1941","status":"ac","submitted":1773,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.738599348534202,"acs":907,"articleLive":2,"columnArticles":23,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"lock","submitted":1228,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8243598362158528,"acs":13489,"articleLive":2,"columnArticles":216,"formTitle":"[1832]判断句子是否为全字母句","frequency":0.0,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"ac","submitted":16363,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6843292702033654,"acs":43678,"articleLive":2,"columnArticles":389,"formTitle":"[1833]雪糕的最大数量","frequency":0.0,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"ac","submitted":63826,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.3545731882806654,"acs":6160,"articleLive":2,"columnArticles":131,"formTitle":"[1834]单线程 CPU","frequency":0.0,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","submitted":17373,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5100435454417755,"acs":3631,"articleLive":2,"columnArticles":60,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":0.0,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","questionId":"1963","status":"","submitted":7119,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.7094594594594594,"acs":420,"articleLive":2,"columnArticles":27,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":0.0,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","questionId":"1982","status":"lock","submitted":592,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7952235772357723,"acs":7825,"articleLive":2,"columnArticles":89,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":0.0,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"ac","submitted":9840,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.4291209848047701,"acs":29003,"articleLive":2,"columnArticles":307,"formTitle":"[1838]最高频元素的频数","frequency":0.0,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"ac","submitted":67587,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5729331226961558,"acs":6528,"articleLive":2,"columnArticles":124,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"ac","submitted":11394,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.38927233287320057,"acs":1974,"articleLive":2,"columnArticles":47,"formTitle":"[1840]最高建筑高度","frequency":0.0,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"ac","submitted":5071,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5150850246845858,"acs":939,"articleLive":2,"columnArticles":30,"formTitle":"[1841]联赛信息统计","frequency":0.0,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"lock","submitted":1823,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.6557377049180327,"acs":120,"articleLive":2,"columnArticles":11,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"lock","submitted":183,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.5114263199369582,"acs":649,"articleLive":2,"columnArticles":23,"formTitle":"[1843]Suspicious Bank Accounts","frequency":0.0,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","questionId":"1998","status":"lock","submitted":1269,"title":"Suspicious Bank Accounts","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.7999308914996545,"acs":6945,"articleLive":2,"columnArticles":115,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","questionId":"1954","status":"","submitted":8682,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.5342008946726311,"acs":6568,"articleLive":2,"columnArticles":62,"formTitle":"[1845]座位预约管理系统","frequency":0.0,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","questionId":"1955","status":"","submitted":12295,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.6335339520352844,"acs":27579,"articleLive":2,"columnArticles":376,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":0.0,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","questionId":"1956","status":"ac","submitted":43532,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.359828141783029,"acs":2345,"articleLive":2,"columnArticles":43,"formTitle":"[1847]最近的房间","frequency":0.0,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1957","status":"","submitted":6517,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6833946400420389,"acs":7803,"articleLive":2,"columnArticles":100,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","questionId":"1975","status":"","submitted":11418,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.3282237304001872,"acs":5610,"articleLive":2,"columnArticles":108,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":0.0,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","questionId":"1976","status":"","submitted":17092,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6103730199284619,"acs":2389,"articleLive":2,"columnArticles":49,"formTitle":"[1850]邻位交换的最小次数","frequency":0.0,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","questionId":"1978","status":"","submitted":3914,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.4005607850991388,"acs":2000,"articleLive":2,"columnArticles":48,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.0,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","questionId":"1977","status":"","submitted":4993,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.6936619718309859,"acs":197,"articleLive":2,"columnArticles":12,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","questionId":"2003","status":"lock","submitted":284,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6445526475958613,"acs":1059,"articleLive":2,"columnArticles":19,"formTitle":"[1853]转换日期格式","frequency":0.0,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","questionId":"2004","status":"lock","submitted":1643,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.787370531239559,"acs":11783,"articleLive":2,"columnArticles":123,"formTitle":"[1854]人口最多的年份","frequency":0.0,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","questionId":"1983","status":"ac","submitted":14965,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.6797208220240403,"acs":10518,"articleLive":2,"columnArticles":100,"formTitle":"[1855]下标对中的最大距离","frequency":0.0,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","questionId":"1984","status":"notac","submitted":15474,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.35647189937907975,"acs":4478,"articleLive":2,"columnArticles":84,"formTitle":"[1856]子数组最小乘积的最大值","frequency":0.0,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","questionId":"1985","status":"ac","submitted":12562,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.4522332506203474,"acs":2187,"articleLive":2,"columnArticles":31,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","questionId":"1986","status":"","submitted":4836,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.6358595194085028,"acs":344,"articleLive":2,"columnArticles":19,"formTitle":"[1858]包含所有前缀的最长单词","frequency":0.0,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","questionId":"2009","status":"lock","submitted":541,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7667255464782513,"acs":6945,"articleLive":2,"columnArticles":146,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","questionId":"1970","status":"ac","submitted":9058,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.771749476489625,"acs":4054,"articleLive":2,"columnArticles":67,"formTitle":"[1860]增长的内存泄露","frequency":0.0,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","questionId":"1971","status":"ac","submitted":5253,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6194264569842738,"acs":3348,"articleLive":2,"columnArticles":69,"formTitle":"[1861]旋转盒子","frequency":0.0,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","questionId":"1972","status":"notac","submitted":5405,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.313381255183854,"acs":2267,"articleLive":2,"columnArticles":43,"formTitle":"[1862]向下取整数对和","frequency":0.0,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","questionId":"1326","status":"notac","submitted":7234,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.9035267510071383,"acs":12784,"articleLive":2,"columnArticles":144,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":0.0,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","questionId":"1993","status":"","submitted":14149,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.38811219555086607,"acs":4414,"articleLive":2,"columnArticles":105,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":0.0,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","questionId":"1994","status":"ac","submitted":11373,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.5127809395196296,"acs":5316,"articleLive":2,"columnArticles":62,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.0,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","questionId":"1995","status":"ac","submitted":10367,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.5973154362416108,"acs":2225,"articleLive":2,"columnArticles":49,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":0.0,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","questionId":"1996","status":"","submitted":3725,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7412790697674418,"acs":510,"articleLive":2,"columnArticles":15,"formTitle":"[1867]Orders With Maximum Quantity Above Average","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","questionId":"2014","status":"lock","submitted":688,"title":"Orders With Maximum Quantity Above Average","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5476923076923077,"acs":178,"articleLive":2,"columnArticles":12,"formTitle":"[1868]两个行程编码数组的积","frequency":0.0,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","questionId":"2019","status":"lock","submitted":325,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.787962962962963,"acs":12765,"articleLive":2,"columnArticles":140,"formTitle":"[1869]哪种连续子字符串更长","frequency":0.0,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","questionId":"1999","status":"ac","submitted":16200,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.4552924117931368,"acs":7536,"articleLive":2,"columnArticles":72,"formTitle":"[1870]准时到达的列车最小时速","frequency":0.0,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","questionId":"2000","status":"notac","submitted":16552,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.2763976586624879,"acs":5997,"articleLive":2,"columnArticles":128,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","questionId":"2001","status":"notac","submitted":21697,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.6225669099756691,"acs":2047,"articleLive":2,"columnArticles":29,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","questionId":"2002","status":"","submitted":3288,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.8125478194338179,"acs":2124,"articleLive":2,"columnArticles":32,"formTitle":"[1873]计算特殊奖金","frequency":0.0,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","questionId":"2024","status":"lock","submitted":2614,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.8939828080229226,"acs":312,"articleLive":2,"columnArticles":18,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","questionId":"2029","status":"lock","submitted":349,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.7437722419928826,"acs":418,"articleLive":2,"columnArticles":18,"formTitle":"[1875]Group Employees of the Same Salary","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","questionId":"2030","status":"lock","submitted":562,"title":"Group Employees of the Same Salary","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7289908474979199,"acs":6133,"articleLive":2,"columnArticles":95,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","questionId":"1987","status":"ac","submitted":8413,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8203852834359703,"acs":31173,"articleLive":2,"columnArticles":401,"formTitle":"[1877]数组中最大数对和的最小值","frequency":0.0,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","questionId":"1988","status":"ac","submitted":37998,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.42965627498001596,"acs":2150,"articleLive":2,"columnArticles":56,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","questionId":"1990","status":"ac","submitted":5004,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.41109405832054374,"acs":1875,"articleLive":2,"columnArticles":39,"formTitle":"[1879]两个数组最小的异或值之和","frequency":0.0,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","questionId":"1989","status":"","submitted":4561,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7705846027171676,"acs":7487,"articleLive":2,"columnArticles":101,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":0.0,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","questionId":"2010","status":"ac","submitted":9716,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.35394045534150614,"acs":6063,"articleLive":2,"columnArticles":63,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","questionId":"2011","status":"ac","submitted":17130,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.27861787388477244,"acs":3685,"articleLive":2,"columnArticles":111,"formTitle":"[1882]使用服务器处理任务","frequency":0.0,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","questionId":"2012","status":"notac","submitted":13226,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.3759430911834447,"acs":1744,"articleLive":2,"columnArticles":28,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.0,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","questionId":"2013","status":"","submitted":4639,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.6887091100949702,"acs":1958,"articleLive":2,"columnArticles":38,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":0.0,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","questionId":"2031","status":"","submitted":2843,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5186721991701245,"acs":250,"articleLive":2,"columnArticles":11,"formTitle":"[1885]Count Pairs in Two Arrays","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","questionId":"2036","status":"lock","submitted":482,"title":"Count Pairs in Two Arrays","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.5716701902748414,"acs":5408,"articleLive":2,"columnArticles":77,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":0.0,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","questionId":"2015","status":"","submitted":9460,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.6457393483709273,"acs":5153,"articleLive":2,"columnArticles":64,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":0.0,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","questionId":"2016","status":"","submitted":7980,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.3173714285714286,"acs":2777,"articleLive":2,"columnArticles":63,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":0.0,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","questionId":"2017","status":"","submitted":8750,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.27128408654461655,"acs":2119,"articleLive":2,"columnArticles":41,"formTitle":"[1889]装包裹的最小浪费空间","frequency":0.0,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","questionId":"2018","status":"","submitted":7811,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.7081513828238719,"acs":973,"articleLive":2,"columnArticles":20,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","questionId":"2041","status":"lock","submitted":1374,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.4659270998415214,"acs":294,"articleLive":2,"columnArticles":11,"formTitle":"[1891]割绳子","frequency":0.0,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"2045","status":"lock","submitted":631,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.3385772913816689,"acs":495,"articleLive":2,"columnArticles":14,"formTitle":"[1892]页面推荐Ⅱ","frequency":0.0,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","questionId":"2046","status":"lock","submitted":1462,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.591066066066066,"acs":31492,"articleLive":2,"columnArticles":410,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":0.0,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","questionId":"2005","status":"ac","submitted":53280,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.4578738366589213,"acs":37243,"articleLive":2,"columnArticles":513,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":0.0,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","questionId":"2006","status":"ac","submitted":81339,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5336059289547662,"acs":2088,"articleLive":2,"columnArticles":40,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","questionId":"1311","status":"notac","submitted":3913,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5068330362448009,"acs":853,"articleLive":2,"columnArticles":31,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","questionId":"2008","status":"","submitted":1683,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.5309615707333445,"acs":6328,"articleLive":2,"columnArticles":79,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":0.0,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","questionId":"2025","status":"ac","submitted":11918,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.3101721914586968,"acs":4089,"articleLive":2,"columnArticles":63,"formTitle":"[1898]可移除字符的最大数目","frequency":0.0,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","questionId":"2027","status":"notac","submitted":13183,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.63001010441226,"acs":3741,"articleLive":2,"columnArticles":42,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","questionId":"2026","status":"","submitted":5938,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.43648321218414676,"acs":1261,"articleLive":2,"columnArticles":36,"formTitle":"[1900]最佳运动员的比拼回合","frequency":0.0,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","questionId":"2028","status":"","submitted":2889,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6556564822460776,"acs":794,"articleLive":2,"columnArticles":30,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","questionId":"2047","status":"","submitted":1211,"title":"找出顶峰元素 II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.4519774011299435,"acs":80,"articleLive":2,"columnArticles":4,"formTitle":"[1902]Depth of BST Given Insertion Order","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","questionId":"2052","status":"lock","submitted":177,"title":"Depth of BST Given Insertion Order","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6434841323430115,"acs":7624,"articleLive":2,"columnArticles":103,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","questionId":"2032","status":"","submitted":11848,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.2843668946003301,"acs":3618,"articleLive":2,"columnArticles":73,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","questionId":"2033","status":"","submitted":12723,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.5713773314203731,"acs":4779,"articleLive":2,"columnArticles":96,"formTitle":"[1905]统计子岛屿","frequency":0.0,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","questionId":"2035","status":"","submitted":8364,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.42501692620176035,"acs":2511,"articleLive":2,"columnArticles":57,"formTitle":"[1906]查询差绝对值的最小值","frequency":0.0,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","questionId":"2034","status":"","submitted":5908,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.5911799761620977,"acs":496,"articleLive":2,"columnArticles":17,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","questionId":"2057","status":"lock","submitted":839,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.6706349206349206,"acs":169,"articleLive":2,"columnArticles":7,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","questionId":"2062","status":"lock","submitted":252,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.32515632515632514,"acs":4732,"articleLive":2,"columnArticles":73,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":0.0,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","questionId":"2020","status":"notac","submitted":14553,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.6749271137026239,"acs":3704,"articleLive":2,"columnArticles":57,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.0,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","questionId":"2021","status":"ac","submitted":5488,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.5688216892596455,"acs":3273,"articleLive":2,"columnArticles":70,"formTitle":"[1911]最大子序列交替和","frequency":0.0,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","questionId":"2022","status":"notac","submitted":5754,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.26901730329742085,"acs":1648,"articleLive":2,"columnArticles":38,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","questionId":"2023","status":"","submitted":6126,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.8363342099939308,"acs":8268,"articleLive":2,"columnArticles":88,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":0.0,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","questionId":"2042","status":"ac","submitted":9886,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.44195823162462705,"acs":3259,"articleLive":2,"columnArticles":70,"formTitle":"[1914]循环轮转矩阵","frequency":0.0,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","questionId":"2043","status":"","submitted":7374,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.39148295221142,"acs":2859,"articleLive":2,"columnArticles":56,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","questionId":"2044","status":"notac","submitted":7303,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5529522024367385,"acs":1180,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":0.0,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","questionId":"1313","status":"","submitted":2134,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.2742857142857143,"acs":288,"articleLive":2,"columnArticles":10,"formTitle":"[1917]Leetcodify Friends Recommendations","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","questionId":"2063","status":"lock","submitted":1050,"title":"Leetcodify Friends Recommendations","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.498220640569395,"acs":140,"articleLive":2,"columnArticles":3,"formTitle":"[1918]第 K 小的子数组和·","frequency":0.0,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","questionId":"2069","status":"lock","submitted":281,"title":"第 K 小的子数组和·","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.39158878504672895,"acs":419,"articleLive":2,"columnArticles":13,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","questionId":"2064","status":"lock","submitted":1070,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.9129632735200403,"acs":10888,"articleLive":2,"columnArticles":96,"formTitle":"[1920]基于排列构建数组","frequency":0.0,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","questionId":"2048","status":"ac","submitted":11926,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.34425616745576876,"acs":5526,"articleLive":2,"columnArticles":90,"formTitle":"[1921]消灭怪物的最大数量","frequency":0.0,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","questionId":"2049","status":"ac","submitted":16052,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.3615366669258885,"acs":4649,"articleLive":2,"columnArticles":79,"formTitle":"[1922]统计好数字的数目","frequency":0.0,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","questionId":"2050","status":"","submitted":12859,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.237989182309895,"acs":1496,"articleLive":2,"columnArticles":30,"formTitle":"[1923]最长公共子路径","frequency":0.0,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","questionId":"2051","status":"","submitted":6286,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.38235294117647056,"acs":65,"articleLive":2,"columnArticles":5,"formTitle":"[1924]Erect the Fence II","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","questionId":"2074","status":"lock","submitted":170,"title":"Erect the Fence II","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6910327241818954,"acs":4878,"articleLive":2,"columnArticles":61,"formTitle":"[1925]统计平方和三元组的数目","frequency":0.0,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","questionId":"2037","status":"ac","submitted":7059,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.34465195246179964,"acs":3654,"articleLive":2,"columnArticles":62,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","questionId":"2038","status":"notac","submitted":10602,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.4153179849555505,"acs":1822,"articleLive":2,"columnArticles":37,"formTitle":"[1927]求和游戏","frequency":0.0,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","questionId":"2039","status":"notac","submitted":4387,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.3987430167597765,"acs":2284,"articleLive":2,"columnArticles":37,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":0.0,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","questionId":"2040","status":"notac","submitted":5728,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.9119455900441358,"acs":12604,"articleLive":2,"columnArticles":109,"formTitle":"[1929]数组串联","frequency":0.0,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","questionId":"2058","status":"","submitted":13821,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.48095690474134206,"acs":5569,"articleLive":2,"columnArticles":99,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":0.0,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","questionId":"2059","status":"","submitted":11579,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5607094133697135,"acs":2055,"articleLive":2,"columnArticles":63,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":0.0,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","questionId":"2061","status":"","submitted":3665,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.32884500299222025,"acs":1099,"articleLive":2,"columnArticles":36,"formTitle":"[1932]合并多棵二叉搜索树","frequency":0.0,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","questionId":"2060","status":"","submitted":3342,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5435582822085889,"acs":443,"articleLive":2,"columnArticles":24,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.0,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","questionId":"2070","status":"lock","submitted":815,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7293233082706767,"acs":291,"articleLive":2,"columnArticles":11,"formTitle":"[1934]Confirmation Rate","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","questionId":"2087","status":"lock","submitted":399,"title":"Confirmation Rate","titleSlug":"confirmation-rate"},{"acceptance":0.7393622809881379,"acs":6794,"articleLive":2,"columnArticles":95,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","questionId":"1264","status":"","submitted":9189,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.450323715130685,"acs":5634,"articleLive":2,"columnArticles":65,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","questionId":"2066","status":"","submitted":12511,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.24281223644866978,"acs":3167,"articleLive":2,"columnArticles":64,"formTitle":"[1937]扣分后的最大得分","frequency":0.0,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","questionId":"2067","status":"","submitted":13043,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.34586238254016366,"acs":1141,"articleLive":2,"columnArticles":41,"formTitle":"[1938]查询最大基因差","frequency":0.0,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","questionId":"2068","status":"","submitted":3299,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6185852981969486,"acs":446,"articleLive":2,"columnArticles":13,"formTitle":"[1939]Users That Actively Request Confirmation Messages","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","questionId":"2092","status":"lock","submitted":721,"title":"Users That Actively Request Confirmation Messages","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.7966804979253111,"acs":384,"articleLive":2,"columnArticles":25,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","questionId":"2071","status":"lock","submitted":482,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.7732465883846398,"acs":4873,"articleLive":2,"columnArticles":85,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":0.0,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","questionId":"2053","status":"ac","submitted":6302,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.39304956896551724,"acs":2918,"articleLive":2,"columnArticles":69,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","questionId":"2054","status":"ac","submitted":7424,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.40871057712937137,"acs":1905,"articleLive":2,"columnArticles":52,"formTitle":"[1943]描述绘画结果","frequency":0.0,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","questionId":"2055","status":"notac","submitted":4661,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.578125,"acs":1998,"articleLive":2,"columnArticles":55,"formTitle":"[1944]队列中可以看到的人数","frequency":0.0,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","questionId":"1305","status":"","submitted":3456,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6644504885665357,"acs":6596,"articleLive":2,"columnArticles":78,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":0.0,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","questionId":"2076","status":"ac","submitted":9927,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.3042959427207637,"acs":5355,"articleLive":2,"columnArticles":82,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":0.0,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","questionId":"2077","status":"ac","submitted":17598,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5428801503153939,"acs":4045,"articleLive":2,"columnArticles":90,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","questionId":"2078","status":"ac","submitted":7451,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.5153764581124072,"acs":972,"articleLive":2,"columnArticles":20,"formTitle":"[1948]删除系统中的重复文件夹","frequency":0.0,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","questionId":"2079","status":"","submitted":1886,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.5336225596529284,"acs":246,"articleLive":2,"columnArticles":12,"formTitle":"[1949]Strong Friendship","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","questionId":"2097","status":"lock","submitted":461,"title":"Strong Friendship","titleSlug":"strong-friendship"},{"acceptance":0.5537848605577689,"acs":139,"articleLive":2,"columnArticles":7,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","questionId":"2072","status":"lock","submitted":251,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.6680942184154176,"acs":312,"articleLive":2,"columnArticles":12,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","questionId":"2098","status":"lock","submitted":467,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5456742010911925,"acs":7001,"articleLive":2,"columnArticles":80,"formTitle":"[1952]三除数","frequency":0.0,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","questionId":"2083","status":"ac","submitted":12830,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.32623301267369065,"acs":4273,"articleLive":2,"columnArticles":83,"formTitle":"[1953]你可以工作的最大周数","frequency":0.0,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","questionId":"2084","status":"ac","submitted":13098,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.48076036866359445,"acs":4173,"articleLive":2,"columnArticles":69,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":0.0,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","questionId":"1295","status":"ac","submitted":8680,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.4963768115942029,"acs":2603,"articleLive":2,"columnArticles":41,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.0,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","questionId":"2086","status":"","submitted":5244,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.459214501510574,"acs":152,"articleLive":2,"columnArticles":11,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":0.0,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","questionId":"2073","status":"lock","submitted":331,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6047225186766275,"acs":4533,"articleLive":2,"columnArticles":58,"formTitle":"[1957]删除字符使字符串变好","frequency":0.0,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","questionId":"1302","status":"","submitted":7496,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.42442155041378143,"acs":2513,"articleLive":2,"columnArticles":44,"formTitle":"[1958]检查操作是否合法","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","questionId":"2080","status":"","submitted":5921,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.41391839016210175,"acs":1481,"articleLive":2,"columnArticles":32,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","questionId":"2081","status":"","submitted":3578,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.27893569844789357,"acs":629,"articleLive":2,"columnArticles":19,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":0.0,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","questionId":"1336","status":"","submitted":2255,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5345681835505754,"acs":7013,"articleLive":2,"columnArticles":65,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":0.0,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","questionId":"2093","status":"","submitted":13119,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.4318688928214203,"acs":5613,"articleLive":2,"columnArticles":75,"formTitle":"[1962]移除石子使总数最小","frequency":0.0,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","questionId":"2094","status":"","submitted":12997,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6146611341632089,"acs":4444,"articleLive":2,"columnArticles":55,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":0.0,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","questionId":"2095","status":"","submitted":7230,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.3856951055779324,"acs":3160,"articleLive":2,"columnArticles":47,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","questionId":"2096","status":"","submitted":8193,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.7357001972386588,"acs":373,"articleLive":2,"columnArticles":13,"formTitle":"[1965]Employees With Missing Information","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","questionId":"2110","status":"lock","submitted":507,"title":"Employees With Missing Information","titleSlug":"employees-with-missing-information"},{"acceptance":0.7288135593220338,"acs":43,"articleLive":2,"columnArticles":6,"formTitle":"[1966]Binary Searchable Numbers in an Unsorted Array","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","questionId":"2111","status":"lock","submitted":59,"title":"Binary Searchable Numbers in an Unsorted Array","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.778838808250573,"acs":6117,"articleLive":2,"columnArticles":58,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","questionId":"2099","status":"","submitted":7854,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.35877921279212793,"acs":4667,"articleLive":2,"columnArticles":68,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","questionId":"2085","status":"","submitted":13008,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.278983083245723,"acs":2919,"articleLive":2,"columnArticles":43,"formTitle":"[1969]数组元素的最小非零乘积","frequency":0.0,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","questionId":"2100","status":"","submitted":10463,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.4786361674579197,"acs":2218,"articleLive":2,"columnArticles":50,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":0.0,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","questionId":"2101","status":"","submitted":4634,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.5442247658688866,"acs":523,"articleLive":2,"columnArticles":20,"formTitle":"[1971]Find if Path Exists in Graph","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","questionId":"2121","status":"","submitted":961,"title":"Find if Path Exists in Graph","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.4572127139364303,"acs":187,"articleLive":2,"columnArticles":8,"formTitle":"[1972]First and Last Call On the Same Day","frequency":0.0,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","questionId":"2120","status":"lock","submitted":409,"title":"First and Last Call On the Same Day","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.5619834710743802,"acs":68,"articleLive":2,"columnArticles":9,"formTitle":"[1973]Count Nodes Equal to Sum of Descendants","frequency":0.0,"frontendQuestionId":"1973","leaf":true,"level":2,"nodeType":"def","questionId":"2126","status":"lock","submitted":121,"title":"Count Nodes Equal to Sum of Descendants","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.7378082699796031,"acs":3979,"articleLive":2,"columnArticles":56,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":0.0,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","questionId":"2088","status":"ac","submitted":5393,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.38158239455069426,"acs":2913,"articleLive":2,"columnArticles":46,"formTitle":"[1975]最大方阵和","frequency":0.0,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","questionId":"2089","status":"ac","submitted":7634,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.2889050036258158,"acs":1992,"articleLive":2,"columnArticles":38,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","questionId":"2090","status":"notac","submitted":6895,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.24817518248175183,"acs":748,"articleLive":2,"columnArticles":14,"formTitle":"[1977]划分数字的方案数","frequency":0.0,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","questionId":"2091","status":"","submitted":3014,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.5319148936170213,"acs":275,"articleLive":2,"columnArticles":10,"formTitle":"[1978]Employees Whose Manager Left the Company","frequency":0.0,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","questionId":"2127","status":"lock","submitted":517,"title":"Employees Whose Manager Left the Company","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.8106723585912486,"acs":7596,"articleLive":2,"columnArticles":88,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","questionId":"2106","status":"ac","submitted":9370,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.5825637970410088,"acs":5867,"articleLive":2,"columnArticles":94,"formTitle":"[1980]找出不同的二进制字符串","frequency":0.0,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","questionId":"2107","status":"ac","submitted":10071,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.29852320675105487,"acs":4528,"articleLive":2,"columnArticles":84,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":0.0,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","questionId":"2108","status":"","submitted":15168,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.4582180409518539,"acs":828,"articleLive":2,"columnArticles":18,"formTitle":"[1982]从子集的和还原数组","frequency":0.0,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","questionId":"2109","status":"","submitted":1807,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.6582278481012658,"acs":52,"articleLive":2,"columnArticles":3,"formTitle":"[1983]Widest Pair of Indices With Equal Range Sum","frequency":0.0,"frontendQuestionId":"1983","leaf":true,"level":2,"nodeType":"def","questionId":"519","status":"lock","submitted":79,"title":"Widest Pair of Indices With Equal Range Sum","titleSlug":"widest-pair-of-indices-with-equal-range-sum"},{"acceptance":0.580970447284345,"acs":5819,"articleLive":2,"columnArticles":65,"formTitle":"[1984]学生分数的最小差值","frequency":0.0,"frontendQuestionId":"1984","leaf":true,"level":1,"nodeType":"def","questionId":"2112","status":"ac","submitted":10016,"title":"学生分数的最小差值","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores"},{"acceptance":0.4123592261045336,"acs":5712,"articleLive":2,"columnArticles":80,"formTitle":"[1985]找出数组中的第 K 大整数","frequency":0.0,"frontendQuestionId":"1985","leaf":true,"level":2,"nodeType":"def","questionId":"2113","status":"ac","submitted":13852,"title":"找出数组中的第 K 大整数","titleSlug":"find-the-kth-largest-integer-in-the-array"},{"acceptance":0.2759782525461368,"acs":3604,"articleLive":2,"columnArticles":74,"formTitle":"[1986]完成任务的最少工作时间段","frequency":0.0,"frontendQuestionId":"1986","leaf":true,"level":2,"nodeType":"def","questionId":"2114","status":"notac","submitted":13059,"title":"完成任务的最少工作时间段","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks"},{"acceptance":0.46128822381262197,"acs":1418,"articleLive":2,"columnArticles":25,"formTitle":"[1987]不同的好子序列数目","frequency":0.0,"frontendQuestionId":"1987","leaf":true,"level":3,"nodeType":"def","questionId":"2115","status":"","submitted":3074,"title":"不同的好子序列数目","titleSlug":"number-of-unique-good-subsequences"},{"acceptance":0.673469387755102,"acs":198,"articleLive":2,"columnArticles":5,"formTitle":"[1988]Find Cutoff Score for Each School","frequency":0.0,"frontendQuestionId":"1988","leaf":true,"level":2,"nodeType":"def","questionId":"2136","status":"lock","submitted":294,"title":"Find Cutoff Score for Each School","titleSlug":"find-cutoff-score-for-each-school"},{"acceptance":0.45555555555555555,"acs":41,"articleLive":2,"columnArticles":2,"formTitle":"[1989]Maximum Number of People That Can Be Caught in Tag","frequency":0.0,"frontendQuestionId":"1989","leaf":true,"level":2,"nodeType":"def","questionId":"1979","status":"lock","submitted":90,"title":"Maximum Number of People That Can Be Caught in Tag","titleSlug":"maximum-number-of-people-that-can-be-caught-in-tag"},{"acceptance":0.6048632218844985,"acs":199,"articleLive":2,"columnArticles":8,"formTitle":"[1990]Count the Number of Experiments","frequency":0.0,"frontendQuestionId":"1990","leaf":true,"level":1,"nodeType":"def","questionId":"2143","status":"lock","submitted":329,"title":"Count the Number of Experiments","titleSlug":"count-the-number-of-experiments"},{"acceptance":0.6606838929289803,"acs":4270,"articleLive":2,"columnArticles":58,"formTitle":"[1991]找到数组的中间位置","frequency":0.0,"frontendQuestionId":"1991","leaf":true,"level":1,"nodeType":"def","questionId":"2102","status":"ac","submitted":6463,"title":"找到数组的中间位置","titleSlug":"find-the-middle-index-in-array"},{"acceptance":0.5944589439871512,"acs":2961,"articleLive":2,"columnArticles":57,"formTitle":"[1992]找到所有的农场组","frequency":0.0,"frontendQuestionId":"1992","leaf":true,"level":2,"nodeType":"def","questionId":"2103","status":"ac","submitted":4981,"title":"找到所有的农场组","titleSlug":"find-all-groups-of-farmland"},{"acceptance":0.38546536336591586,"acs":1814,"articleLive":2,"columnArticles":42,"formTitle":"[1993]树上的操作","frequency":0.0,"frontendQuestionId":"1993","leaf":true,"level":2,"nodeType":"def","questionId":"2104","status":"","submitted":4706,"title":"树上的操作","titleSlug":"operations-on-tree"},{"acceptance":0.3641010222489477,"acs":1211,"articleLive":2,"columnArticles":36,"formTitle":"[1994]好子集的数目","frequency":0.0,"frontendQuestionId":"1994","leaf":true,"level":3,"nodeType":"def","questionId":"2105","status":"notac","submitted":3326,"title":"好子集的数目","titleSlug":"the-number-of-good-subsets"},{"acceptance":0.5525773195876289,"acs":5628,"articleLive":2,"columnArticles":47,"formTitle":"[1995]统计特殊四元组","frequency":0.0,"frontendQuestionId":"1995","leaf":true,"level":1,"nodeType":"def","questionId":"2122","status":"ac","submitted":10185,"title":"统计特殊四元组","titleSlug":"count-special-quadruplets"},{"acceptance":0.2479428101213742,"acs":4821,"articleLive":2,"columnArticles":96,"formTitle":"[1996]游戏中弱角色的数量","frequency":0.0,"frontendQuestionId":"1996","leaf":true,"level":2,"nodeType":"def","questionId":"2123","status":"ac","submitted":19444,"title":"游戏中弱角色的数量","titleSlug":"the-number-of-weak-characters-in-the-game"},{"acceptance":0.34011956697366297,"acs":2105,"articleLive":2,"columnArticles":36,"formTitle":"[1997]访问完所有房间的第一天","frequency":0.0,"frontendQuestionId":"1997","leaf":true,"level":2,"nodeType":"def","questionId":"2124","status":"notac","submitted":6189,"title":"访问完所有房间的第一天","titleSlug":"first-day-where-you-have-been-in-all-the-rooms"},{"acceptance":0.42051017778922956,"acs":1632,"articleLive":2,"columnArticles":32,"formTitle":"[1998]数组的最大公因数排序","frequency":0.0,"frontendQuestionId":"1998","leaf":true,"level":3,"nodeType":"def","questionId":"2125","status":"","submitted":3881,"title":"数组的最大公因数排序","titleSlug":"gcd-sort-of-an-array"},{"acceptance":0.6483516483516484,"acs":59,"articleLive":2,"columnArticles":6,"formTitle":"[1999]Smallest Greater Multiple Made of Two Digits","frequency":0.0,"frontendQuestionId":"1999","leaf":true,"level":2,"nodeType":"def","questionId":"2141","status":"lock","submitted":91,"title":"Smallest Greater Multiple Made of Two Digits","titleSlug":"smallest-greater-multiple-made-of-two-digits"},{"acceptance":0.7742229306615052,"acs":6800,"articleLive":2,"columnArticles":88,"formTitle":"[2000]反转单词前缀","frequency":0.0,"frontendQuestionId":"2000","leaf":true,"level":1,"nodeType":"def","questionId":"2128","status":"ac","submitted":8783,"title":"反转单词前缀","titleSlug":"reverse-prefix-of-word"},{"acceptance":0.35902090897708777,"acs":5735,"articleLive":2,"columnArticles":125,"formTitle":"[2001]可互换矩形的组数","frequency":0.0,"frontendQuestionId":"2001","leaf":true,"level":2,"nodeType":"def","questionId":"2129","status":"ac","submitted":15974,"title":"可互换矩形的组数","titleSlug":"number-of-pairs-of-interchangeable-rectangles"},{"acceptance":0.572650952534711,"acs":3547,"articleLive":2,"columnArticles":87,"formTitle":"[2002]两个回文子序列长度的最大乘积","frequency":0.0,"frontendQuestionId":"2002","leaf":true,"level":2,"nodeType":"def","questionId":"2130","status":"","submitted":6194,"title":"两个回文子序列长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences"},{"acceptance":0.3916649388347502,"acs":1889,"articleLive":2,"columnArticles":40,"formTitle":"[2003]每棵子树内缺失的最小基因值","frequency":0.0,"frontendQuestionId":"2003","leaf":true,"level":3,"nodeType":"def","questionId":"2131","status":"","submitted":4823,"title":"每棵子树内缺失的最小基因值","titleSlug":"smallest-missing-genetic-value-in-each-subtree"},{"acceptance":0.39759036144578314,"acs":99,"articleLive":2,"columnArticles":5,"formTitle":"[2004]The Number of Seniors and Juniors to Join the Company","frequency":0.0,"frontendQuestionId":"2004","leaf":true,"level":3,"nodeType":"def","questionId":"2152","status":"lock","submitted":249,"title":"The Number of Seniors and Juniors to Join the Company","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company"},{"acceptance":0.6818181818181818,"acs":30,"articleLive":2,"columnArticles":3,"formTitle":"[2005]Subtree Removal Game with Fibonacci Tree","frequency":0.0,"frontendQuestionId":"2005","leaf":true,"level":3,"nodeType":"def","questionId":"2153","status":"lock","submitted":44,"title":"Subtree Removal Game with Fibonacci Tree","titleSlug":"subtree-removal-game-with-fibonacci-tree"},{"acceptance":0.8786773090079818,"acs":3853,"articleLive":2,"columnArticles":52,"formTitle":"[2006]差的绝对值为 K 的数对数目","frequency":0.0,"frontendQuestionId":"2006","leaf":true,"level":1,"nodeType":"def","questionId":"2116","status":"","submitted":4385,"title":"差的绝对值为 K 的数对数目","titleSlug":"count-number-of-pairs-with-absolute-difference-k"},{"acceptance":0.2988679245283019,"acs":2772,"articleLive":2,"columnArticles":51,"formTitle":"[2007]从双倍数组中还原原数组","frequency":0.0,"frontendQuestionId":"2007","leaf":true,"level":2,"nodeType":"def","questionId":"2117","status":"","submitted":9275,"title":"从双倍数组中还原原数组","titleSlug":"find-original-array-from-doubled-array"},{"acceptance":0.4188866799204771,"acs":2107,"articleLive":2,"columnArticles":39,"formTitle":"[2008]出租车的最大盈利","frequency":0.0,"frontendQuestionId":"2008","leaf":true,"level":2,"nodeType":"def","questionId":"2118","status":"","submitted":5030,"title":"出租车的最大盈利","titleSlug":"maximum-earnings-from-taxi"},{"acceptance":0.41567398119122256,"acs":1326,"articleLive":2,"columnArticles":39,"formTitle":"[2009]使数组连续的最少操作数","frequency":0.0,"frontendQuestionId":"2009","leaf":true,"level":3,"nodeType":"def","questionId":"2119","status":"","submitted":3190,"title":"使数组连续的最少操作数","titleSlug":"minimum-number-of-operations-to-make-array-continuous"},{"acceptance":0.6320754716981132,"acs":67,"articleLive":2,"columnArticles":4,"formTitle":"[2010]The Number of Seniors and Juniors to Join the Company II","frequency":0.0,"frontendQuestionId":"2010","leaf":true,"level":3,"nodeType":"def","questionId":"2158","status":"lock","submitted":106,"title":"The Number of Seniors and Juniors to Join the Company II","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company-ii"},{"acceptance":0.9041095890410958,"acs":6600,"articleLive":2,"columnArticles":57,"formTitle":"[2011]执行操作后的变量值","frequency":0.0,"frontendQuestionId":"2011","leaf":true,"level":1,"nodeType":"def","questionId":"2137","status":"ac","submitted":7300,"title":"执行操作后的变量值","titleSlug":"final-value-of-variable-after-performing-operations"},{"acceptance":0.35701353564962496,"acs":4141,"articleLive":2,"columnArticles":73,"formTitle":"[2012]数组美丽值求和","frequency":0.0,"frontendQuestionId":"2012","leaf":true,"level":2,"nodeType":"def","questionId":"2138","status":"ac","submitted":11599,"title":"数组美丽值求和","titleSlug":"sum-of-beauty-in-the-array"},{"acceptance":0.32910331617382976,"acs":2749,"articleLive":2,"columnArticles":50,"formTitle":"[2013]检测正方形","frequency":0.0,"frontendQuestionId":"2013","leaf":true,"level":2,"nodeType":"def","questionId":"2139","status":"ac","submitted":8353,"title":"检测正方形","titleSlug":"detect-squares"},{"acceptance":0.5202828433196874,"acs":1398,"articleLive":2,"columnArticles":24,"formTitle":"[2014]重复 K 次的最长子序列","frequency":0.0,"frontendQuestionId":"2014","leaf":true,"level":3,"nodeType":"def","questionId":"2140","status":"","submitted":2687,"title":"重复 K 次的最长子序列","titleSlug":"longest-subsequence-repeated-k-times"},{"acceptance":0.7843137254901961,"acs":40,"articleLive":2,"columnArticles":3,"formTitle":"[2015]Average Height of Buildings in Each Segment","frequency":0.0,"frontendQuestionId":"2015","leaf":true,"level":2,"nodeType":"def","questionId":"2142","status":"lock","submitted":51,"title":"Average Height of Buildings in Each Segment","titleSlug":"average-height-of-buildings-in-each-segment"},{"acceptance":0.5520568816658202,"acs":5435,"articleLive":2,"columnArticles":71,"formTitle":"[2016]增量元素之间的最大差值","frequency":0.0,"frontendQuestionId":"2016","leaf":true,"level":1,"nodeType":"def","questionId":"2144","status":"ac","submitted":9845,"title":"增量元素之间的最大差值","titleSlug":"maximum-difference-between-increasing-elements"},{"acceptance":0.3478818998716303,"acs":3523,"articleLive":2,"columnArticles":94,"formTitle":"[2017]网格游戏","frequency":0.0,"frontendQuestionId":"2017","leaf":true,"level":2,"nodeType":"def","questionId":"2145","status":"ac","submitted":10127,"title":"网格游戏","titleSlug":"grid-game"},{"acceptance":0.41032203028364256,"acs":1924,"articleLive":2,"columnArticles":49,"formTitle":"[2018]判断单词是否能放入填字游戏内","frequency":0.0,"frontendQuestionId":"2018","leaf":true,"level":2,"nodeType":"def","questionId":"2146","status":"","submitted":4689,"title":"判断单词是否能放入填字游戏内","titleSlug":"check-if-word-can-be-placed-in-crossword"},{"acceptance":0.34565434565434566,"acs":1038,"articleLive":2,"columnArticles":31,"formTitle":"[2019]解出数学表达式的学生分数","frequency":0.0,"frontendQuestionId":"2019","leaf":true,"level":3,"nodeType":"def","questionId":"2147","status":"","submitted":3003,"title":"解出数学表达式的学生分数","titleSlug":"the-score-of-students-solving-math-expression"},{"acceptance":0.79375,"acs":127,"articleLive":2,"columnArticles":6,"formTitle":"[2020]Number of Accounts That Did Not Stream","frequency":0.0,"frontendQuestionId":"2020","leaf":true,"level":2,"nodeType":"def","questionId":"2167","status":"lock","submitted":160,"title":"Number of Accounts That Did Not Stream","titleSlug":"number-of-accounts-that-did-not-stream"},{"acceptance":0.7741935483870968,"acs":48,"articleLive":2,"columnArticles":5,"formTitle":"[2021]Brightest Position on Street","frequency":0.0,"frontendQuestionId":"2021","leaf":true,"level":2,"nodeType":"def","questionId":"2075","status":"","submitted":62,"title":"Brightest Position on Street","titleSlug":"brightest-position-on-street"},{"acceptance":0.6571689081376795,"acs":2883,"articleLive":2,"columnArticles":35,"formTitle":"[2022]将一维数组转变成二维数组","frequency":0.0,"frontendQuestionId":"2022","leaf":true,"level":1,"nodeType":"def","questionId":"2132","status":"ac","submitted":4387,"title":"将一维数组转变成二维数组","titleSlug":"convert-1d-array-into-2d-array"},{"acceptance":0.7539281705948373,"acs":2687,"articleLive":2,"columnArticles":36,"formTitle":"[2023]连接后等于目标字符串的字符串对","frequency":0.0,"frontendQuestionId":"2023","leaf":true,"level":2,"nodeType":"def","questionId":"2133","status":"ac","submitted":3564,"title":"连接后等于目标字符串的字符串对","titleSlug":"number-of-pairs-of-strings-with-concatenation-equal-to-target"},{"acceptance":0.47800263968323803,"acs":2173,"articleLive":2,"columnArticles":55,"formTitle":"[2024]考试的最大困扰度","frequency":0.0,"frontendQuestionId":"2024","leaf":true,"level":2,"nodeType":"def","questionId":"2134","status":"","submitted":4546,"title":"考试的最大困扰度","titleSlug":"maximize-the-confusion-of-an-exam"},{"acceptance":0.2603287427809862,"acs":1172,"articleLive":2,"columnArticles":39,"formTitle":"[2025]分割数组的最多方案数","frequency":0.0,"frontendQuestionId":"2025","leaf":true,"level":3,"nodeType":"def","questionId":"2135","status":"","submitted":4502,"title":"分割数组的最多方案数","titleSlug":"maximum-number-of-ways-to-partition-an-array"},{"acceptance":0.9,"acs":189,"articleLive":2,"columnArticles":9,"formTitle":"[2026]Low-Quality Problems","frequency":0.0,"frontendQuestionId":"2026","leaf":true,"level":1,"nodeType":"def","questionId":"2172","status":"","submitted":210,"title":"Low-Quality Problems","titleSlug":"low-quality-problems"},{"acceptance":0.5504742107314539,"acs":4237,"articleLive":2,"columnArticles":44,"formTitle":"[2027]转换字符串的最少操作次数","frequency":0.0,"frontendQuestionId":"2027","leaf":true,"level":1,"nodeType":"def","questionId":"2154","status":"ac","submitted":7697,"title":"转换字符串的最少操作次数","titleSlug":"minimum-moves-to-convert-string"},{"acceptance":0.4234906695938529,"acs":3858,"articleLive":2,"columnArticles":55,"formTitle":"[2028]找出缺失的观测数据","frequency":0.0,"frontendQuestionId":"2028","leaf":true,"level":2,"nodeType":"def","questionId":"2155","status":"ac","submitted":9110,"title":"找出缺失的观测数据","titleSlug":"find-missing-observations"},{"acceptance":0.22237017310252996,"acs":2004,"articleLive":2,"columnArticles":67,"formTitle":"[2029]石子游戏 IX","frequency":0.0,"frontendQuestionId":"2029","leaf":true,"level":2,"nodeType":"def","questionId":"2156","status":"notac","submitted":9012,"title":"石子游戏 IX","titleSlug":"stone-game-ix"},{"acceptance":0.3424992361747632,"acs":1121,"articleLive":2,"columnArticles":38,"formTitle":"[2030]含特定字母的最小子序列","frequency":0.0,"frontendQuestionId":"2030","leaf":true,"level":3,"nodeType":"def","questionId":"2157","status":"","submitted":3273,"title":"含特定字母的最小子序列","titleSlug":"smallest-k-length-subsequence-with-occurrences-of-a-letter"},{"acceptance":0.6333333333333333,"acs":19,"articleLive":2,"columnArticles":2,"formTitle":"[2031]Count Subarrays With More Ones Than Zeros","frequency":0.0,"frontendQuestionId":"2031","leaf":true,"level":2,"nodeType":"def","questionId":"510","status":"","submitted":30,"title":"Count Subarrays With More Ones Than Zeros","titleSlug":"count-subarrays-with-more-ones-than-zeros"},{"acceptance":0.6610006027727546,"acs":5483,"articleLive":2,"columnArticles":87,"formTitle":"[2032]至少在两个数组中出现的值","frequency":0.0,"frontendQuestionId":"2032","leaf":true,"level":1,"nodeType":"def","questionId":"2159","status":"ac","submitted":8295,"title":"至少在两个数组中出现的值","titleSlug":"two-out-of-three"},{"acceptance":0.38463849389144805,"acs":3841,"articleLive":2,"columnArticles":77,"formTitle":"[2033]获取单值网格的最小操作数","frequency":0.0,"frontendQuestionId":"2033","leaf":true,"level":2,"nodeType":"def","questionId":"2160","status":"ac","submitted":9986,"title":"获取单值网格的最小操作数","titleSlug":"minimum-operations-to-make-a-uni-value-grid"},{"acceptance":0.3027236516309614,"acs":2812,"articleLive":2,"columnArticles":59,"formTitle":"[2034]股票价格波动","frequency":0.0,"frontendQuestionId":"2034","leaf":true,"level":2,"nodeType":"def","questionId":"2161","status":"ac","submitted":9289,"title":"股票价格波动","titleSlug":"stock-price-fluctuation"},{"acceptance":0.30837343599615014,"acs":1602,"articleLive":2,"columnArticles":41,"formTitle":"[2035]将数组分成两个数组并最小化数组和的差","frequency":0.0,"frontendQuestionId":"2035","leaf":true,"level":3,"nodeType":"def","questionId":"2162","status":"","submitted":5195,"title":"将数组分成两个数组并最小化数组和的差","titleSlug":"partition-array-into-two-arrays-to-minimize-sum-difference"},{"acceptance":0.46875,"acs":15,"articleLive":2,"columnArticles":3,"formTitle":"[2036]Maximum Alternating Subarray Sum","frequency":0.0,"frontendQuestionId":"2036","leaf":true,"level":2,"nodeType":"def","questionId":"512","status":"lock","submitted":32,"title":"Maximum Alternating Subarray Sum","titleSlug":"maximum-alternating-subarray-sum"},{"acceptance":0.5,"acs":24,"articleLive":2,"columnArticles":2,"formTitle":"[2041]Accepted Candidates From the Interviews","frequency":0.0,"frontendQuestionId":"2041","leaf":true,"level":2,"nodeType":"def","questionId":"2185","status":"lock","submitted":48,"title":"Accepted Candidates From the Interviews","titleSlug":"accepted-candidates-from-the-interviews"},{"acceptance":0.824105461393597,"acs":2188,"articleLive":2,"columnArticles":21,"formTitle":"[5885]使每位学生都有座位的最少移动次数","frequency":0.0,"frontendQuestionId":"5885","leaf":true,"level":1,"nodeType":"def","questionId":"2148","status":"ac","submitted":2655,"title":"使每位学生都有座位的最少移动次数","titleSlug":"minimum-number-of-moves-to-seat-everyone"},{"acceptance":0.4642197599261311,"acs":2011,"articleLive":2,"columnArticles":37,"formTitle":"[5886]如果相邻两个颜色均相同则删除当前颜色","frequency":0.0,"frontendQuestionId":"5886","leaf":true,"level":2,"nodeType":"def","questionId":"2149","status":"ac","submitted":4332,"title":"如果相邻两个颜色均相同则删除当前颜色","titleSlug":"remove-colored-pieces-if-both-neighbors-are-the-same-color"},{"acceptance":0.2522704339051463,"acs":500,"articleLive":2,"columnArticles":11,"formTitle":"[5887]两个有序数组的第 K 小乘积","frequency":0.0,"frontendQuestionId":"5887","leaf":true,"level":3,"nodeType":"def","questionId":"2150","status":"","submitted":1982,"title":"两个有序数组的第 K 小乘积","titleSlug":"kth-smallest-product-of-two-sorted-arrays"},{"acceptance":0.31486560614371917,"acs":1148,"articleLive":2,"columnArticles":24,"formTitle":"[5888]网络空闲的时刻","frequency":0.0,"frontendQuestionId":"5888","leaf":true,"level":2,"nodeType":"def","questionId":"2151","status":"ac","submitted":3646,"title":"网络空闲的时刻","titleSlug":"the-time-when-the-network-becomes-idle"},{"acceptance":0.7180650037792895,"acs":3800,"articleLive":2,"columnArticles":34,"formTitle":"[5902]检查句子中的数字是否递增","frequency":0.0,"frontendQuestionId":"5902","leaf":true,"level":1,"nodeType":"def","questionId":"2168","status":"ac","submitted":5292,"title":"检查句子中的数字是否递增","titleSlug":"check-if-numbers-are-ascending-in-a-sentence"},{"acceptance":0.5887883626042221,"acs":3319,"articleLive":2,"columnArticles":29,"formTitle":"[5903]简易银行系统","frequency":0.0,"frontendQuestionId":"5903","leaf":true,"level":2,"nodeType":"def","questionId":"2169","status":"ac","submitted":5637,"title":"简易银行系统","titleSlug":"simple-bank-system"},{"acceptance":0.7444187836797537,"acs":2901,"articleLive":2,"columnArticles":50,"formTitle":"[5904]统计按位或能得到最大值的子集数目","frequency":0.0,"frontendQuestionId":"5904","leaf":true,"level":2,"nodeType":"def","questionId":"2170","status":"ac","submitted":3897,"title":"统计按位或能得到最大值的子集数目","titleSlug":"count-number-of-maximum-bitwise-or-subsets"},{"acceptance":0.2785462435584486,"acs":1027,"articleLive":2,"columnArticles":25,"formTitle":"[5905]到达目的地的第二短时间","frequency":0.0,"frontendQuestionId":"5905","leaf":true,"level":3,"nodeType":"def","questionId":"2171","status":"ac","submitted":3687,"title":"到达目的地的第二短时间","titleSlug":"second-minimum-time-to-reach-destination"},{"acceptance":0.845217066023816,"acs":81342,"articleLive":2,"columnArticles":627,"formTitle":"[LCP 01]猜数字","frequency":0.0,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","submitted":96238,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.6911683208222077,"acs":13719,"articleLive":2,"columnArticles":237,"formTitle":"[LCP 02]分式化简","frequency":0.0,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","submitted":19849,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.21992797588757976,"acs":11237,"articleLive":2,"columnArticles":185,"formTitle":"[LCP 03]机器人大冒险","frequency":0.0,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","submitted":51094,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.3776071842410197,"acs":2607,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 04]覆盖","frequency":0.0,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","submitted":6904,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.19955654101995565,"acs":2070,"articleLive":2,"columnArticles":50,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","submitted":10373,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.839855266684535,"acs":43869,"articleLive":2,"columnArticles":660,"formTitle":"[LCP 06]拿硬币","frequency":0.0,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"1000056","status":"","submitted":52234,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.769182488623882,"acs":39216,"articleLive":2,"columnArticles":474,"formTitle":"[LCP 07]传递信息","frequency":0.0,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"1000063","status":"ac","submitted":50984,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.2889807006621767,"acs":5106,"articleLive":2,"columnArticles":103,"formTitle":"[LCP 08]剧情触发时间","frequency":0.0,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"1000057","status":"","submitted":17669,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.2757122566630462,"acs":6600,"articleLive":2,"columnArticles":108,"formTitle":"[LCP 09]最小跳跃次数","frequency":0.0,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"1000090","status":"","submitted":23938,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5896853713915018,"acs":1818,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 10]二叉树任务调度","frequency":0.0,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"1000062","status":"","submitted":3083,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.689851312244287,"acs":6913,"articleLive":2,"columnArticles":67,"formTitle":"[LCP 11]期望个数统计","frequency":0.0,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"1000086","status":"","submitted":10021,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.41149763396853817,"acs":6435,"articleLive":2,"columnArticles":102,"formTitle":"[LCP 12]小张刷题计划","frequency":0.0,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"1000087","status":"","submitted":15638,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6120773259197,"acs":9467,"articleLive":2,"columnArticles":84,"formTitle":"[LCP 13]寻宝","frequency":0.0,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"1000093","status":"","submitted":15467,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.21116092131705055,"acs":2732,"articleLive":2,"columnArticles":41,"formTitle":"[LCP 14]切分数组","frequency":0.0,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"1000059","status":"","submitted":12938,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5759197324414715,"acs":861,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 15]游乐园的迷宫","frequency":0.0,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"1000088","status":"","submitted":1495,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.31097560975609756,"acs":612,"articleLive":2,"columnArticles":15,"formTitle":"[LCP 16]游乐园的游览计划","frequency":0.0,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"1000085","status":"","submitted":1968,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7990647917647851,"acs":23753,"articleLive":2,"columnArticles":251,"formTitle":"[LCP 17]速算机器人","frequency":0.0,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"1000139","status":"","submitted":29726,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.2869073496004053,"acs":17555,"articleLive":2,"columnArticles":230,"formTitle":"[LCP 18]早餐组合","frequency":0.0,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"1000146","status":"ac","submitted":61187,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5162161453553918,"acs":19689,"articleLive":2,"columnArticles":205,"formTitle":"[LCP 19]秋叶收藏集","frequency":0.0,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"1000130","status":"","submitted":38141,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.31221640488656194,"acs":1789,"articleLive":2,"columnArticles":32,"formTitle":"[LCP 20]快速公交","frequency":0.0,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"1000133","status":"","submitted":5730,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.3358147229114971,"acs":812,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 21]追逐游戏","frequency":0.0,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"1000134","status":"","submitted":2418,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.3337172580345532,"acs":8982,"articleLive":2,"columnArticles":186,"formTitle":"[LCP 22]黑白方格画","frequency":0.0,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"1000140","status":"ac","submitted":26915,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.3388111439209141,"acs":2639,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 23]魔术排列","frequency":0.0,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"1000058","status":"","submitted":7789,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.28224068944290553,"acs":917,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"1000131","status":"","submitted":3249,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.33304843304843307,"acs":1169,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"1000138","status":"","submitted":3510,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.3355342136854742,"acs":559,"articleLive":2,"columnArticles":22,"formTitle":"[LCP 26]导航装置","frequency":0.0,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"1000132","status":"","submitted":1666,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.3285302593659942,"acs":1254,"articleLive":2,"columnArticles":25,"formTitle":"[LCP 27]黑盒光线反射","frequency":0.0,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"1000147","status":"","submitted":3817,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.2827491785323111,"acs":10326,"articleLive":2,"columnArticles":175,"formTitle":"[LCP 28]采购方案","frequency":0.0,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"1000215","status":"ac","submitted":36520,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.18688069033602692,"acs":5111,"articleLive":2,"columnArticles":124,"formTitle":"[LCP 29]乐团站位","frequency":0.0,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"1000216","status":"ac","submitted":27349,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.3499286998573997,"acs":5644,"articleLive":2,"columnArticles":98,"formTitle":"[LCP 30]魔塔游戏","frequency":0.0,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"1000224","status":"ac","submitted":16129,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.2528870048238562,"acs":1730,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 31]变换的迷宫","frequency":0.0,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"1000218","status":"","submitted":6841,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.4075355632449058,"acs":1060,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 32]批量处理任务","frequency":0.0,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"1000219","status":"","submitted":2601,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.21796886159120127,"acs":4578,"articleLive":2,"columnArticles":86,"formTitle":"[LCP 33]蓄水","frequency":0.0,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"1000221","status":"","submitted":21003,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.484860883797054,"acs":2370,"articleLive":2,"columnArticles":61,"formTitle":"[LCP 34]二叉树染色","frequency":0.0,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"1000089","status":"","submitted":4888,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.39558573853989815,"acs":1165,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 35]电动车游城市","frequency":0.0,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"1000220","status":"","submitted":2945,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.2645204115499502,"acs":797,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 36]最多牌组数","frequency":0.0,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"1000222","status":"notac","submitted":3013,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.19507952286282307,"acs":785,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 37]最小矩形面积","frequency":0.0,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"1000091","status":"","submitted":4024,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5633136094674556,"acs":476,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 38]守卫城堡","frequency":0.0,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"1000223","status":"","submitted":845,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5047466238801979,"acs":3775,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 39]无人机方阵","frequency":0.0,"frontendQuestionId":"LCP 39","leaf":true,"level":1,"nodeType":"def","questionId":"1000369","status":"ac","submitted":7479,"title":"无人机方阵","titleSlug":"0jQkd0"},{"acceptance":0.23186741056777158,"acs":2826,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 40]心算挑战","frequency":0.0,"frontendQuestionId":"LCP 40","leaf":true,"level":1,"nodeType":"def","questionId":"1000368","status":"ac","submitted":12188,"title":"心算挑战","titleSlug":"uOAnQW"},{"acceptance":0.4171261758027895,"acs":1286,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 41]黑白翻转棋","frequency":0.0,"frontendQuestionId":"LCP 41","leaf":true,"level":2,"nodeType":"def","questionId":"1000370","status":"","submitted":3083,"title":"黑白翻转棋","titleSlug":"fHi6rV"},{"acceptance":0.20023396373562097,"acs":1027,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 42]玩具套圈","frequency":0.0,"frontendQuestionId":"LCP 42","leaf":true,"level":3,"nodeType":"def","questionId":"1000371","status":"notac","submitted":5129,"title":"玩具套圈","titleSlug":"vFjcfV"},{"acceptance":0.3983739837398374,"acs":392,"articleLive":2,"columnArticles":17,"formTitle":"[LCP 43]十字路口的交通","frequency":0.0,"frontendQuestionId":"LCP 43","leaf":true,"level":3,"nodeType":"def","questionId":"1000367","status":"","submitted":984,"title":"十字路口的交通","titleSlug":"Y1VbOX"},{"acceptance":0.8492330714552937,"acs":2270,"articleLive":2,"columnArticles":27,"formTitle":"[LCP 44]开幕式焰火","frequency":0.0,"frontendQuestionId":"LCP 44","leaf":true,"level":1,"nodeType":"def","questionId":"1000362","status":"ac","submitted":2673,"title":"开幕式焰火","titleSlug":"sZ59z6"},{"acceptance":0.18673932788374206,"acs":1028,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 45]自行车炫技赛场","frequency":0.0,"frontendQuestionId":"LCP 45","leaf":true,"level":2,"nodeType":"def","questionId":"1000375","status":"notac","submitted":5505,"title":"自行车炫技赛场","titleSlug":"kplEvH"},{"acceptance":0.36982758620689654,"acs":858,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 46]志愿者调配","frequency":0.0,"frontendQuestionId":"LCP 46","leaf":true,"level":2,"nodeType":"def","questionId":"1000373","status":"notac","submitted":2320,"title":"志愿者调配","titleSlug":"05ZEDJ"},{"acceptance":0.3548680618744313,"acs":780,"articleLive":2,"columnArticles":14,"formTitle":"[LCP 47]入场安检","frequency":0.0,"frontendQuestionId":"LCP 47","leaf":true,"level":3,"nodeType":"def","questionId":"1000361","status":"","submitted":2198,"title":"入场安检","titleSlug":"oPs9Bm"},{"acceptance":0.1527231892195396,"acs":272,"articleLive":2,"columnArticles":9,"formTitle":"[LCP 48]无限棋局","frequency":0.0,"frontendQuestionId":"LCP 48","leaf":true,"level":3,"nodeType":"def","questionId":"1000374","status":"","submitted":1781,"title":"无限棋局","titleSlug":"fsa7oZ"},{"acceptance":0.2255456750202102,"acs":279,"articleLive":2,"columnArticles":9,"formTitle":"[LCP 49]环形闯关游戏","frequency":0.0,"frontendQuestionId":"LCP 49","leaf":true,"level":3,"nodeType":"def","questionId":"1000359","status":"","submitted":1237,"title":"环形闯关游戏","titleSlug":"K8GULz"},{"acceptance":0.5444730077120823,"acs":4236,"articleLive":2,"columnArticles":97,"formTitle":"[LCS 01]下载插件","frequency":0.0,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","questionId":"1000225","status":"","submitted":7780,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.6966720128307939,"acs":3475,"articleLive":2,"columnArticles":69,"formTitle":"[LCS 02]完成一半题目","frequency":0.0,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","questionId":"1000226","status":"","submitted":4988,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.41295938104448743,"acs":1708,"articleLive":2,"columnArticles":55,"formTitle":"[LCS 03]主题空间","frequency":0.0,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","questionId":"1000227","status":"","submitted":4136,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.6784321663184414,"acs":405562,"articleLive":2,"columnArticles":2808,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"100275","status":"","submitted":597793,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.40332068296740714,"acs":264728,"articleLive":2,"columnArticles":2110,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":0.0,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"100276","status":"","submitted":656371,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.760787899370412,"acs":291222,"articleLive":2,"columnArticles":1961,"formTitle":"[剑指 Offer 05]替换空格","frequency":0.0,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"100280","status":"","submitted":382790,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7512713687751829,"acs":307276,"articleLive":2,"columnArticles":2112,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"100282","status":"ac","submitted":409008,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6980955548327443,"acs":191015,"articleLive":2,"columnArticles":1454,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"100283","status":"","submitted":273623,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7151973333333334,"acs":268199,"articleLive":2,"columnArticles":1701,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":0.0,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"100273","status":"ac","submitted":375000,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.3600448001644837,"acs":266175,"articleLive":2,"columnArticles":1864,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"100274","status":"ac","submitted":739283,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.4439885528309298,"acs":197808,"articleLive":2,"columnArticles":1325,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":0.0,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"100277","status":"","submitted":445525,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.49295965893872207,"acs":265023,"articleLive":2,"columnArticles":1644,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"100278","status":"","submitted":537616,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.45222843159601867,"acs":172607,"articleLive":2,"columnArticles":1153,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"100279","status":"","submitted":381681,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5267980167936593,"acs":178928,"articleLive":2,"columnArticles":1721,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":0.0,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"100281","status":"","submitted":339652,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.5692976626865885,"acs":159343,"articleLive":2,"columnArticles":1324,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":0.0,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"100284","status":"","submitted":279894,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.3120611686302511,"acs":83912,"articleLive":2,"columnArticles":494,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"100285","status":"","submitted":268896,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7473268048483857,"acs":200936,"articleLive":2,"columnArticles":1260,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"100292","status":"ac","submitted":268873,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.33999641886282617,"acs":125322,"articleLive":2,"columnArticles":764,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":0.0,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"100295","status":"","submitted":368598,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.777313876849691,"acs":151549,"articleLive":2,"columnArticles":1135,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":0.0,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"100296","status":"","submitted":194965,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.5968315308639659,"acs":190890,"articleLive":2,"columnArticles":1474,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"100299","status":"ac","submitted":319839,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.3766633982350469,"acs":67225,"articleLive":2,"columnArticles":450,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":0.0,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"100297","status":"","submitted":178475,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.24222289527175764,"acs":77576,"articleLive":2,"columnArticles":864,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"100290","status":"","submitted":320267,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.6432117928506499,"acs":196004,"articleLive":2,"columnArticles":1648,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":0.0,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"100291","status":"","submitted":304727,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7981386587197752,"acs":263539,"articleLive":2,"columnArticles":2462,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"100294","status":"ac","submitted":330192,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7426838187410457,"acs":296518,"articleLive":2,"columnArticles":1853,"formTitle":"[剑指 Offer 24]反转链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"100298","status":"ac","submitted":399252,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.72821599346888,"acs":187319,"articleLive":2,"columnArticles":1197,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"100286","status":"","submitted":257230,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.4655149535249626,"acs":147342,"articleLive":2,"columnArticles":1192,"formTitle":"[剑指 Offer 26]树的子结构","frequency":0.0,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"100287","status":"","submitted":316514,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.791907939634423,"acs":193787,"articleLive":2,"columnArticles":1418,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":0.0,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"100288","status":"","submitted":244709,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5799814338705795,"acs":151820,"articleLive":2,"columnArticles":1093,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"100289","status":"","submitted":261767,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.4401157994210029,"acs":146706,"articleLive":2,"columnArticles":1489,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":0.0,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"100293","status":"","submitted":333335,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.5675883708966096,"acs":144529,"articleLive":2,"columnArticles":959,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":0.0,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"100302","status":"ac","submitted":254637,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6160218307575921,"acs":114001,"articleLive":2,"columnArticles":957,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"100306","status":"","submitted":185060,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.6441906313344008,"acs":139198,"articleLive":2,"columnArticles":964,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100311","status":"","submitted":216082,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.6864908437226461,"acs":138816,"articleLive":2,"columnArticles":1103,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100312","status":"","submitted":202211,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5886888215181659,"acs":121556,"articleLive":2,"columnArticles":1149,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"100314","status":"","submitted":206486,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.5514288194277007,"acs":114352,"articleLive":2,"columnArticles":959,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"100315","status":"","submitted":207374,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.577015620659444,"acs":135013,"articleLive":2,"columnArticles":876,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"100317","status":"","submitted":233985,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7201994276779656,"acs":122063,"articleLive":2,"columnArticles":839,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":0.0,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"100300","status":"ac","submitted":169485,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.654532839389922,"acs":105656,"articleLive":2,"columnArticles":911,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"100305","status":"","submitted":161422,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.5613479262672811,"acs":77960,"articleLive":2,"columnArticles":562,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"100307","status":"ac","submitted":138880,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5793104201001954,"acs":159231,"articleLive":2,"columnArticles":1120,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":0.0,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"100308","status":"ac","submitted":274863,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6911429965043493,"acs":170035,"articleLive":2,"columnArticles":1030,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"100310","status":"ac","submitted":246020,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.5702472550039703,"acs":249912,"articleLive":2,"columnArticles":1825,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":0.0,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"100301","status":"","submitted":438252,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.581609299791118,"acs":64041,"articleLive":2,"columnArticles":465,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":0.0,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"100303","status":"","submitted":110110,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.6053680645832601,"acs":223988,"articleLive":2,"columnArticles":1530,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":0.0,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"100304","status":"ac","submitted":370003,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.48626190569513583,"acs":49624,"articleLive":2,"columnArticles":514,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":0.0,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"100309","status":"","submitted":102052,"title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.41547944495069605,"acs":56081,"articleLive":2,"columnArticles":467,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"100313","status":"","submitted":134979,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5612208020930363,"acs":110258,"articleLive":2,"columnArticles":815,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":0.0,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"100323","status":"","submitted":196461,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.5355941493429283,"acs":121168,"articleLive":2,"columnArticles":1450,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"100325","status":"","submitted":226231,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.6889630957631439,"acs":120284,"articleLive":2,"columnArticles":1003,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":0.0,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"100327","status":"","submitted":174587,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.4646770766523091,"acs":152869,"articleLive":2,"columnArticles":1043,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"100332","status":"","submitted":328979,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.6514162019371882,"acs":88775,"articleLive":2,"columnArticles":520,"formTitle":"[剑指 Offer 49]丑数","frequency":0.0,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"100334","status":"","submitted":136280,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.6149138398565384,"acs":155334,"articleLive":2,"columnArticles":1062,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":0.0,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"100316","status":"","submitted":252611,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.48324644916689735,"acs":102989,"articleLive":2,"columnArticles":852,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":0.0,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"100318","status":"","submitted":213119,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.6501581736558922,"acs":176542,"articleLive":2,"columnArticles":1053,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"100326","status":"ac","submitted":271537,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5379023012610799,"acs":192370,"articleLive":2,"columnArticles":1601,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":0.0,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100329","status":"ac","submitted":357630,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.4473144914340293,"acs":170472,"articleLive":2,"columnArticles":1485,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100331","status":"","submitted":381101,"title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.7569386116315775,"acs":164018,"articleLive":2,"columnArticles":1152,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"100333","status":"","submitted":216686,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.7900093242771475,"acs":178772,"articleLive":2,"columnArticles":1277,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":0.0,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100319","status":"","submitted":226291,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.5883667760847074,"acs":138195,"articleLive":2,"columnArticles":942,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100342","status":"","submitted":234879,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.697424390595096,"acs":116246,"articleLive":2,"columnArticles":1040,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":0.0,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100320","status":"","submitted":166679,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.8005322185433371,"acs":91151,"articleLive":2,"columnArticles":704,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100321","status":"","submitted":113863,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.6661603201289955,"acs":135509,"articleLive":2,"columnArticles":849,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"100322","status":"","submitted":203418,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7073866068955096,"acs":140441,"articleLive":2,"columnArticles":1864,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100324","status":"","submitted":198535,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.44193869460330315,"acs":130984,"articleLive":2,"columnArticles":983,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":0.0,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100328","status":"","submitted":296385,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.8577912316467947,"acs":208276,"articleLive":2,"columnArticles":1807,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100330","status":"","submitted":242805,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.44424303457536085,"acs":132340,"articleLive":2,"columnArticles":1197,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"100336","status":"","submitted":297900,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.475123124441761,"acs":95218,"articleLive":2,"columnArticles":1072,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100337","status":"ac","submitted":200407,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.5614494409810761,"acs":65835,"articleLive":2,"columnArticles":596,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":0.0,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"100339","status":"","submitted":117259,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.4597564950796853,"acs":104373,"articleLive":2,"columnArticles":990,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":0.0,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"100341","status":"","submitted":227018,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.6552210779914025,"acs":110963,"articleLive":2,"columnArticles":770,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"100343","status":"","submitted":169352,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.634043185752442,"acs":132224,"articleLive":2,"columnArticles":958,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":0.0,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"100344","status":"","submitted":208541,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.8568079462027269,"acs":138880,"articleLive":2,"columnArticles":1303,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":0.0,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"100345","status":"","submitted":162090,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.5843966578146254,"acs":72180,"articleLive":2,"columnArticles":499,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":0.0,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"100335","status":"","submitted":123512,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.5978233522971668,"acs":73662,"articleLive":2,"columnArticles":531,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":0.0,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"100338","status":"","submitted":123217,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.28679611489428763,"acs":69154,"articleLive":2,"columnArticles":561,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":0.0,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"100340","status":"","submitted":241126,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.6942156468414272,"acs":119092,"articleLive":2,"columnArticles":693,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":0.0,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100346","status":"","submitted":171549,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.7007466973004021,"acs":118340,"articleLive":2,"columnArticles":694,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":0.0,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100347","status":"","submitted":168877,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.20503083862653043,"acs":8909,"articleLive":2,"columnArticles":114,"formTitle":"[剑指 Offer II 001]整数除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","questionId":"1000228","status":"","submitted":43452,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5717830556540234,"acs":8065,"articleLive":2,"columnArticles":128,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","questionId":"1000231","status":"","submitted":14105,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7821445149311466,"acs":10110,"articleLive":2,"columnArticles":152,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","questionId":"1000230","status":"","submitted":12926,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.6868535201868535,"acs":8234,"articleLive":2,"columnArticles":97,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","questionId":"1000233","status":"","submitted":11988,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7154576350638697,"acs":6105,"articleLive":2,"columnArticles":87,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","questionId":"1000236","status":"","submitted":8533,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6635760385419507,"acs":7300,"articleLive":2,"columnArticles":98,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","questionId":"1000237","status":"","submitted":11001,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.4540684301322599,"acs":6317,"articleLive":2,"columnArticles":77,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","questionId":"1000239","status":"","submitted":13912,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.5069360917328202,"acs":6322,"articleLive":2,"columnArticles":91,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","questionId":"1000242","status":"","submitted":12471,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.5500053596312574,"acs":5131,"articleLive":2,"columnArticles":80,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","questionId":"1000244","status":"","submitted":9329,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.4358496427461945,"acs":5612,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","questionId":"1000246","status":"","submitted":12876,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5632798573975044,"acs":4108,"articleLive":2,"columnArticles":71,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","questionId":"1000247","status":"","submitted":7293,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.661815295051601,"acs":5002,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":0.0,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","questionId":"1000248","status":"","submitted":7558,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6532729673646481,"acs":3463,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","questionId":"1000249","status":"","submitted":5301,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.503422920892495,"acs":3971,"articleLive":2,"columnArticles":69,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","questionId":"1000250","status":"","submitted":7888,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.6435803969218307,"acs":3178,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","questionId":"1000251","status":"","submitted":4938,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.500765540471573,"acs":4906,"articleLive":2,"columnArticles":81,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","questionId":"1000252","status":"","submitted":9797,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.5190066857688634,"acs":2717,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","questionId":"1000253","status":"","submitted":5235,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5281841896336622,"acs":4657,"articleLive":2,"columnArticles":72,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","questionId":"1000254","status":"","submitted":8817,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.47391826923076924,"acs":3943,"articleLive":2,"columnArticles":68,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","questionId":"1000255","status":"","submitted":8320,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.707603395340437,"acs":3918,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","questionId":"1000256","status":"","submitted":5537,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5371992255923297,"acs":5827,"articleLive":2,"columnArticles":77,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","questionId":"1000257","status":"","submitted":10847,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5232952792348041,"acs":6784,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","questionId":"1000258","status":"","submitted":12964,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.7029760184917654,"acs":4866,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","questionId":"1000259","status":"","submitted":6922,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7704590818363274,"acs":12738,"articleLive":2,"columnArticles":127,"formTitle":"[剑指 Offer II 024]反转链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","questionId":"1000260","status":"","submitted":16533,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6062876450712502,"acs":4127,"articleLive":2,"columnArticles":69,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":0.0,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","questionId":"1000261","status":"","submitted":6807,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.653572981591535,"acs":4509,"articleLive":2,"columnArticles":85,"formTitle":"[剑指 Offer II 026]重排链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","questionId":"1000262","status":"","submitted":6899,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6120544048359854,"acs":6885,"articleLive":2,"columnArticles":90,"formTitle":"[剑指 Offer II 027]回文链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","questionId":"1000263","status":"","submitted":11249,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6274734728993404,"acs":2188,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","questionId":"1000264","status":"","submitted":3487,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.2958235221217003,"acs":2387,"articleLive":2,"columnArticles":68,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","questionId":"1000265","status":"","submitted":8069,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.549618320610687,"acs":2160,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","questionId":"1000267","status":"","submitted":3930,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.5592386655260907,"acs":2615,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","questionId":"1000270","status":"","submitted":4676,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.6014427412082958,"acs":3335,"articleLive":2,"columnArticles":60,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","questionId":"1000273","status":"","submitted":5545,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.789458010720667,"acs":2651,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 033]变位词组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","questionId":"1000275","status":"","submitted":3358,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.5739630783984656,"acs":2394,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","questionId":"1000276","status":"","submitted":4171,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.6836204539239814,"acs":2500,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.0,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","questionId":"1000278","status":"","submitted":3657,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.5841392649903289,"acs":2718,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.0,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","questionId":"1000279","status":"","submitted":4653,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.4427083333333333,"acs":2975,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","questionId":"1000281","status":"","submitted":6720,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.7832523199292974,"acs":3545,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.0,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","questionId":"1000282","status":"","submitted":4526,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.5167261373773416,"acs":2317,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","questionId":"1000283","status":"","submitted":4484,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.5770516152989231,"acs":1554,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":0.0,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","questionId":"1000284","status":"","submitted":2693,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.780295566502463,"acs":3168,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","questionId":"1000292","status":"","submitted":4060,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.843850611719253,"acs":2621,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","questionId":"1000293","status":"","submitted":3106,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.6571976967370442,"acs":1712,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","questionId":"1000295","status":"","submitted":2605,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6470835081829627,"acs":3084,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","questionId":"1000297","status":"","submitted":4766,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.8096286107290234,"acs":2943,"articleLive":2,"columnArticles":74,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","questionId":"1000298","status":"","submitted":3635,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7298355520751761,"acs":2796,"articleLive":2,"columnArticles":60,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","questionId":"1000299","status":"","submitted":3831,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.6830643095055086,"acs":2666,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":0.0,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","questionId":"1000301","status":"","submitted":3903,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.6869565217391305,"acs":1738,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","questionId":"1000304","status":"","submitted":2530,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7537728355837967,"acs":2847,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","questionId":"1000306","status":"","submitted":3777,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6192225283134374,"acs":2023,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","questionId":"1000307","status":"","submitted":3267,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.4146576663452266,"acs":1720,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","questionId":"1000309","status":"","submitted":4148,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.7437756828619773,"acs":3077,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","questionId":"1000311","status":"","submitted":4137,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6379076086956522,"acs":2817,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","questionId":"1000313","status":"","submitted":4416,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8507408745934225,"acs":2354,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","questionId":"1000315","status":"","submitted":2767,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.8928251121076233,"acs":1991,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","questionId":"1000316","status":"","submitted":2230,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7277917332724366,"acs":3187,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","questionId":"1000319","status":"","submitted":4379,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.35086767895878523,"acs":1294,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","questionId":"1000321","status":"","submitted":3688,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.6052380952380952,"acs":1271,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","questionId":"1000322","status":"","submitted":2100,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.6236006051437216,"acs":2061,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","questionId":"1000323","status":"","submitted":3305,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.6720660146699267,"acs":2199,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","questionId":"1000324","status":"","submitted":3272,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.5329255127743793,"acs":1481,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":0.0,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","questionId":"1000326","status":"","submitted":2779,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7662222222222222,"acs":1724,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","questionId":"1000325","status":"","submitted":2250,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.7263440860215054,"acs":1351,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","questionId":"1000327","status":"","submitted":1860,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.6376731301939058,"acs":1151,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","questionId":"1000328","status":"","submitted":1805,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.6350148367952523,"acs":1070,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.0,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","questionId":"1000329","status":"","submitted":1685,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6447445684086905,"acs":1098,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","questionId":"1000330","status":"","submitted":1703,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.663973063973064,"acs":986,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","questionId":"1000331","status":"","submitted":1485,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.5097863171125875,"acs":2839,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","questionId":"1000332","status":"","submitted":5569,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7236339105014616,"acs":35398,"articleLive":2,"columnArticles":378,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":0.0,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","questionId":"1000333","status":"ac","submitted":48917,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.6600780868716447,"acs":2705,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","questionId":"1000334","status":"","submitted":4098,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.4963269054178145,"acs":1081,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","questionId":"1000335","status":"","submitted":2178,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.42150688126895264,"acs":3614,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 072]求平方根","frequency":0.0,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","questionId":"1000336","status":"","submitted":8574,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.5410719949254678,"acs":1706,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.0,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","questionId":"1000337","status":"","submitted":3153,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.5538881309686221,"acs":2436,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 074]合并区间","frequency":0.0,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","questionId":"1000338","status":"","submitted":4398,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.710801393728223,"acs":2448,"articleLive":2,"columnArticles":60,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","questionId":"1000339","status":"","submitted":3444,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.6748895995127151,"acs":4432,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","questionId":"1000340","status":"","submitted":6567,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.588604755495738,"acs":3936,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","questionId":"1000341","status":"","submitted":6687,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6347648261758692,"acs":3104,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","questionId":"1000342","status":"","submitted":4890,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8580740740740741,"acs":2896,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 079]所有子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","questionId":"1000343","status":"","submitted":3375,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.8012332245194052,"acs":2209,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","questionId":"1000344","status":"","submitted":2757,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.7807631519530368,"acs":3458,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","questionId":"1000229","status":"","submitted":4429,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.6442425730419838,"acs":2624,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","questionId":"1000232","status":"","submitted":4073,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.854638619201726,"acs":3169,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","questionId":"1000234","status":"","submitted":3708,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6751592356687898,"acs":2544,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","questionId":"1000235","status":"","submitted":3768,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8562986838571045,"acs":3188,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":0.0,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","questionId":"1000238","status":"","submitted":3723,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7693761814744802,"acs":2035,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","questionId":"1000240","status":"","submitted":2645,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6390931372549019,"acs":2086,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","questionId":"1000241","status":"","submitted":3264,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7390408392656426,"acs":3945,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":0.0,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","questionId":"1000243","status":"","submitted":5338,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.6227621483375959,"acs":2435,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","questionId":"1000245","status":"","submitted":3910,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.516162669447341,"acs":1485,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","questionId":"1000266","status":"","submitted":2877,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7667953667953668,"acs":1986,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":0.0,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","questionId":"1000268","status":"","submitted":2590,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6838458207016024,"acs":1579,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.0,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","questionId":"1000269","status":"","submitted":2309,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5763948497854077,"acs":1343,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","questionId":"1000271","status":"","submitted":2330,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.5951882845188284,"acs":1138,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.0,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","questionId":"1000272","status":"","submitted":1912,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.6623361558983877,"acs":5710,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","questionId":"1000274","status":"","submitted":8621,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.4948051948051948,"acs":1143,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":0.0,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","questionId":"1000277","status":"","submitted":2310,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5482558139534883,"acs":943,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","questionId":"1000280","status":"","submitted":1720,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.7766497461928934,"acs":1989,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","questionId":"1000345","status":"","submitted":2561,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.6908287866978436,"acs":2659,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","questionId":"1000285","status":"","submitted":3849,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7398230088495575,"acs":1672,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","questionId":"1000286","status":"","submitted":2260,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.4854056538726729,"acs":2112,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 101]分割等和子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","questionId":"1000287","status":"","submitted":4351,"title":"分割等和子集","titleSlug":"NUPfPr"},{"acceptance":0.591688089117395,"acs":1381,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","questionId":"1000288","status":"","submitted":2334,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.49466791393826004,"acs":2644,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","questionId":"1000289","status":"","submitted":5345,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5895061728395061,"acs":1146,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","questionId":"1000290","status":"","submitted":1944,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.7001281503630927,"acs":3278,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","questionId":"1000291","status":"","submitted":4682,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.5577464788732395,"acs":990,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 106]二分图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","questionId":"1000294","status":"","submitted":1775,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.545016077170418,"acs":1017,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","questionId":"1000296","status":"","submitted":1866,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.5785046728971963,"acs":619,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","questionId":"1000300","status":"","submitted":1070,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.605641592920354,"acs":1095,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":0.0,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","questionId":"1000302","status":"","submitted":1808,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8401448525607863,"acs":1624,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","questionId":"1000303","status":"","submitted":1933,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.6977886977886978,"acs":568,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","questionId":"1000305","status":"","submitted":814,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.5611474584801208,"acs":1115,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","questionId":"1000308","status":"","submitted":1987,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.5838060856111398,"acs":1132,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","questionId":"1000310","status":"","submitted":1939,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.42787682333873583,"acs":528,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","questionId":"1000312","status":"","submitted":1234,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.29324324324324325,"acs":651,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 115]重建序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","questionId":"1000314","status":"","submitted":2220,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6353562904875554,"acs":3727,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 116]省份数量","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","questionId":"1000346","status":"","submitted":5866,"title":"省份数量","titleSlug":"bLyHh0"},{"acceptance":0.6307996051332675,"acs":639,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","questionId":"1000317","status":"","submitted":1013,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.704602510460251,"acs":842,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","questionId":"1000318","status":"","submitted":1195,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.46102129021930527,"acs":2880,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","questionId":"1000320","status":"","submitted":6247,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.7197336947855206,"acs":90269,"articleLive":2,"columnArticles":1548,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":0.0,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"100158","status":"","submitted":125420,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6476950235748922,"acs":57970,"articleLive":2,"columnArticles":1111,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":0.0,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"100159","status":"","submitted":89502,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.5792871833589336,"acs":44502,"articleLive":2,"columnArticles":493,"formTitle":"[面试题 01.03]URL化","frequency":0.0,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"100160","status":"","submitted":76822,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5512329065057228,"acs":40552,"articleLive":2,"columnArticles":779,"formTitle":"[面试题 01.04]回文排列","frequency":0.0,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"100184","status":"","submitted":73566,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.3320575627679118,"acs":32535,"articleLive":2,"columnArticles":558,"formTitle":"[面试题 01.05]一次编辑","frequency":0.0,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000006","status":"","submitted":97980,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.471837624651297,"acs":73576,"articleLive":2,"columnArticles":1175,"formTitle":"[面试题 01.06]字符串压缩","frequency":0.0,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"100161","status":"","submitted":155935,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7529609860026116,"acs":65735,"articleLive":2,"columnArticles":962,"formTitle":"[面试题 01.07]旋转矩阵","frequency":0.0,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"100185","status":"","submitted":87302,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6216496308915389,"acs":43789,"articleLive":2,"columnArticles":492,"formTitle":"[面试题 01.08]零矩阵","frequency":0.0,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"100186","status":"","submitted":70440,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.54980616608156,"acs":33045,"articleLive":2,"columnArticles":417,"formTitle":"[面试题 01.09]字符串轮转","frequency":0.0,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"100162","status":"","submitted":60103,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.682511566991938,"acs":63578,"articleLive":2,"columnArticles":693,"formTitle":"[面试题 02.01]移除重复节点","frequency":0.0,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"100163","status":"ac","submitted":93153,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7797417860000717,"acs":65287,"articleLive":2,"columnArticles":949,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":0.0,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","questionId":"1000007","status":"ac","submitted":83729,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.8548715809546511,"acs":71728,"articleLive":2,"columnArticles":684,"formTitle":"[面试题 02.03]删除中间节点","frequency":0.0,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"100187","status":"ac","submitted":83905,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6544386624761709,"acs":25404,"articleLive":2,"columnArticles":362,"formTitle":"[面试题 02.04]分割链表","frequency":0.0,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"1000008","status":"ac","submitted":38818,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.4664290482247887,"acs":37034,"articleLive":2,"columnArticles":524,"formTitle":"[面试题 02.05]链表求和","frequency":0.0,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"100188","status":"ac","submitted":79399,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.4834086000392696,"acs":39392,"articleLive":2,"columnArticles":508,"formTitle":"[面试题 02.06]回文链表","frequency":0.0,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"100164","status":"ac","submitted":81488,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6850435911181333,"acs":48560,"articleLive":2,"columnArticles":434,"formTitle":"[面试题 02.07]链表相交","frequency":0.0,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","questionId":"100167","status":"ac","submitted":70886,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5322120146833181,"acs":27402,"articleLive":2,"columnArticles":285,"formTitle":"[面试题 02.08]环路检测","frequency":0.0,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"100168","status":"ac","submitted":51487,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5376020209871745,"acs":11066,"articleLive":2,"columnArticles":178,"formTitle":"[面试题 03.01]三合一","frequency":0.0,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"100172","status":"","submitted":20584,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.613858580133201,"acs":25992,"articleLive":2,"columnArticles":299,"formTitle":"[面试题 03.02]栈的最小值","frequency":0.0,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"100169","status":"ac","submitted":42342,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.3871443722045465,"acs":8396,"articleLive":2,"columnArticles":127,"formTitle":"[面试题 03.03]堆盘子","frequency":0.0,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"100195","status":"","submitted":21687,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7126105052100739,"acs":23457,"articleLive":2,"columnArticles":343,"formTitle":"[面试题 03.04]化栈为队","frequency":0.0,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"100170","status":"ac","submitted":32917,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5432903658445719,"acs":14583,"articleLive":2,"columnArticles":195,"formTitle":"[面试题 03.05]栈排序","frequency":0.0,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"100173","status":"","submitted":26842,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.587904055444258,"acs":10858,"articleLive":2,"columnArticles":178,"formTitle":"[面试题 03.06]动物收容所","frequency":0.0,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"100228","status":"","submitted":18469,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5317898272552783,"acs":17732,"articleLive":2,"columnArticles":245,"formTitle":"[面试题 04.01]节点间通路","frequency":0.0,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"100171","status":"","submitted":33344,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7902417922681116,"acs":34709,"articleLive":2,"columnArticles":422,"formTitle":"[面试题 04.02]最小高度树","frequency":0.0,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"100174","status":"","submitted":43922,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8063888981999799,"acs":24057,"articleLive":2,"columnArticles":523,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":0.0,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"100175","status":"","submitted":29833,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5846783440052213,"acs":33146,"articleLive":2,"columnArticles":385,"formTitle":"[面试题 04.04]检查平衡性","frequency":0.0,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"100176","status":"","submitted":56691,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.3517184492713775,"acs":25584,"articleLive":2,"columnArticles":323,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":0.0,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"100177","status":"","submitted":72740,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5905297373275937,"acs":20166,"articleLive":2,"columnArticles":241,"formTitle":"[面试题 04.06]后继者","frequency":0.0,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"100178","status":"","submitted":34149,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7168906771680507,"acs":16748,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 04.08]首个共同祖先","frequency":0.0,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"100179","status":"","submitted":23362,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.47618708113503494,"acs":6679,"articleLive":2,"columnArticles":110,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":0.0,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"1000010","status":"","submitted":14026,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7164697096164829,"acs":16309,"articleLive":2,"columnArticles":254,"formTitle":"[面试题 04.10]检查子树","frequency":0.0,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"100229","status":"","submitted":22763,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.48635863586358635,"acs":17684,"articleLive":2,"columnArticles":258,"formTitle":"[面试题 04.12]求和路径","frequency":0.0,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"1000009","status":"","submitted":36360,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5049241416023423,"acs":9485,"articleLive":2,"columnArticles":185,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"100180","status":"","submitted":18785,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6900303192438024,"acs":7738,"articleLive":2,"columnArticles":126,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":0.0,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"100203","status":"","submitted":11214,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.38686908097754763,"acs":10907,"articleLive":2,"columnArticles":233,"formTitle":"[面试题 05.03]翻转数位","frequency":0.0,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"100230","status":"","submitted":28193,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.38595215589325965,"acs":5308,"articleLive":2,"columnArticles":137,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"100183","status":"","submitted":13753,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.5273063729915147,"acs":11683,"articleLive":2,"columnArticles":229,"formTitle":"[面试题 05.06]整数转换","frequency":0.0,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"100181","status":"","submitted":22156,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.704227952489384,"acs":11443,"articleLive":2,"columnArticles":204,"formTitle":"[面试题 05.07]配对交换","frequency":0.0,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"100182","status":"","submitted":16249,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5535353535353535,"acs":3562,"articleLive":2,"columnArticles":71,"formTitle":"[面试题 05.08]绘制直线","frequency":0.0,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"100196","status":"","submitted":6435,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.363242831123724,"acs":42879,"articleLive":2,"columnArticles":475,"formTitle":"[面试题 08.01]三步问题","frequency":0.0,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"100197","status":"","submitted":118045,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.3608842043624652,"acs":12326,"articleLive":2,"columnArticles":198,"formTitle":"[面试题 08.02]迷路的机器人","frequency":0.0,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000011","status":"","submitted":34155,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.675826601906444,"acs":52040,"articleLive":2,"columnArticles":434,"formTitle":"[面试题 08.03]魔术索引","frequency":0.0,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"100240","status":"","submitted":77002,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.819920535992521,"acs":21049,"articleLive":2,"columnArticles":331,"formTitle":"[面试题 08.04]幂集","frequency":0.0,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"100198","status":"","submitted":25672,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.6793349906774394,"acs":21861,"articleLive":2,"columnArticles":489,"formTitle":"[面试题 08.05]递归乘法","frequency":0.0,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"100199","status":"","submitted":32180,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6564845903966369,"acs":24049,"articleLive":2,"columnArticles":267,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":0.0,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"1000015","status":"","submitted":36633,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.8133715233285596,"acs":21582,"articleLive":2,"columnArticles":316,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":0.0,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"100241","status":"","submitted":26534,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.7185072683879367,"acs":16558,"articleLive":2,"columnArticles":238,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":0.0,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"100348","status":"ac","submitted":23045,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8134386472355101,"acs":21936,"articleLive":2,"columnArticles":351,"formTitle":"[面试题 08.09]括号","frequency":0.0,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"100200","status":"","submitted":26967,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5582846952010376,"acs":13774,"articleLive":2,"columnArticles":218,"formTitle":"[面试题 08.10]颜色填充","frequency":0.0,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"100201","status":"","submitted":24672,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.4947035893868916,"acs":34139,"articleLive":2,"columnArticles":328,"formTitle":"[面试题 08.11]硬币","frequency":0.0,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"100231","status":"","submitted":69009,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.7610182542917969,"acs":16801,"articleLive":2,"columnArticles":297,"formTitle":"[面试题 08.12]八皇后","frequency":0.0,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"100233","status":"","submitted":22077,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5013850415512465,"acs":6878,"articleLive":2,"columnArticles":89,"formTitle":"[面试题 08.13]堆箱子","frequency":0.0,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"100202","status":"","submitted":13718,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5337587747287811,"acs":4182,"articleLive":2,"columnArticles":75,"formTitle":"[面试题 08.14]布尔运算","frequency":0.0,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000031","status":"ac","submitted":7835,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.554952192130014,"acs":56821,"articleLive":2,"columnArticles":2374,"formTitle":"[面试题 10.01]合并排序的数组","frequency":0.0,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000012","status":"","submitted":102389,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7397099844558482,"acs":34739,"articleLive":2,"columnArticles":427,"formTitle":"[面试题 10.02]变位词组","frequency":0.0,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000040","status":"ac","submitted":46963,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.39495623794689216,"acs":13312,"articleLive":2,"columnArticles":208,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":0.0,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"100232","status":"","submitted":33705,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.5537089121850053,"acs":19490,"articleLive":2,"columnArticles":256,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":0.0,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"100242","status":"","submitted":35199,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.454953700480401,"acs":13069,"articleLive":2,"columnArticles":175,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":0.0,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000016","status":"","submitted":28726,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6234253551326722,"acs":4652,"articleLive":2,"columnArticles":86,"formTitle":"[面试题 10.10]数字流的秩","frequency":0.0,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"1000041","status":"","submitted":7462,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6674126355655018,"acs":7754,"articleLive":2,"columnArticles":96,"formTitle":"[面试题 10.11]峰与谷","frequency":0.0,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000013","status":"","submitted":11618,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8318226279752201,"acs":25512,"articleLive":2,"columnArticles":407,"formTitle":"[面试题 16.01]交换数字","frequency":0.0,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"100258","status":"","submitted":30670,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7660111202635914,"acs":14879,"articleLive":2,"columnArticles":195,"formTitle":"[面试题 16.02]单词频率","frequency":0.0,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"100259","status":"","submitted":19424,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.44206502717141016,"acs":9599,"articleLive":2,"columnArticles":233,"formTitle":"[面试题 16.03]交点","frequency":0.0,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"100260","status":"","submitted":21714,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.46008523630812287,"acs":7233,"articleLive":2,"columnArticles":160,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"100261","status":"","submitted":15721,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.4640749294328971,"acs":10851,"articleLive":2,"columnArticles":128,"formTitle":"[面试题 16.05]阶乘尾数","frequency":0.0,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"1000017","status":"","submitted":23382,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.4244486079610821,"acs":12913,"articleLive":2,"columnArticles":189,"formTitle":"[面试题 16.06]最小差","frequency":0.0,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"100262","status":"","submitted":30423,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7329340426323425,"acs":19702,"articleLive":2,"columnArticles":290,"formTitle":"[面试题 16.07]最大数值","frequency":0.0,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"100349","status":"","submitted":26881,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.3733419605305726,"acs":2308,"articleLive":2,"columnArticles":64,"formTitle":"[面试题 16.08]整数的英语表示","frequency":0.0,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"1000018","status":"","submitted":6182,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5478763508419201,"acs":2180,"articleLive":2,"columnArticles":39,"formTitle":"[面试题 16.09]运算","frequency":0.0,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"100350","status":"","submitted":3979,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6803294763679153,"acs":10407,"articleLive":2,"columnArticles":195,"formTitle":"[面试题 16.10]生存人数","frequency":0.0,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"100351","status":"","submitted":15297,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.44107111654726544,"acs":50485,"articleLive":2,"columnArticles":584,"formTitle":"[面试题 16.11]跳水板","frequency":0.0,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"100352","status":"","submitted":114460,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.4297145328719723,"acs":1987,"articleLive":2,"columnArticles":54,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"100353","status":"","submitted":4624,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.5496880231319434,"acs":3612,"articleLive":2,"columnArticles":61,"formTitle":"[面试题 16.14]最佳直线","frequency":0.0,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"100354","status":"","submitted":6571,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.5032887402452619,"acs":9029,"articleLive":2,"columnArticles":227,"formTitle":"[面试题 16.15]珠玑妙算","frequency":0.0,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"100355","status":"","submitted":17940,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.45371290857056784,"acs":15061,"articleLive":2,"columnArticles":213,"formTitle":"[面试题 16.16]部分排序","frequency":0.0,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"100356","status":"","submitted":33195,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.6004499437570304,"acs":34697,"articleLive":2,"columnArticles":376,"formTitle":"[面试题 16.17]连续数列","frequency":0.0,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"1000003","status":"","submitted":57785,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.34405755786330006,"acs":15207,"articleLive":2,"columnArticles":314,"formTitle":"[面试题 16.18]模式匹配","frequency":0.0,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000004","status":"","submitted":44199,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.6113930853287156,"acs":20478,"articleLive":2,"columnArticles":362,"formTitle":"[面试题 16.19]水域大小","frequency":0.0,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"1000005","status":"","submitted":33494,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7219920383459257,"acs":8887,"articleLive":2,"columnArticles":174,"formTitle":"[面试题 16.20]T9键盘","frequency":0.0,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"1000047","status":"","submitted":12309,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.4648085312651478,"acs":9589,"articleLive":2,"columnArticles":180,"formTitle":"[面试题 16.21]交换和","frequency":0.0,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"1000048","status":"","submitted":20630,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5842385516506923,"acs":2743,"articleLive":2,"columnArticles":60,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":0.0,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000050","status":"","submitted":4695,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.4722909343401467,"acs":10883,"articleLive":2,"columnArticles":164,"formTitle":"[面试题 16.24]数对和","frequency":0.0,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"1000042","status":"","submitted":23043,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5457611606386225,"acs":32201,"articleLive":2,"columnArticles":259,"formTitle":"[面试题 16.25]LRU 缓存","frequency":0.0,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"1000026","status":"","submitted":59002,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.3880845003560408,"acs":14715,"articleLive":2,"columnArticles":206,"formTitle":"[面试题 16.26]计算器","frequency":0.0,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"1000027","status":"","submitted":37917,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.5970062490917017,"acs":12324,"articleLive":2,"columnArticles":172,"formTitle":"[面试题 17.01]不用加号的加法","frequency":0.0,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000025","status":"","submitted":20643,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6419943342776204,"acs":28328,"articleLive":2,"columnArticles":458,"formTitle":"[面试题 17.04]消失的数字","frequency":0.0,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"1000032","status":"","submitted":44125,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.38767046253338955,"acs":5515,"articleLive":2,"columnArticles":96,"formTitle":"[面试题 17.05] 字母与数字","frequency":0.0,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000033","status":"","submitted":14226,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.44985645933014357,"acs":4701,"articleLive":2,"columnArticles":110,"formTitle":"[面试题 17.06]2出现的次数","frequency":0.0,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","questionId":"1000034","status":"","submitted":10450,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.41201294134196087,"acs":8787,"articleLive":2,"columnArticles":217,"formTitle":"[面试题 17.07]婴儿名字","frequency":0.0,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"1000035","status":"","submitted":21327,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.27183835233732906,"acs":8368,"articleLive":2,"columnArticles":123,"formTitle":"[面试题 17.08]马戏团人塔","frequency":0.0,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"1000036","status":"","submitted":30783,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5486921139314086,"acs":14159,"articleLive":2,"columnArticles":148,"formTitle":"[面试题 17.09]第 k 个数","frequency":0.0,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000037","status":"","submitted":25805,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5705095432856169,"acs":66955,"articleLive":2,"columnArticles":929,"formTitle":"[面试题 17.10]主要元素","frequency":0.0,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"1000038","status":"ac","submitted":117360,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6870178427753325,"acs":14516,"articleLive":2,"columnArticles":264,"formTitle":"[面试题 17.11]单词距离","frequency":0.0,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000039","status":"","submitted":21129,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.6323702563173625,"acs":20946,"articleLive":2,"columnArticles":293,"formTitle":"[面试题 17.12]BiNode","frequency":0.0,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"1000019","status":"","submitted":33123,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5527165142549758,"acs":24660,"articleLive":2,"columnArticles":272,"formTitle":"[面试题 17.13]恢复空格","frequency":0.0,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"1000020","status":"","submitted":44616,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5969401925688187,"acs":77373,"articleLive":2,"columnArticles":761,"formTitle":"[面试题 17.14]最小K个数","frequency":0.0,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000021","status":"ac","submitted":129616,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.4029219006007646,"acs":5902,"articleLive":2,"columnArticles":121,"formTitle":"[面试题 17.15]最长单词","frequency":0.0,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"1000022","status":"","submitted":14648,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5185062789160608,"acs":61191,"articleLive":2,"columnArticles":1141,"formTitle":"[面试题 17.16]按摩师","frequency":0.0,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"1000023","status":"","submitted":118014,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.4450821955976595,"acs":7987,"articleLive":2,"columnArticles":181,"formTitle":"[面试题 17.17]多次搜索","frequency":0.0,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"1000024","status":"","submitted":17945,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.44573643410852715,"acs":7245,"articleLive":2,"columnArticles":121,"formTitle":"[面试题 17.18]最短超串","frequency":0.0,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000043","status":"","submitted":16254,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5789018302828619,"acs":8698,"articleLive":2,"columnArticles":183,"formTitle":"[面试题 17.19]消失的两个数字","frequency":0.0,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"1000044","status":"","submitted":15025,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5708684286959047,"acs":3931,"articleLive":2,"columnArticles":69,"formTitle":"[面试题 17.20]连续中值","frequency":0.0,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"1000028","status":"","submitted":6886,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.6359005909032378,"acs":44445,"articleLive":2,"columnArticles":537,"formTitle":"[面试题 17.21]直方图的水量","frequency":0.0,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"1000029","status":"","submitted":69893,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.37530593299012577,"acs":8894,"articleLive":2,"columnArticles":154,"formTitle":"[面试题 17.22]单词转换","frequency":0.0,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000030","status":"","submitted":23698,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.378123448618236,"acs":4570,"articleLive":2,"columnArticles":101,"formTitle":"[面试题 17.23]最大黑方阵","frequency":0.0,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"1000045","status":"","submitted":12086,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5249356345952131,"acs":11010,"articleLive":2,"columnArticles":120,"formTitle":"[面试题 17.24]最大子矩阵","frequency":0.0,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"1000046","status":"","submitted":20974,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.5022236340533672,"acs":1581,"articleLive":2,"columnArticles":39,"formTitle":"[面试题 17.25]单词矩阵","frequency":0.0,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"1000049","status":"","submitted":3148,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.34300791556728233,"acs":3510,"articleLive":2,"columnArticles":56,"formTitle":"[面试题 17.26]稀疏相似度","frequency":0.0,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"1000051","status":"","submitted":10233,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}]
\ No newline at end of file