diff --git a/src/main/java/leetcode/editor/cn/Convert1dArrayInto2dArray.java b/src/main/java/leetcode/editor/cn/Convert1dArrayInto2dArray.java new file mode 100644 index 0000000..af51ee2 --- /dev/null +++ b/src/main/java/leetcode/editor/cn/Convert1dArrayInto2dArray.java @@ -0,0 +1,87 @@ +//给你一个下标从 0 开始的一维整数数组 original 和两个整数 m 和 n 。你需要使用 original 中 所有 元素创建一个 m 行 n 列的二 +//维数组。 +// +// original 中下标从 0 到 n - 1 (都 包含 )的元素构成二维数组的第一行,下标从 n 到 2 * n - 1 (都 包含 )的元素构成二维 +//数组的第二行,依此类推。 +// +// 请你根据上述过程返回一个 m x n 的二维数组。如果无法构成这样的二维数组,请你返回一个空的二维数组。 +// +// +// +// 示例 1: +// +// 输入:original = [1,2,3,4], m = 2, n = 2 +//输出:[[1,2],[3,4]] +//解释: +//构造出的二维数组应该包含 2 行 2 列。 +//original 中第一个 n=2 的部分为 [1,2] ,构成二维数组的第一行。 +//original 中第二个 n=2 的部分为 [3,4] ,构成二维数组的第二行。 +// +// +// 示例 2: +// +// 输入:original = [1,2,3], m = 1, n = 3 +//输出:[[1,2,3]] +//解释: +//构造出的二维数组应该包含 1 行 3 列。 +//将 original 中所有三个元素放入第一行中,构成要求的二维数组。 +// +// +// 示例 3: +// +// 输入:original = [1,2], m = 1, n = 1 +//输出:[] +//解释: +//original 中有 2 个元素。 +//无法将 2 个元素放入到一个 1x1 的二维数组中,所以返回一个空的二维数组。 +// +// +// 示例 4: +// +// 输入:original = [3], m = 1, n = 2 +//输出:[] +//解释: +//original 中只有 1 个元素。 +//无法将 1 个元素放满一个 1x2 的二维数组,所以返回一个空的二维数组。 +// +// +// +// +// 提示: +// +// +// 1 <= original.length <= 5 * 10⁴ +// 1 <= original[i] <= 10⁵ +// 1 <= m, n <= 4 * 10⁴ +// +// Related Topics 数组 矩阵 模拟 👍 96 👎 0 + +package leetcode.editor.cn; + +import java.util.Arrays; + +//2022:将一维数组转变成二维数组 +class Convert1dArrayInto2dArray { + public static void main(String[] args) { + //测试代码 + Solution solution = new Convert1dArrayInto2dArray().new Solution(); + solution.construct2DArray(new int[]{1, 2}, 1, 1); + } + + //力扣代码 + //leetcode submit region begin(Prohibit modification and deletion) + class Solution { + public int[][] construct2DArray(int[] original, int m, int n) { + if (m * n != original.length) { + return new int[][]{}; + } + int[][] result = new int[m][n]; + for (int i = 0; i < m; i++) { + System.arraycopy(original, i * n, result[i], 0, n); + } + return result; + } + } +//leetcode submit region end(Prohibit modification and deletion) + +} \ No newline at end of file diff --git a/src/main/java/leetcode/editor/cn/doc/all.json b/src/main/java/leetcode/editor/cn/doc/all.json index 45b48f5..20258a5 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.6512472465321189,"acs":21878,"articleLive":2,"columnArticles":331,"formTitle":"[1078]Bigram 分词","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","submitted":33594,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.5222566480630335,"acs":2799797,"articleLive":2,"columnArticles":15323,"formTitle":"[1]两数之和","frequency":4.885299349,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"ac","submitted":5360960,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.4115259432577409,"acs":1107348,"articleLive":2,"columnArticles":7863,"formTitle":"[2]两数相加","frequency":4.8063625053,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"ac","submitted":2690834,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.38306653801633744,"acs":1391919,"articleLive":2,"columnArticles":8316,"formTitle":"[3]无重复字符的最长子串","frequency":4.6915318338,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"ac","submitted":3633622,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.4104972817968302,"acs":574321,"articleLive":2,"columnArticles":4287,"formTitle":"[4]寻找两个正序数组的中位数","frequency":4.7035927466,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"ac","submitted":1399086,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.35910722602184186,"acs":823509,"articleLive":2,"columnArticles":4476,"formTitle":"[5]最长回文子串","frequency":4.6520634119,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"ac","submitted":2293212,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5094406305079193,"acs":335863,"articleLive":2,"columnArticles":2730,"formTitle":"[6]Z 字形变换","frequency":3.8274037318,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"ac","submitted":659278,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.3507630502712995,"acs":916084,"articleLive":2,"columnArticles":5707,"formTitle":"[7]整数反转","frequency":4.7668940835,"frontendQuestionId":"7","leaf":true,"level":2,"nodeType":"def","questionId":"7","status":"ac","submitted":2611689,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.21732640635619846,"acs":381465,"articleLive":2,"columnArticles":2922,"formTitle":"[8]字符串转换整数 (atoi)","frequency":3.7086820633,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","submitted":1755263,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5809196379610975,"acs":848565,"articleLive":2,"columnArticles":5373,"formTitle":"[9]回文数","frequency":3.9425449318,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","submitted":1460727,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.3158365726503771,"acs":224821,"articleLive":2,"columnArticles":1352,"formTitle":"[10]正则表达式匹配","frequency":4.3512898759,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"ac","submitted":711827,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.6224791920427565,"acs":594345,"articleLive":2,"columnArticles":3369,"formTitle":"[11]盛最多水的容器","frequency":4.2716374121,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"ac","submitted":954803,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.6641378224543221,"acs":248881,"articleLive":2,"columnArticles":1943,"formTitle":"[12]整数转罗马数字","frequency":3.5447365102,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"ac","submitted":374743,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.6298596161871556,"acs":514669,"articleLive":2,"columnArticles":4211,"formTitle":"[13]罗马数字转整数","frequency":4.2172326078,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"ac","submitted":817117,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.41445273800923565,"acs":689014,"articleLive":2,"columnArticles":4308,"formTitle":"[14]最长公共前缀","frequency":4.6125949901,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"ac","submitted":1662467,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.3412430634465565,"acs":742966,"articleLive":2,"columnArticles":3488,"formTitle":"[15]三数之和","frequency":4.4312906627,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"ac","submitted":2177234,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.45825292802690154,"acs":287814,"articleLive":2,"columnArticles":1581,"formTitle":"[16]最接近的三数之和","frequency":4.2306442264,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","submitted":628068,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.5749817029463915,"acs":381026,"articleLive":2,"columnArticles":3442,"formTitle":"[17]电话号码的字母组合","frequency":3.656185352,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"ac","submitted":662675,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.3947218679172301,"acs":246953,"articleLive":2,"columnArticles":1704,"formTitle":"[18]四数之和","frequency":3.5202099309,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"ac","submitted":625638,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.4326281304274547,"acs":598082,"articleLive":2,"columnArticles":4453,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":3.6334208816,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"ac","submitted":1382439,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.4454889269442487,"acs":873553,"articleLive":2,"columnArticles":6174,"formTitle":"[20]有效的括号","frequency":4.4419267978,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"ac","submitted":1960886,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6669895111476707,"acs":804354,"articleLive":2,"columnArticles":3898,"formTitle":"[21]合并两个有序链表","frequency":4.1894430716,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"ac","submitted":1205947,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.7729409324315862,"acs":394979,"articleLive":2,"columnArticles":2952,"formTitle":"[22]括号生成","frequency":4.4659321113,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"ac","submitted":511008,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5621522108817293,"acs":364287,"articleLive":2,"columnArticles":2348,"formTitle":"[23]合并K个升序链表","frequency":3.8871160454,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"ac","submitted":648022,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.704478213021149,"acs":353355,"articleLive":2,"columnArticles":2799,"formTitle":"[24]两两交换链表中的节点","frequency":3.0704633129,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"ac","submitted":501584,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6585288188693297,"acs":256441,"articleLive":2,"columnArticles":2426,"formTitle":"[25]K 个一组翻转链表","frequency":4.231366869,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"ac","submitted":389415,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.53652240692239,"acs":908921,"articleLive":2,"columnArticles":5013,"formTitle":"[26]删除有序数组中的重复项","frequency":3.711451403,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"ac","submitted":1694097,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5959974724106172,"acs":544219,"articleLive":2,"columnArticles":4551,"formTitle":"[27]移除元素","frequency":3.5862756911,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"ac","submitted":913123,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.4031786568639223,"acs":523821,"articleLive":2,"columnArticles":3564,"formTitle":"[28]实现 strStr()","frequency":3.4187537404,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"ac","submitted":1299228,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.22034321629328932,"acs":139390,"articleLive":2,"columnArticles":1103,"formTitle":"[29]两数相除","frequency":3.4474150355,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"ac","submitted":632604,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.36190687781055475,"acs":87964,"articleLive":2,"columnArticles":678,"formTitle":"[30]串联所有单词的子串","frequency":2.8193918095,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"notac","submitted":243057,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.3725945981845674,"acs":241236,"articleLive":2,"columnArticles":1946,"formTitle":"[31]下一个排列","frequency":3.8183201406,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"ac","submitted":647449,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.35758552682766764,"acs":211411,"articleLive":2,"columnArticles":1434,"formTitle":"[32]最长有效括号","frequency":3.5873722306,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","submitted":591218,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.4301547395630466,"acs":413032,"articleLive":2,"columnArticles":2733,"formTitle":"[33]搜索旋转排序数组","frequency":3.6542679989,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"ac","submitted":960194,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.42268698461892135,"acs":397155,"articleLive":2,"columnArticles":3752,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":3.6738467581,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"ac","submitted":939596,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.45929782043352196,"acs":599250,"articleLive":2,"columnArticles":4469,"formTitle":"[35]搜索插入位置","frequency":3.5272955903,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"ac","submitted":1304709,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6378978398303738,"acs":228946,"articleLive":2,"columnArticles":1629,"formTitle":"[36]有效的数独","frequency":3.349033705,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"ac","submitted":358907,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6704109817367907,"acs":112621,"articleLive":2,"columnArticles":957,"formTitle":"[37]解数独","frequency":3.0886212825,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","submitted":167988,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.597085267673503,"acs":254015,"articleLive":2,"columnArticles":2682,"formTitle":"[38]外观数列","frequency":2.4973402332,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","questionId":"38","status":"ac","submitted":425425,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.7274650835185797,"acs":380593,"articleLive":2,"columnArticles":2216,"formTitle":"[39]组合总和","frequency":3.8258281343,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"ac","submitted":523177,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.6157072336881784,"acs":224759,"articleLive":2,"columnArticles":1533,"formTitle":"[40]组合总和 II","frequency":3.2461200117,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"ac","submitted":365042,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.42006482109192894,"acs":180932,"articleLive":2,"columnArticles":1540,"formTitle":"[41]缺失的第一个正数","frequency":4.2018121018,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"ac","submitted":430724,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5904892611155402,"acs":369589,"articleLive":2,"columnArticles":2710,"formTitle":"[42]接雨水","frequency":4.5731265682,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"ac","submitted":625903,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.4493846124213912,"acs":186651,"articleLive":2,"columnArticles":1259,"formTitle":"[43]字符串相乘","frequency":3.9491706904,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"ac","submitted":415348,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.32851079548335227,"acs":90713,"articleLive":2,"columnArticles":593,"formTitle":"[44]通配符匹配","frequency":2.8825327063,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","submitted":276134,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.4354997069034669,"acs":239966,"articleLive":2,"columnArticles":1887,"formTitle":"[45]跳跃游戏 II","frequency":3.786156133,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"ac","submitted":551013,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7843002929615132,"acs":476264,"articleLive":2,"columnArticles":3063,"formTitle":"[46]全排列","frequency":4.0304729382,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"ac","submitted":607247,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6411926255896768,"acs":243977,"articleLive":2,"columnArticles":1671,"formTitle":"[47]全排列 II","frequency":3.4298293539,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"ac","submitted":380505,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7362162574392759,"acs":250996,"articleLive":2,"columnArticles":2097,"formTitle":"[48]旋转图像","frequency":3.472647661,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"ac","submitted":340927,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6672847995961532,"acs":259084,"articleLive":2,"columnArticles":1473,"formTitle":"[49]字母异位词分组","frequency":2.7893182311,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"ac","submitted":388266,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.37722742939130705,"acs":241882,"articleLive":2,"columnArticles":1437,"formTitle":"[50]Pow(x, n)","frequency":3.5582163264,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"ac","submitted":641210,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7380317190842869,"acs":170413,"articleLive":2,"columnArticles":1693,"formTitle":"[51]N 皇后","frequency":3.7558828964,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"ac","submitted":230902,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.8222231398986197,"acs":79643,"articleLive":2,"columnArticles":651,"formTitle":"[52]N皇后 II","frequency":0.5233893954,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","submitted":96863,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.5527535970506386,"acs":790740,"articleLive":2,"columnArticles":4216,"formTitle":"[53]最大子数组和","frequency":4.0599907087,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"ac","submitted":1430547,"title":"最大子数组和","titleSlug":"maximum-subarray"},{"acceptance":0.482821519973552,"acs":208843,"articleLive":2,"columnArticles":2213,"formTitle":"[54]螺旋矩阵","frequency":3.8649708962,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","submitted":432547,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.4340430794266093,"acs":375551,"articleLive":2,"columnArticles":2855,"formTitle":"[55]跳跃游戏","frequency":3.3964259576,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"ac","submitted":865239,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.474048067178225,"acs":340522,"articleLive":2,"columnArticles":2614,"formTitle":"[56]合并区间","frequency":4.3484979817,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"ac","submitted":718328,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.41302358324533617,"acs":93872,"articleLive":2,"columnArticles":994,"formTitle":"[57]插入区间","frequency":1.7124614537,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","submitted":227280,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.38516112221951593,"acs":271990,"articleLive":2,"columnArticles":2905,"formTitle":"[58]最后一个单词的长度","frequency":2.8080030295,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"ac","submitted":706172,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.7820098292809105,"acs":145116,"articleLive":2,"columnArticles":1769,"formTitle":"[59]螺旋矩阵 II","frequency":3.6334208816,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","submitted":185568,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5263137581394836,"acs":95457,"articleLive":2,"columnArticles":1025,"formTitle":"[60]排列序列","frequency":2.1483449759,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","submitted":181369,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.4175424398101449,"acs":213593,"articleLive":2,"columnArticles":2185,"formTitle":"[61]旋转链表","frequency":2.5817785523,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"ac","submitted":511548,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.6652149413101821,"acs":348250,"articleLive":2,"columnArticles":2662,"formTitle":"[62]不同路径","frequency":3.2912332366,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"ac","submitted":523515,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.39532830921195244,"acs":202433,"articleLive":2,"columnArticles":1913,"formTitle":"[63]不同路径 II","frequency":2.6264424255,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","submitted":512063,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6893365939858213,"acs":295693,"articleLive":2,"columnArticles":2279,"formTitle":"[64]最小路径和","frequency":3.6784431148,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"ac","submitted":428953,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.270928395198625,"acs":48866,"articleLive":2,"columnArticles":683,"formTitle":"[65]有效数字","frequency":1.9896640473,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"ac","submitted":180365,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.46281586196606606,"acs":415654,"articleLive":2,"columnArticles":3787,"formTitle":"[66]加一","frequency":2.8290886984,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"ac","submitted":898098,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5408317228033179,"acs":211840,"articleLive":2,"columnArticles":1931,"formTitle":"[67]二进制求和","frequency":2.9737565866,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","submitted":391693,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.5226278522916858,"acs":39784,"articleLive":2,"columnArticles":609,"formTitle":"[68]文本左右对齐","frequency":3.4809190068,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"ac","submitted":76123,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.39064186551094593,"acs":429224,"articleLive":2,"columnArticles":2170,"formTitle":"[69]Sqrt(x)","frequency":3.6855567431,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","submitted":1098766,"title":"Sqrt(x)","titleSlug":"sqrtx"},{"acceptance":0.5326200015093497,"acs":649300,"articleLive":2,"columnArticles":3943,"formTitle":"[70]爬楼梯","frequency":4.3918222408,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"ac","submitted":1219068,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.42210378425871053,"acs":101849,"articleLive":2,"columnArticles":919,"formTitle":"[71]简化路径","frequency":3.2767030753,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"ac","submitted":241289,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6151936848958334,"acs":196547,"articleLive":2,"columnArticles":1374,"formTitle":"[72]编辑距离","frequency":4.1655853075,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"ac","submitted":319488,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6089654052298197,"acs":149976,"articleLive":2,"columnArticles":1113,"formTitle":"[73]矩阵置零","frequency":2.7189523551,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"ac","submitted":246280,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.46557475449196073,"acs":189258,"articleLive":2,"columnArticles":1904,"formTitle":"[74]搜索二维矩阵","frequency":2.6264424255,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"ac","submitted":406504,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5994635159122607,"acs":302590,"articleLive":2,"columnArticles":2091,"formTitle":"[75]颜色分类","frequency":2.8066137159,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","submitted":504768,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.4304697163239733,"acs":212643,"articleLive":2,"columnArticles":1463,"formTitle":"[76]最小覆盖子串","frequency":3.349033705,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","submitted":493979,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.7690527763866849,"acs":254921,"articleLive":2,"columnArticles":1512,"formTitle":"[77]组合","frequency":3.1141589318,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"ac","submitted":331474,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8022782618731606,"acs":347567,"articleLive":2,"columnArticles":2283,"formTitle":"[78]子集","frequency":3.3420102178,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"ac","submitted":433225,"title":"子集","titleSlug":"subsets"},{"acceptance":0.45965104100516685,"acs":249716,"articleLive":2,"columnArticles":1575,"formTitle":"[79]单词搜索","frequency":2.7669432378,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"ac","submitted":543273,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6179042028351964,"acs":158312,"articleLive":2,"columnArticles":1410,"formTitle":"[80]删除有序数组中的重复项 II","frequency":2.7497780128,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"ac","submitted":256208,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.4144077088191238,"acs":134179,"articleLive":2,"columnArticles":1064,"formTitle":"[81]搜索旋转排序数组 II","frequency":2.3601980041,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"ac","submitted":323785,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5315510282930701,"acs":203617,"articleLive":2,"columnArticles":1859,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":3.3246699857,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"ac","submitted":383062,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.5375009938290859,"acs":351545,"articleLive":2,"columnArticles":2194,"formTitle":"[83]删除排序链表中的重复元素","frequency":2.8193918095,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"ac","submitted":654036,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.43452575523060105,"acs":200727,"articleLive":2,"columnArticles":1281,"formTitle":"[84]柱状图中最大的矩形","frequency":3.6648601261,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"ac","submitted":461945,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5179651162790697,"acs":106908,"articleLive":2,"columnArticles":756,"formTitle":"[85]最大矩形","frequency":2.5544170643,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"ac","submitted":206400,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6326478776925707,"acs":129522,"articleLive":2,"columnArticles":1210,"formTitle":"[86]分隔链表","frequency":2.3898972766,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"ac","submitted":204730,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.4846176904886145,"acs":43650,"articleLive":2,"columnArticles":331,"formTitle":"[87]扰乱字符串","frequency":0.5506985748,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"ac","submitted":90071,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.519265358347432,"acs":525145,"articleLive":2,"columnArticles":3654,"formTitle":"[88]合并两个有序数组","frequency":4.3228891443,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"ac","submitted":1011323,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7128133364430969,"acs":64181,"articleLive":2,"columnArticles":533,"formTitle":"[89]格雷编码","frequency":2.4851132736,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"ac","submitted":90039,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.633877756088722,"acs":153922,"articleLive":2,"columnArticles":1342,"formTitle":"[90]子集 II","frequency":2.4700500256,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"ac","submitted":242826,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.31355961937910515,"acs":178734,"articleLive":2,"columnArticles":1638,"formTitle":"[91]解码方法","frequency":3.2198458533,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"ac","submitted":570016,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5497863557866459,"acs":234949,"articleLive":2,"columnArticles":2202,"formTitle":"[92]反转链表 II","frequency":3.8009558704,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"ac","submitted":427346,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5472289554170844,"acs":172480,"articleLive":2,"columnArticles":1494,"formTitle":"[93]复原 IP 地址","frequency":4.0159100158,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"ac","submitted":315188,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.7556103033577295,"acs":639170,"articleLive":2,"columnArticles":2610,"formTitle":"[94]二叉树的中序遍历","frequency":3.073842037,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","questionId":"94","status":"ac","submitted":845899,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.7075168554520224,"acs":109871,"articleLive":2,"columnArticles":680,"formTitle":"[95]不同的二叉搜索树 II","frequency":3.0308149087,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","submitted":155291,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.69960979929832,"acs":184853,"articleLive":2,"columnArticles":1459,"formTitle":"[96]不同的二叉搜索树","frequency":3.4938413092,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","submitted":264223,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.4544562256289728,"acs":68063,"articleLive":2,"columnArticles":588,"formTitle":"[97]交错字符串","frequency":1.9439887946,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","submitted":149768,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.352581161861208,"acs":393354,"articleLive":2,"columnArticles":2175,"formTitle":"[98]验证二叉搜索树","frequency":3.4620205684,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"ac","submitted":1115641,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6084947266052003,"acs":80715,"articleLive":2,"columnArticles":661,"formTitle":"[99]恢复二叉搜索树","frequency":2.2468264455,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","questionId":"99","status":"","submitted":132647,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.5995100472685675,"acs":277759,"articleLive":2,"columnArticles":2054,"formTitle":"[100]相同的树","frequency":2.668958606,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","submitted":463310,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.56705995253151,"acs":463267,"articleLive":2,"columnArticles":2529,"formTitle":"[101]对称二叉树","frequency":3.3603128682,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"ac","submitted":816963,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6422504119372822,"acs":447461,"articleLive":2,"columnArticles":2803,"formTitle":"[102]二叉树的层序遍历","frequency":4.352353819,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"ac","submitted":696708,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5717137835022934,"acs":191575,"articleLive":2,"columnArticles":1719,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":3.6083569129,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"ac","submitted":335089,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7671391878228185,"acs":574341,"articleLive":2,"columnArticles":2826,"formTitle":"[104]二叉树的最大深度","frequency":3.5945961296,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"ac","submitted":748679,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7062132563672056,"acs":278450,"articleLive":2,"columnArticles":1596,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":3.3698129539,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"","submitted":394286,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.7217833583461615,"acs":149573,"articleLive":2,"columnArticles":996,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":3.4530775648,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"","submitted":207227,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.7016065900791175,"acs":176560,"articleLive":2,"columnArticles":1426,"formTitle":"[107]二叉树的层序遍历 II","frequency":2.7470013131,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","submitted":251651,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7619832331882128,"acs":211778,"articleLive":2,"columnArticles":1306,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":2.77171834,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"ac","submitted":277930,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7623133880928114,"acs":101717,"articleLive":2,"columnArticles":791,"formTitle":"[109]有序链表转换二叉搜索树","frequency":2.7318724315,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"ac","submitted":133432,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5646570017650675,"acs":284717,"articleLive":2,"columnArticles":1613,"formTitle":"[110]平衡二叉树","frequency":2.8971475079,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"ac","submitted":504230,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.4909869419394748,"acs":304788,"articleLive":2,"columnArticles":2008,"formTitle":"[111]二叉树的最小深度","frequency":2.4177418197,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","submitted":620766,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5271797762975646,"acs":302966,"articleLive":2,"columnArticles":1903,"formTitle":"[112]路径总和","frequency":3.1599222316,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"ac","submitted":574692,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.627942859830963,"acs":200229,"articleLive":2,"columnArticles":1409,"formTitle":"[113]路径总和 II","frequency":2.6449151334,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","submitted":318865,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.7267649475988567,"acs":199856,"articleLive":2,"columnArticles":1506,"formTitle":"[114]二叉树展开为链表","frequency":2.1753007859,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","submitted":274994,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5207956600361664,"acs":68256,"articleLive":2,"columnArticles":737,"formTitle":"[115]不同的子序列","frequency":2.9199668963,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","submitted":131061,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7072850304828128,"acs":185738,"articleLive":2,"columnArticles":1412,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":2.5544170643,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"ac","submitted":262607,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6215124528301886,"acs":102938,"articleLive":2,"columnArticles":870,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":1.3030808331,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"ac","submitted":165625,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.736897580837025,"acs":244692,"articleLive":2,"columnArticles":1972,"formTitle":"[118]杨辉三角","frequency":3.3645764488,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"ac","submitted":332057,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6737082524251832,"acs":163414,"articleLive":2,"columnArticles":1358,"formTitle":"[119]杨辉三角 II","frequency":2.2526653667,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"ac","submitted":242559,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6830412243890397,"acs":196457,"articleLive":2,"columnArticles":1728,"formTitle":"[120]三角形最小路径和","frequency":2.3314162784,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"ac","submitted":287621,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5736896231089519,"acs":628699,"articleLive":2,"columnArticles":3792,"formTitle":"[121]买卖股票的最佳时机","frequency":4.3099122716,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"ac","submitted":1095887,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6922910586380248,"acs":515446,"articleLive":2,"columnArticles":2915,"formTitle":"[122]买卖股票的最佳时机 II","frequency":2.9101206629,"frontendQuestionId":"122","leaf":true,"level":2,"nodeType":"def","questionId":"122","status":"ac","submitted":744551,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5414221223232564,"acs":143080,"articleLive":2,"columnArticles":894,"formTitle":"[123]买卖股票的最佳时机 III","frequency":3.2945183547,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"","submitted":264267,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.4463622186229133,"acs":178028,"articleLive":2,"columnArticles":1206,"formTitle":"[124]二叉树中的最大路径和","frequency":4.1892147413,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"ac","submitted":398842,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.47140626207962893,"acs":304882,"articleLive":2,"columnArticles":2007,"formTitle":"[125]验证回文串","frequency":3.0228324277,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","submitted":646750,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.3983855840035122,"acs":39927,"articleLive":2,"columnArticles":357,"formTitle":"[126]单词接龙 II","frequency":1.7452190502,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","submitted":100222,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.4712100009995288,"acs":132001,"articleLive":2,"columnArticles":709,"formTitle":"[127]单词接龙","frequency":1.6504212504,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","submitted":280132,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5448108464426171,"acs":195051,"articleLive":2,"columnArticles":1294,"formTitle":"[128]最长连续序列","frequency":4.0035364475,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","questionId":"128","status":"","submitted":358016,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6861134873110921,"acs":132341,"articleLive":2,"columnArticles":1230,"formTitle":"[129]求根节点到叶节点数字之和","frequency":2.8868938123,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","submitted":192885,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.44887604025395195,"acs":143314,"articleLive":2,"columnArticles":1297,"formTitle":"[130]被围绕的区域","frequency":2.3514696603,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"ac","submitted":319273,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7233415257283298,"acs":148923,"articleLive":2,"columnArticles":988,"formTitle":"[131]分割回文串","frequency":2.8080030295,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","submitted":205882,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.49288572908329015,"acs":52342,"articleLive":2,"columnArticles":466,"formTitle":"[132]分割回文串 II","frequency":2.2101475172,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","submitted":106195,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6780408542246983,"acs":78867,"articleLive":2,"columnArticles":558,"formTitle":"[133]克隆图","frequency":1.5925305313,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"ac","submitted":116316,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.5664182268902082,"acs":138922,"articleLive":2,"columnArticles":1051,"formTitle":"[134]加油站","frequency":3.4809190068,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"ac","submitted":245264,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.48669108133593564,"acs":110968,"articleLive":2,"columnArticles":893,"formTitle":"[135]分发糖果","frequency":4.2612557381,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"ac","submitted":228005,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7191133352580759,"acs":560423,"articleLive":2,"columnArticles":2546,"formTitle":"[136]只出现一次的数字","frequency":3.9276074067,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"ac","submitted":779325,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7201764749070569,"acs":107899,"articleLive":2,"columnArticles":810,"formTitle":"[137]只出现一次的数字 II","frequency":2.17872662,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"ac","submitted":149823,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6631077052232782,"acs":123220,"articleLive":2,"columnArticles":930,"formTitle":"[138]复制带随机指针的链表","frequency":3.3268598475,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"ac","submitted":185822,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5196439684832259,"acs":221267,"articleLive":2,"columnArticles":1383,"formTitle":"[139]单词拆分","frequency":3.6077059136,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"ac","submitted":425805,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.5025650835608577,"acs":57798,"articleLive":2,"columnArticles":606,"formTitle":"[140]单词拆分 II","frequency":1.0267308708,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","submitted":115006,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.5131077608686989,"acs":592269,"articleLive":2,"columnArticles":3051,"formTitle":"[141]环形链表","frequency":3.4164836537,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"ac","submitted":1154278,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5545786590568869,"acs":336012,"articleLive":2,"columnArticles":1949,"formTitle":"[142]环形链表 II","frequency":3.277699399,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"ac","submitted":605887,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6257805040108776,"acs":142213,"articleLive":2,"columnArticles":1197,"formTitle":"[143]重排链表","frequency":4.0635671028,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"ac","submitted":227257,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7048614205844098,"acs":466595,"articleLive":2,"columnArticles":2068,"formTitle":"[144]二叉树的前序遍历","frequency":2.082072675,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","questionId":"144","status":"ac","submitted":661967,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.752220211473903,"acs":341262,"articleLive":2,"columnArticles":1748,"formTitle":"[145]二叉树的后序遍历","frequency":3.4244387232,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","questionId":"145","status":"ac","submitted":453673,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5243548203558744,"acs":262653,"articleLive":2,"columnArticles":1543,"formTitle":"[146]LRU 缓存","frequency":4.2909579513,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","submitted":500907,"title":"LRU 缓存","titleSlug":"lru-cache"},{"acceptance":0.683781294375008,"acs":106901,"articleLive":2,"columnArticles":827,"formTitle":"[147]对链表进行插入排序","frequency":2.4205724375,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"ac","submitted":156338,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6663359930989864,"acs":231735,"articleLive":2,"columnArticles":1379,"formTitle":"[148]排序链表","frequency":3.4413842604,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"ac","submitted":347775,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.3505492771224878,"acs":51088,"articleLive":2,"columnArticles":548,"formTitle":"[149]直线上最多的点数","frequency":2.5843057207,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"ac","submitted":145737,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5347379952528757,"acs":146438,"articleLive":2,"columnArticles":1156,"formTitle":"[150]逆波兰表达式求值","frequency":2.5843057207,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"ac","submitted":273850,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.49004598907373687,"acs":190524,"articleLive":2,"columnArticles":1577,"formTitle":"[151]翻转字符串里的单词","frequency":2.5843057207,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","submitted":388788,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.4226362264893495,"acs":206189,"articleLive":2,"columnArticles":1372,"formTitle":"[152]乘积最大子数组","frequency":3.7828566711,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","submitted":487864,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5681772755414938,"acs":233097,"articleLive":2,"columnArticles":1642,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":1.4629331154,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"ac","submitted":410254,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5310152759196594,"acs":121457,"articleLive":2,"columnArticles":961,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":1.8590751815,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"ac","submitted":228726,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5753927170009075,"acs":315119,"articleLive":2,"columnArticles":1738,"formTitle":"[155]最小栈","frequency":3.3661985618,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"ac","submitted":547659,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7223142105775786,"acs":7416,"articleLive":2,"columnArticles":137,"formTitle":"[156]上下翻转二叉树","frequency":0.4972098898,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"","submitted":10267,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5367995784296504,"acs":6112,"articleLive":2,"columnArticles":88,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"","submitted":11386,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5966578047854159,"acs":3142,"articleLive":2,"columnArticles":73,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":0.5506985748,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","questionId":"158","status":"","submitted":5266,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5498653940283896,"acs":17974,"articleLive":2,"columnArticles":214,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":1.6808881918,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","questionId":"159","status":"ac","submitted":32688,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6183446704530445,"acs":374519,"articleLive":2,"columnArticles":2177,"formTitle":"[160]相交链表","frequency":2.721657838,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"ac","submitted":605680,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.33748081118203116,"acs":8354,"articleLive":2,"columnArticles":115,"formTitle":"[161]相隔为 1 的编辑距离","frequency":0.5506985748,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"","submitted":24754,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.49632226594978107,"acs":179083,"articleLive":2,"columnArticles":1203,"formTitle":"[162]寻找峰值","frequency":3.4320551383,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"ac","submitted":360820,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.3325721269820848,"acs":10340,"articleLive":2,"columnArticles":157,"formTitle":"[163]缺失的区间","frequency":1.4470622855,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"","submitted":31091,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6090008337696081,"acs":62816,"articleLive":2,"columnArticles":530,"formTitle":"[164]最大间距","frequency":2.5873472706,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","submitted":103146,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.5209583197325619,"acs":92567,"articleLive":2,"columnArticles":962,"formTitle":"[165]比较版本号","frequency":3.934506811,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"ac","submitted":177686,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.33125004678038666,"acs":44256,"articleLive":2,"columnArticles":397,"formTitle":"[166]分数到小数","frequency":2.9157347127,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","submitted":133603,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5871969883483584,"acs":336293,"articleLive":2,"columnArticles":2209,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":3.2423227503,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"ac","submitted":572709,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.4337974025478497,"acs":90953,"articleLive":2,"columnArticles":807,"formTitle":"[168]Excel表列名称","frequency":2.9179895559,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"ac","submitted":209667,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.6652476286239949,"acs":427391,"articleLive":2,"columnArticles":2388,"formTitle":"[169]多数元素","frequency":3.2125826023,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","submitted":642454,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.4225863634398374,"acs":9774,"articleLive":2,"columnArticles":100,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":1.1154414835,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"ac","submitted":23129,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.717336864765802,"acs":114294,"articleLive":2,"columnArticles":979,"formTitle":"[171]Excel 表列序号","frequency":2.6998952865,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"ac","submitted":159331,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.4454683259690655,"acs":96684,"articleLive":2,"columnArticles":633,"formTitle":"[172]阶乘后的零","frequency":2.668958606,"frontendQuestionId":"172","leaf":true,"level":2,"nodeType":"def","questionId":"172","status":"","submitted":217039,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.805744800224422,"acs":80423,"articleLive":2,"columnArticles":674,"formTitle":"[173]二叉搜索树迭代器","frequency":1.6504212504,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"ac","submitted":99812,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.48033843579500596,"acs":40762,"articleLive":2,"columnArticles":427,"formTitle":"[174]地下城游戏","frequency":3.2328940551,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","submitted":84861,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7363851371684473,"acs":330349,"articleLive":2,"columnArticles":1564,"formTitle":"[175]组合两个表","frequency":4.5034720582,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","submitted":448609,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.3543900466628108,"acs":270827,"articleLive":2,"columnArticles":1091,"formTitle":"[176]第二高的薪水","frequency":4.179430748,"frontendQuestionId":"176","leaf":true,"level":2,"nodeType":"def","questionId":"176","status":"","submitted":764206,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.46309502407063385,"acs":139098,"articleLive":2,"columnArticles":546,"formTitle":"[177]第N高的薪水","frequency":3.7221840237,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","submitted":300366,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.603665244697789,"acs":130047,"articleLive":2,"columnArticles":705,"formTitle":"[178]分数排名","frequency":2.7470013131,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","submitted":215429,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.4096825946081978,"acs":130234,"articleLive":2,"columnArticles":1035,"formTitle":"[179]最大数","frequency":3.3578848869,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"ac","submitted":317890,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.4851294192080249,"acs":95081,"articleLive":2,"columnArticles":550,"formTitle":"[180]连续出现的数字","frequency":3.6334208816,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","submitted":195991,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.696815564032867,"acs":179191,"articleLive":2,"columnArticles":725,"formTitle":"[181]超过经理收入的员工","frequency":3.3893292452,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","submitted":257157,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7942866159062038,"acs":196327,"articleLive":2,"columnArticles":642,"formTitle":"[182]查找重复的电子邮箱","frequency":3.2328940551,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","submitted":247174,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.673959423059498,"acs":163636,"articleLive":2,"columnArticles":593,"formTitle":"[183]从不订购的客户","frequency":2.7470013131,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","submitted":242798,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.48205663690848605,"acs":111720,"articleLive":2,"columnArticles":726,"formTitle":"[184]部门工资最高的员工","frequency":3.1188754767,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","submitted":231757,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.5012407751767214,"acs":77361,"articleLive":2,"columnArticles":682,"formTitle":"[185]部门工资前三高的所有员工","frequency":3.6658912666,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","submitted":154339,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7572568940493469,"acs":8348,"articleLive":2,"columnArticles":129,"formTitle":"[186]翻转字符串里的单词 II","frequency":1.055182292,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"","submitted":11024,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.523111871155466,"acs":81980,"articleLive":2,"columnArticles":598,"formTitle":"[187]重复的DNA序列","frequency":3.4280637544,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"ac","submitted":156716,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.3980915551924018,"acs":98415,"articleLive":2,"columnArticles":767,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":3.0095965511,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"","submitted":247217,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.4465971887735937,"acs":395916,"articleLive":2,"columnArticles":1990,"formTitle":"[189]轮转数组","frequency":3.7235313333,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"ac","submitted":886517,"title":"轮转数组","titleSlug":"rotate-array"},{"acceptance":0.7018129701218234,"acs":143965,"articleLive":2,"columnArticles":902,"formTitle":"[190]颠倒二进制位","frequency":1.9439887946,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"ac","submitted":205133,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7507694538599576,"acs":207096,"articleLive":2,"columnArticles":1308,"formTitle":"[191]位1的个数","frequency":1.3576994309,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"ac","submitted":275845,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.3571983468506261,"acs":22990,"articleLive":2,"columnArticles":181,"formTitle":"[192]统计词频","frequency":2.2101475172,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","submitted":64362,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.3266137146509783,"acs":27592,"articleLive":2,"columnArticles":148,"formTitle":"[193]有效电话号码","frequency":1.7124614537,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","submitted":84479,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.34605445606958274,"acs":10981,"articleLive":2,"columnArticles":75,"formTitle":"[194]转置文件","frequency":1.0847265383,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","submitted":31732,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.43780031417482906,"acs":37903,"articleLive":2,"columnArticles":152,"formTitle":"[195]第十行","frequency":2.0316190228,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","submitted":86576,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6649748339889185,"acs":110054,"articleLive":2,"columnArticles":433,"formTitle":"[196]删除重复的电子邮箱","frequency":2.9812617629,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","submitted":165501,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5334163230374231,"acs":102840,"articleLive":2,"columnArticles":561,"formTitle":"[197]上升的温度","frequency":3.0134382769,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","submitted":192795,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.5206904578580765,"acs":436185,"articleLive":2,"columnArticles":2985,"formTitle":"[198]打家劫舍","frequency":3.6879501079,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"ac","submitted":837705,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6526014837453479,"acs":158868,"articleLive":2,"columnArticles":1753,"formTitle":"[199]二叉树的右视图","frequency":3.2059055057,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"ac","submitted":243438,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5637118167172057,"acs":371242,"articleLive":2,"columnArticles":2332,"formTitle":"[200]岛屿数量","frequency":4.1983527885,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"ac","submitted":658567,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5282727641512234,"acs":53392,"articleLive":2,"columnArticles":347,"formTitle":"[201]数字范围按位与","frequency":1.479109463,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"ac","submitted":101069,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6213454070800224,"acs":189931,"articleLive":2,"columnArticles":1536,"formTitle":"[202]快乐数","frequency":2.9199668963,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"ac","submitted":305677,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5225437795183767,"acs":268854,"articleLive":2,"columnArticles":1871,"formTitle":"[203]移除链表元素","frequency":1.7189155874,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"ac","submitted":514510,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.3773866329593933,"acs":179136,"articleLive":2,"columnArticles":771,"formTitle":"[204]计数质数","frequency":2.8193918095,"frontendQuestionId":"204","leaf":true,"level":2,"nodeType":"def","questionId":"204","status":"","submitted":474675,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.49933996088657107,"acs":122558,"articleLive":2,"columnArticles":945,"formTitle":"[205]同构字符串","frequency":2.5544170643,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"ac","submitted":245440,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7244492144626391,"acs":804603,"articleLive":2,"columnArticles":7778,"formTitle":"[206]反转链表","frequency":4.1015298808,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"ac","submitted":1110641,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.5406204989146679,"acs":159895,"articleLive":2,"columnArticles":1038,"formTitle":"[207]课程表","frequency":3.1870775218,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","submitted":295762,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.718129877620172,"acs":159376,"articleLive":2,"columnArticles":1077,"formTitle":"[208]实现 Trie (前缀树)","frequency":2.9777520638,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"ac","submitted":221932,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.47714639950739735,"acs":229370,"articleLive":2,"columnArticles":1604,"formTitle":"[209]长度最小的子数组","frequency":3.1501064427,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"ac","submitted":480712,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.5464227629009535,"acs":100456,"articleLive":2,"columnArticles":755,"formTitle":"[210]课程表 II","frequency":2.3007527097,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","submitted":183843,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.511176785608029,"acs":51544,"articleLive":2,"columnArticles":562,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":1.4161956376,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"ac","submitted":100834,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.46435646326832397,"acs":66572,"articleLive":2,"columnArticles":600,"formTitle":"[212]单词搜索 II","frequency":1.779247512,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"ac","submitted":143364,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.4343093324915998,"acs":189877,"articleLive":2,"columnArticles":1716,"formTitle":"[213]打家劫舍 II","frequency":3.053523804,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"ac","submitted":437193,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.3746241731809982,"acs":33019,"articleLive":2,"columnArticles":334,"formTitle":"[214]最短回文串","frequency":2.6568607087,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","submitted":88139,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.6463757277641873,"acs":490934,"articleLive":2,"columnArticles":2539,"formTitle":"[215]数组中的第K个最大元素","frequency":4.1774458524,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"ac","submitted":759518,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7356130378704898,"acs":113497,"articleLive":2,"columnArticles":1149,"formTitle":"[216]组合总和 III","frequency":3.1096994167,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","submitted":154289,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5556738297261846,"acs":433799,"articleLive":2,"columnArticles":2024,"formTitle":"[217]存在重复元素","frequency":4.541221765,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"ac","submitted":780672,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5414587178047019,"acs":33741,"articleLive":2,"columnArticles":299,"formTitle":"[218]天际线问题","frequency":3.8545822717,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"ac","submitted":62315,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.4221879815100154,"acs":121382,"articleLive":2,"columnArticles":1005,"formTitle":"[219]存在重复元素 II","frequency":2.4522875692,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"ac","submitted":287507,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.2868729587136756,"acs":68511,"articleLive":2,"columnArticles":451,"formTitle":"[220]存在重复元素 III","frequency":1.9896640473,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"ac","submitted":238820,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.47899696978121264,"acs":155070,"articleLive":2,"columnArticles":1105,"formTitle":"[221]最大正方形","frequency":3.5998606851,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","submitted":323739,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.784943258817568,"acs":133219,"articleLive":2,"columnArticles":978,"formTitle":"[222]完全二叉树的节点个数","frequency":2.1189385052,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","submitted":169718,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.52501584824694,"acs":43066,"articleLive":2,"columnArticles":533,"formTitle":"[223]矩形面积","frequency":3.4041988046,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"ac","submitted":82028,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.41755679335954565,"acs":76463,"articleLive":2,"columnArticles":695,"formTitle":"[224]基本计算器","frequency":3.2328940551,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"ac","submitted":183120,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.674660364630567,"acs":151018,"articleLive":2,"columnArticles":4838,"formTitle":"[225]用队列实现栈","frequency":2.0014538561,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"ac","submitted":223843,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7881496697258964,"acs":346856,"articleLive":2,"columnArticles":2081,"formTitle":"[226]翻转二叉树","frequency":3.6512625681,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"ac","submitted":440089,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.4370824027599144,"acs":94134,"articleLive":2,"columnArticles":754,"formTitle":"[227]基本计算器 II","frequency":3.182378265,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"ac","submitted":215369,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5766246860791874,"acs":61764,"articleLive":2,"columnArticles":705,"formTitle":"[228]汇总区间","frequency":0.5233893954,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","submitted":107113,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.534382450405602,"acs":71277,"articleLive":2,"columnArticles":670,"formTitle":"[229]求众数 II","frequency":2.9501259975,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"ac","submitted":133382,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.752272109078506,"acs":174236,"articleLive":2,"columnArticles":1193,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":0.9111856876,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"ac","submitted":231613,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5046781250924465,"acs":187658,"articleLive":2,"columnArticles":1340,"formTitle":"[231]2 的幂","frequency":0.0,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"ac","submitted":371837,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6896109563033959,"acs":180165,"articleLive":2,"columnArticles":1413,"formTitle":"[232]用栈实现队列","frequency":2.5796454457,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"ac","submitted":261256,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.47716320972134924,"acs":36440,"articleLive":2,"columnArticles":442,"formTitle":"[233]数字 1 的个数","frequency":3.2328940551,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"ac","submitted":76368,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.5021146329102125,"acs":344774,"articleLive":2,"columnArticles":2171,"formTitle":"[234]回文链表","frequency":3.4584046603,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"ac","submitted":686644,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.6678674452965595,"acs":189848,"articleLive":2,"columnArticles":1096,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":2.8080030295,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"ac","submitted":284260,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6834259394304372,"acs":290523,"articleLive":2,"columnArticles":1572,"formTitle":"[236]二叉树的最近公共祖先","frequency":3.472647661,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","submitted":425098,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.856791956092674,"acs":257424,"articleLive":2,"columnArticles":1351,"formTitle":"[237]删除链表中的节点","frequency":2.6470758948,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"ac","submitted":300451,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7250989227361366,"acs":153196,"articleLive":2,"columnArticles":965,"formTitle":"[238]除自身以外数组的乘积","frequency":2.6018193032,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","submitted":211276,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.4968432978948494,"acs":218383,"articleLive":2,"columnArticles":1488,"formTitle":"[239]滑动窗口最大值","frequency":3.5447365102,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"ac","submitted":439541,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.4977555895754587,"acs":220445,"articleLive":2,"columnArticles":1120,"formTitle":"[240]搜索二维矩阵 II","frequency":3.3117993219,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"ac","submitted":442878,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7354143519003794,"acs":35080,"articleLive":2,"columnArticles":321,"formTitle":"[241]为运算表达式设计优先级","frequency":2.7992379633,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","submitted":47701,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6473881991854723,"acs":329048,"articleLive":2,"columnArticles":1909,"formTitle":"[242]有效的字母异位词","frequency":2.3514696603,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"ac","submitted":508270,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6570794973456084,"acs":9778,"articleLive":2,"columnArticles":118,"formTitle":"[243]最短单词距离","frequency":0.4972098898,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"","submitted":14881,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.5599882949668358,"acs":5741,"articleLive":2,"columnArticles":69,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"","submitted":10252,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.5942010950721752,"acs":4775,"articleLive":2,"columnArticles":67,"formTitle":"[245]最短单词距离 III","frequency":1.1154414835,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"","submitted":8036,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.47677188802858844,"acs":6404,"articleLive":2,"columnArticles":118,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"","submitted":13432,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5266844870494977,"acs":5714,"articleLive":2,"columnArticles":100,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"","submitted":10849,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.4680955497382199,"acs":2861,"articleLive":2,"columnArticles":55,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"","submitted":6112,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.6401496504873486,"acs":6502,"articleLive":2,"columnArticles":114,"formTitle":"[249]移位字符串分组","frequency":1.0847265383,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"ac","submitted":10157,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6373426754898145,"acs":4912,"articleLive":2,"columnArticles":85,"formTitle":"[250]统计同值子树","frequency":0.4972098898,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"","submitted":7707,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5504696388411165,"acs":4161,"articleLive":2,"columnArticles":76,"formTitle":"[251]展开二维向量","frequency":1.055182292,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"","submitted":7559,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5640213404468156,"acs":13532,"articleLive":2,"columnArticles":170,"formTitle":"[252]会议室","frequency":0.0,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"","submitted":23992,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.5053976125141034,"acs":36283,"articleLive":2,"columnArticles":387,"formTitle":"[253]会议室 II","frequency":2.979402093,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"","submitted":71791,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5687710843373494,"acs":5901,"articleLive":2,"columnArticles":85,"formTitle":"[254]因子的组合","frequency":1.1154414835,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"","submitted":10375,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.47713784167850876,"acs":5708,"articleLive":2,"columnArticles":70,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"","submitted":11963,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.6460005947071068,"acs":13035,"articleLive":2,"columnArticles":207,"formTitle":"[256]粉刷房子","frequency":0.5233893954,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"","submitted":20178,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6870404868624086,"acs":158953,"articleLive":2,"columnArticles":1165,"formTitle":"[257]二叉树的所有路径","frequency":2.7601628613,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"ac","submitted":231359,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.691605478910803,"acs":84019,"articleLive":2,"columnArticles":710,"formTitle":"[258]各位相加","frequency":2.5544170643,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","submitted":121484,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5615472289499929,"acs":7883,"articleLive":2,"columnArticles":95,"formTitle":"[259]较小的三数之和","frequency":0.60905819,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"","submitted":14038,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7404106863588833,"acs":80011,"articleLive":2,"columnArticles":713,"formTitle":"[260]只出现一次的数字 III","frequency":3.247278653,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"ac","submitted":108063,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.4981743378760607,"acs":9687,"articleLive":2,"columnArticles":133,"formTitle":"[261]以图判树","frequency":1.4470622855,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"","submitted":19445,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.43088108875102277,"acs":41602,"articleLive":2,"columnArticles":394,"formTitle":"[262]行程和用户","frequency":3.0467261434,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","submitted":96551,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.5141170185076099,"acs":112587,"articleLive":2,"columnArticles":875,"formTitle":"[263]丑数","frequency":1.8590751815,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"ac","submitted":218991,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.5808775164709561,"acs":107740,"articleLive":2,"columnArticles":666,"formTitle":"[264]丑数 II","frequency":2.6878770666,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","submitted":185478,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5988917962136371,"acs":7782,"articleLive":2,"columnArticles":171,"formTitle":"[265]粉刷房子 II","frequency":0.0,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"","submitted":12994,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6794871794871795,"acs":7420,"articleLive":2,"columnArticles":114,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"","submitted":10920,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.4472548549508511,"acs":3731,"articleLive":2,"columnArticles":81,"formTitle":"[267]回文排列 II","frequency":0.0,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"","submitted":8342,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6515353848772282,"acs":199061,"articleLive":2,"columnArticles":1542,"formTitle":"[268]丢失的数字","frequency":2.4851132736,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"ac","submitted":305526,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.34464751958224543,"acs":7260,"articleLive":2,"columnArticles":117,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"","submitted":21065,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.563789963577499,"acs":11145,"articleLive":2,"columnArticles":148,"formTitle":"[270]最接近的二叉搜索树值","frequency":0.4479388408,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"","submitted":19768,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.5563938136552244,"acs":2950,"articleLive":2,"columnArticles":50,"formTitle":"[271]字符串的编码与解码","frequency":0.5792230415,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"","submitted":5302,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.6472081218274112,"acs":3825,"articleLive":2,"columnArticles":86,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":0.0,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"","submitted":5910,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.36649525316455694,"acs":29648,"articleLive":2,"columnArticles":359,"formTitle":"[273]整数转换英文表示","frequency":2.6470758948,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"ac","submitted":80896,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.44026989964470487,"acs":56506,"articleLive":2,"columnArticles":594,"formTitle":"[274]H 指数","frequency":2.9857931162,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"ac","submitted":128344,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.4609406276653148,"acs":52963,"articleLive":2,"columnArticles":439,"formTitle":"[275]H 指数 II","frequency":2.128636021,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"ac","submitted":114902,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.49957295841271926,"acs":7604,"articleLive":2,"columnArticles":142,"formTitle":"[276]栅栏涂色","frequency":0.0,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"","submitted":15221,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.5728188376207975,"acs":8417,"articleLive":2,"columnArticles":96,"formTitle":"[277]搜寻名人","frequency":0.4972098898,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"","submitted":14694,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.45268426646027277,"acs":230443,"articleLive":2,"columnArticles":1299,"formTitle":"[278]第一个错误的版本","frequency":3.9943610464,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"ac","submitted":509059,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.636346085598694,"acs":224137,"articleLive":2,"columnArticles":1311,"formTitle":"[279]完全平方数","frequency":3.1540821168,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"ac","submitted":352225,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6831408262994225,"acs":6151,"articleLive":2,"columnArticles":78,"formTitle":"[280]摆动排序","frequency":1.0847265383,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"ac","submitted":9004,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7567706989940676,"acs":2934,"articleLive":2,"columnArticles":73,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"","submitted":3877,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.48404040404040405,"acs":20366,"articleLive":2,"columnArticles":172,"formTitle":"[282]给表达式添加运算符","frequency":1.5471012081,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"ac","submitted":42075,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.6404013413792256,"acs":573286,"articleLive":2,"columnArticles":3741,"formTitle":"[283]移动零","frequency":3.9980945533,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"ac","submitted":895198,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.7703897028293493,"acs":25976,"articleLive":2,"columnArticles":219,"formTitle":"[284]窥探迭代器","frequency":1.9219929666,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"ac","submitted":33718,"title":"窥探迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6354042074157461,"acs":9031,"articleLive":2,"columnArticles":114,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"","submitted":14213,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5176646343925384,"acs":12821,"articleLive":2,"columnArticles":166,"formTitle":"[286]墙与门","frequency":0.0,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"ac","submitted":24767,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.6551075332040897,"acs":194979,"articleLive":2,"columnArticles":1325,"formTitle":"[287]寻找重复数","frequency":2.7318724315,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","submitted":297629,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.4462456377349994,"acs":3964,"articleLive":2,"columnArticles":63,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"ac","submitted":8883,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7539910664885362,"acs":55873,"articleLive":2,"columnArticles":856,"formTitle":"[289]生命游戏","frequency":1.6808881918,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","submitted":74103,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.4555858449466256,"acs":89411,"articleLive":2,"columnArticles":1183,"formTitle":"[290]单词规律","frequency":2.2181732425,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","submitted":196255,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.5244503411675512,"acs":2767,"articleLive":2,"columnArticles":62,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"","submitted":5276,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.7077792592417789,"acs":119970,"articleLive":2,"columnArticles":796,"formTitle":"[292]Nim 游戏","frequency":2.2101475172,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"ac","submitted":169502,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7127986120379021,"acs":5341,"articleLive":2,"columnArticles":88,"formTitle":"[293]翻转游戏","frequency":0.0,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"","submitted":7493,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5821506949524506,"acs":3979,"articleLive":2,"columnArticles":59,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"","submitted":6835,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.5228409971632166,"acs":69484,"articleLive":2,"columnArticles":547,"formTitle":"[295]数据流的中位数","frequency":3.182378265,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"ac","submitted":132897,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.6207845836200964,"acs":2706,"articleLive":2,"columnArticles":51,"formTitle":"[296]最佳的碰头地点","frequency":1.180738826,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"","submitted":4359,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.5637412191144755,"acs":117889,"articleLive":2,"columnArticles":824,"formTitle":"[297]二叉树的序列化与反序列化","frequency":3.0729796706,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"ac","submitted":209119,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5822320117474302,"acs":5551,"articleLive":2,"columnArticles":87,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"","submitted":9534,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.5642911443876739,"acs":63836,"articleLive":2,"columnArticles":728,"formTitle":"[299]猜数字游戏","frequency":2.5544170643,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"ac","submitted":113126,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5218193735114895,"acs":402054,"articleLive":2,"columnArticles":2214,"formTitle":"[300]最长递增子序列","frequency":3.6134202149,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"ac","submitted":770485,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5479861407566988,"acs":55197,"articleLive":2,"columnArticles":394,"formTitle":"[301]删除无效的括号","frequency":2.9199668963,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"ac","submitted":100727,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.659211300765156,"acs":2240,"articleLive":2,"columnArticles":42,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"","submitted":3398,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.7315439811490364,"acs":137531,"articleLive":2,"columnArticles":844,"formTitle":"[303]区域和检索 - 数组不可变","frequency":1.6808881918,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","submitted":188001,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.558283771626022,"acs":70121,"articleLive":2,"columnArticles":620,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":1.6209900502,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","submitted":125601,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.39584163148251417,"acs":4969,"articleLive":2,"columnArticles":74,"formTitle":"[305]岛屿数量 II","frequency":0.4972098898,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"","submitted":12553,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.3383641043684376,"acs":18272,"articleLive":2,"columnArticles":274,"formTitle":"[306]累加数","frequency":2.2426782668,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","submitted":54001,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5307321080193038,"acs":25844,"articleLive":2,"columnArticles":250,"formTitle":"[307]区域和检索 - 数组可修改","frequency":0.5506985748,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"ac","submitted":48695,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6170957260684828,"acs":2469,"articleLive":2,"columnArticles":52,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"","submitted":4001,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.6162632757413786,"acs":132936,"articleLive":2,"columnArticles":1050,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":3.4320551383,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"","submitted":215713,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.3823450665406725,"acs":24277,"articleLive":2,"columnArticles":230,"formTitle":"[310]最小高度树","frequency":1.6808881918,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","submitted":63495,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7630296212973379,"acs":4070,"articleLive":2,"columnArticles":49,"formTitle":"[311]稀疏矩阵的乘法","frequency":1.1474135162,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"ac","submitted":5334,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6849228761405443,"acs":60878,"articleLive":2,"columnArticles":414,"formTitle":"[312]戳气球","frequency":2.8100372043,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","submitted":88883,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6157717880889397,"acs":43064,"articleLive":2,"columnArticles":374,"formTitle":"[313]超级丑数","frequency":2.6470758948,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"ac","submitted":69935,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5516683518705764,"acs":5456,"articleLive":2,"columnArticles":98,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"","submitted":9890,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.4174452376642083,"acs":53036,"articleLive":2,"columnArticles":498,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":2.5544170643,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"ac","submitted":127049,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.476897700570112,"acs":72859,"articleLive":2,"columnArticles":588,"formTitle":"[316]去除重复字母","frequency":3.182378265,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"ac","submitted":152777,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.47756595416907377,"acs":4960,"articleLive":2,"columnArticles":69,"formTitle":"[317]离建筑物最近的距离","frequency":0.5233893954,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"","submitted":10386,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.7364277800454837,"acs":50516,"articleLive":2,"columnArticles":492,"formTitle":"[318]最大单词长度乘积","frequency":2.491818408,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","submitted":68596,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5706586054577196,"acs":48704,"articleLive":2,"columnArticles":443,"formTitle":"[319]灯泡开关","frequency":2.8825327063,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"ac","submitted":85347,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.6820383238576543,"acs":3239,"articleLive":2,"columnArticles":57,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"","submitted":4749,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.4231739566552175,"acs":27844,"articleLive":2,"columnArticles":240,"formTitle":"[321]拼接最大数","frequency":1.5832497222,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","submitted":65798,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.4480060575466936,"acs":340800,"articleLive":2,"columnArticles":1989,"formTitle":"[322]零钱兑换","frequency":3.5291598713,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"ac","submitted":760704,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.6318999538721747,"acs":12329,"articleLive":2,"columnArticles":166,"formTitle":"[323]无向图中连通分量的数目","frequency":1.779247512,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"","submitted":19511,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.37971382540072635,"acs":27811,"articleLive":2,"columnArticles":181,"formTitle":"[324]摆动排序 II","frequency":2.0316190228,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"ac","submitted":73242,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.535181236673774,"acs":10291,"articleLive":2,"columnArticles":125,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":0.4720829397,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"","submitted":19229,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.5047256936941961,"acs":144827,"articleLive":2,"columnArticles":616,"formTitle":"[326]3 的幂","frequency":2.5544170643,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"ac","submitted":286942,"title":"3 的幂","titleSlug":"power-of-three"},{"acceptance":0.4181400540286967,"acs":25849,"articleLive":2,"columnArticles":215,"formTitle":"[327]区间和的个数","frequency":1.7452190502,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","submitted":61819,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6548714040228552,"acs":138337,"articleLive":2,"columnArticles":1149,"formTitle":"[328]奇偶链表","frequency":3.0355020511,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"ac","submitted":211243,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.49042898992736467,"acs":61105,"articleLive":2,"columnArticles":535,"formTitle":"[329]矩阵中的最长递增路径","frequency":2.5544170643,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","submitted":124595,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5321962437715599,"acs":19439,"articleLive":2,"columnArticles":156,"formTitle":"[330]按要求补齐数组","frequency":1.1474135162,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","submitted":36526,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.4793964726271791,"acs":47024,"articleLive":2,"columnArticles":521,"formTitle":"[331]验证二叉树的前序序列化","frequency":1.055182292,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"ac","submitted":98090,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.45113456954462433,"acs":43719,"articleLive":2,"columnArticles":356,"formTitle":"[332]重新安排行程","frequency":1.1474135162,"frontendQuestionId":"332","leaf":true,"level":3,"nodeType":"def","questionId":"332","status":"","submitted":96909,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.4690521369838258,"acs":5191,"articleLive":2,"columnArticles":89,"formTitle":"[333]最大 BST 子树","frequency":0.5792230415,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"","submitted":11067,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.41141916177145843,"acs":51968,"articleLive":2,"columnArticles":340,"formTitle":"[334]递增的三元子序列","frequency":2.2763969028,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","submitted":126314,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.4303616090037516,"acs":16519,"articleLive":2,"columnArticles":148,"formTitle":"[335]路径交叉","frequency":2.0255050395,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"ac","submitted":38384,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.4008628971685095,"acs":22949,"articleLive":2,"columnArticles":198,"formTitle":"[336]回文对","frequency":1.0847265383,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","submitted":57249,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6072554870310398,"acs":143070,"articleLive":2,"columnArticles":1001,"formTitle":"[337]打家劫舍 III","frequency":3.2731247419,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","submitted":235601,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7867063940607847,"acs":173999,"articleLive":2,"columnArticles":1479,"formTitle":"[338]比特位计数","frequency":2.3257652688,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"","submitted":221174,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8196208716044557,"acs":4194,"articleLive":2,"columnArticles":65,"formTitle":"[339]嵌套列表权重和","frequency":0.6403107335,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"","submitted":5117,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.49705785607251196,"acs":13600,"articleLive":2,"columnArticles":200,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":1.479109463,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","questionId":"340","status":"","submitted":27361,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.72595746967397,"acs":54041,"articleLive":2,"columnArticles":506,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":1.6209900502,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"ac","submitted":74441,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5179255134006265,"acs":92256,"articleLive":2,"columnArticles":806,"formTitle":"[342]4的幂","frequency":1.4470622855,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"ac","submitted":178126,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.6098861862290754,"acs":123838,"articleLive":2,"columnArticles":1153,"formTitle":"[343]整数拆分","frequency":3.3976719628,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"ac","submitted":203051,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.774583000029627,"acs":418312,"articleLive":2,"columnArticles":2203,"formTitle":"[344]反转字符串","frequency":3.1048913684,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"ac","submitted":540048,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5400817174842352,"acs":114338,"articleLive":2,"columnArticles":1084,"formTitle":"[345]反转字符串中的元音字母","frequency":2.8193918095,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"ac","submitted":211705,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7092517932876067,"acs":13546,"articleLive":2,"columnArticles":147,"formTitle":"[346]数据流中的移动平均值","frequency":0.5233893954,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"ac","submitted":19099,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.6234793355908907,"acs":224990,"articleLive":2,"columnArticles":1671,"formTitle":"[347]前 K 个高频元素","frequency":3.5055738723,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"ac","submitted":360862,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.602034191733391,"acs":5564,"articleLive":2,"columnArticles":86,"formTitle":"[348]设计井字棋","frequency":0.5233893954,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"","submitted":9242,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.7386395841703183,"acs":237172,"articleLive":2,"columnArticles":1660,"formTitle":"[349]两个数组的交集","frequency":3.489784706,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"ac","submitted":321093,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5525376971799891,"acs":282812,"articleLive":2,"columnArticles":1599,"formTitle":"[350]两个数组的交集 II","frequency":3.3578848869,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"ac","submitted":511842,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.592003393785131,"acs":5582,"articleLive":2,"columnArticles":103,"formTitle":"[351]安卓系统手势解锁","frequency":0.0,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"","submitted":9429,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.6777707609725292,"acs":21465,"articleLive":2,"columnArticles":353,"formTitle":"[352]将数据流变为多个不相交区间","frequency":1.8899799896,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"ac","submitted":31670,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.43029052776345195,"acs":2503,"articleLive":2,"columnArticles":52,"formTitle":"[353]贪吃蛇","frequency":0.5233893954,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"","submitted":5817,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.4584542127232443,"acs":74905,"articleLive":2,"columnArticles":584,"formTitle":"[354]俄罗斯套娃信封问题","frequency":2.5544170643,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","submitted":163386,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.4092165252156835,"acs":29171,"articleLive":2,"columnArticles":486,"formTitle":"[355]设计推特","frequency":1.7452190502,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","submitted":71285,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.35396597663455626,"acs":1727,"articleLive":2,"columnArticles":43,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"","submitted":4879,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.5205662180457116,"acs":26147,"articleLive":2,"columnArticles":417,"formTitle":"[357]计算各个位数不同的数字个数","frequency":1.9219929666,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","submitted":50228,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.3530507338150935,"acs":4739,"articleLive":2,"columnArticles":62,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.60905819,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"","submitted":13423,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.7277027027027027,"acs":5385,"articleLive":2,"columnArticles":63,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"","submitted":7400,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.6034912718204489,"acs":3146,"articleLive":2,"columnArticles":64,"formTitle":"[360]有序转化数组","frequency":0.5792230415,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"","submitted":5213,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5650774183657826,"acs":3686,"articleLive":2,"columnArticles":71,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"","submitted":6523,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6893816477375158,"acs":3824,"articleLive":2,"columnArticles":71,"formTitle":"[362]敲击计数器","frequency":0.5506985748,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"","submitted":5547,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.48781083449454826,"acs":33957,"articleLive":2,"columnArticles":223,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":0.0,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"ac","submitted":69611,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.7310295689348059,"acs":2052,"articleLive":2,"columnArticles":50,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"","submitted":2807,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.36895159197317473,"acs":35540,"articleLive":2,"columnArticles":496,"formTitle":"[365]水壶问题","frequency":2.6151706364,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","submitted":96327,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7668682367918523,"acs":4819,"articleLive":2,"columnArticles":127,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.4972098898,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"","submitted":6284,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.44762428978558677,"acs":123611,"articleLive":2,"columnArticles":985,"formTitle":"[367]有效的完全平方数","frequency":2.2763969028,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","submitted":276149,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.4594427762839895,"acs":43914,"articleLive":2,"columnArticles":466,"formTitle":"[368]最大整除子集","frequency":2.3712246899,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"ac","submitted":95581,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.6190956039803501,"acs":4915,"articleLive":2,"columnArticles":141,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"","submitted":7939,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.7405204460966542,"acs":3984,"articleLive":2,"columnArticles":60,"formTitle":"[370]区间加法","frequency":1.055182292,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"","submitted":5380,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.6128261360572965,"acs":84111,"articleLive":2,"columnArticles":528,"formTitle":"[371]两整数之和","frequency":3.0134382769,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"ac","submitted":137251,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5748809959721713,"acs":36110,"articleLive":2,"columnArticles":373,"formTitle":"[372]超级次方","frequency":1.1474135162,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","submitted":62813,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.4067884556889549,"acs":22735,"articleLive":2,"columnArticles":241,"formTitle":"[373]查找和最小的K对数字","frequency":1.9551921383,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"ac","submitted":55889,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5177618976611876,"acs":90278,"articleLive":2,"columnArticles":616,"formTitle":"[374]猜数字大小","frequency":1.055182292,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"ac","submitted":174362,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.6010517757365025,"acs":34745,"articleLive":2,"columnArticles":273,"formTitle":"[375]猜数字大小 II","frequency":2.6998952865,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"ac","submitted":57807,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.4673562014488959,"acs":85672,"articleLive":2,"columnArticles":901,"formTitle":"[376]摆动序列","frequency":1.8590751815,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"ac","submitted":183312,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5128906109855416,"acs":71479,"articleLive":2,"columnArticles":603,"formTitle":"[377]组合总和 Ⅳ","frequency":1.9551921383,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"ac","submitted":139365,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6288488695424304,"acs":86390,"articleLive":2,"columnArticles":608,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":2.3712246899,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"ac","submitted":137378,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6288269693842449,"acs":3656,"articleLive":2,"columnArticles":78,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"","submitted":5814,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.5057781799379524,"acs":39127,"articleLive":2,"columnArticles":253,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":2.3601980041,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"ac","submitted":77360,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.4388690006674352,"acs":21699,"articleLive":2,"columnArticles":181,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":0.60905819,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","submitted":49443,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.6379460716621848,"acs":17555,"articleLive":2,"columnArticles":140,"formTitle":"[382]链表随机节点","frequency":1.4470622855,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","submitted":27518,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.6423308077072685,"acs":117244,"articleLive":2,"columnArticles":1266,"formTitle":"[383]赎金信","frequency":1.2384767693,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"ac","submitted":182529,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.6068977790432801,"acs":85257,"articleLive":2,"columnArticles":403,"formTitle":"[384]打乱数组","frequency":2.668958606,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"ac","submitted":140480,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.4200429876410532,"acs":7817,"articleLive":2,"columnArticles":94,"formTitle":"[385]迷你语法分析器","frequency":0.0,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"ac","submitted":18610,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7495241603733038,"acs":24415,"articleLive":2,"columnArticles":259,"formTitle":"[386]字典序排数","frequency":2.5225976443,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","submitted":32574,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5388449485800527,"acs":247783,"articleLive":2,"columnArticles":1366,"formTitle":"[387]字符串中的第一个唯一字符","frequency":3.0004384188,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"ac","submitted":459841,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5351628191408042,"acs":7001,"articleLive":2,"columnArticles":132,"formTitle":"[388]文件的最长绝对路径","frequency":1.0847265383,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","submitted":13082,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6899473059698636,"acs":108152,"articleLive":2,"columnArticles":1079,"formTitle":"[389]找不同","frequency":0.4720829397,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","submitted":156754,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.46749603610196366,"acs":7666,"articleLive":2,"columnArticles":103,"formTitle":"[390]消除游戏","frequency":1.6808881918,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","submitted":16398,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.46746460244151,"acs":21559,"articleLive":2,"columnArticles":196,"formTitle":"[391]完美矩形","frequency":2.2101475172,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","submitted":46119,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.5165286461101395,"acs":160362,"articleLive":2,"columnArticles":1719,"formTitle":"[392]判断子序列","frequency":2.491818408,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"ac","submitted":310461,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.39255773882501077,"acs":11847,"articleLive":2,"columnArticles":142,"formTitle":"[393]UTF-8 编码验证","frequency":0.0,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","submitted":30179,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5544845905953085,"acs":133175,"articleLive":2,"columnArticles":1408,"formTitle":"[394]字符串解码","frequency":3.9263490701,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"ac","submitted":240178,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5201142383169642,"acs":55181,"articleLive":2,"columnArticles":450,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":2.6151706364,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"","submitted":106094,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.4377225726176685,"acs":10202,"articleLive":2,"columnArticles":170,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","submitted":23307,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.43170968882602545,"acs":48835,"articleLive":2,"columnArticles":564,"formTitle":"[397]整数替换","frequency":3.0729796706,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","submitted":113120,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6644671314741036,"acs":16011,"articleLive":2,"columnArticles":135,"formTitle":"[398]随机数索引","frequency":0.0,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","submitted":24096,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.5910040748093198,"acs":45252,"articleLive":2,"columnArticles":557,"formTitle":"[399]除法求值","frequency":0.6403107335,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","submitted":76568,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.454447994167971,"acs":42390,"articleLive":2,"columnArticles":482,"formTitle":"[400]第 N 位数字","frequency":2.1201450836,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"ac","submitted":93278,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6155024845128385,"acs":56236,"articleLive":2,"columnArticles":685,"formTitle":"[401]二进制手表","frequency":1.4470622855,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","submitted":91366,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.3266915202260872,"acs":86930,"articleLive":2,"columnArticles":640,"formTitle":"[402]移掉 K 位数字","frequency":3.006194493,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"ac","submitted":266092,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.45539640718562874,"acs":47532,"articleLive":2,"columnArticles":471,"formTitle":"[403]青蛙过河","frequency":2.128636021,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"ac","submitted":104375,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5896797467499051,"acs":113442,"articleLive":2,"columnArticles":1247,"formTitle":"[404]左叶子之和","frequency":3.2328940551,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"ac","submitted":192379,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5595630572065379,"acs":48203,"articleLive":2,"columnArticles":484,"formTitle":"[405]数字转换为十六进制数","frequency":2.6800920989,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"ac","submitted":86144,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7396882141321809,"acs":130768,"articleLive":2,"columnArticles":860,"formTitle":"[406]根据身高重建队列","frequency":2.7318724315,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","submitted":176788,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.5798182775272926,"acs":25334,"articleLive":2,"columnArticles":252,"formTitle":"[407]接雨水 II","frequency":3.2157615477,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"ac","submitted":43693,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.3321329186446227,"acs":4058,"articleLive":2,"columnArticles":84,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"","submitted":12218,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.5559075751636444,"acs":103525,"articleLive":2,"columnArticles":1425,"formTitle":"[409]最长回文串","frequency":2.8907261156,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","submitted":186227,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5691271196697282,"acs":42322,"articleLive":2,"columnArticles":352,"formTitle":"[410]分割数组的最大值","frequency":3.1408158039,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","submitted":74363,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.4962292609351433,"acs":987,"articleLive":2,"columnArticles":26,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"","submitted":1989,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.7099149766764813,"acs":107293,"articleLive":2,"columnArticles":615,"formTitle":"[412]Fizz Buzz","frequency":2.491818408,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"ac","submitted":151135,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6898063288950371,"acs":79783,"articleLive":2,"columnArticles":1040,"formTitle":"[413]等差数列划分","frequency":2.7470013131,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"ac","submitted":115660,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.39408736801037036,"acs":93939,"articleLive":2,"columnArticles":1207,"formTitle":"[414]第三大的数","frequency":2.8504419398,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"ac","submitted":238371,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5411205188966853,"acs":164183,"articleLive":2,"columnArticles":1176,"formTitle":"[415]字符串相加","frequency":3.9841073332,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","submitted":303413,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.5099320753926482,"acs":194740,"articleLive":2,"columnArticles":1119,"formTitle":"[416]分割等和子集","frequency":3.2566396799,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"ac","submitted":381894,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.48656777525825146,"acs":30899,"articleLive":2,"columnArticles":362,"formTitle":"[417]太平洋大西洋水流问题","frequency":2.2763969028,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"ac","submitted":63504,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.3677642459780484,"acs":2446,"articleLive":2,"columnArticles":35,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"","submitted":6651,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7901372070428209,"acs":33343,"articleLive":2,"columnArticles":436,"formTitle":"[419]甲板上的战舰","frequency":0.0394684218,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","submitted":42199,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.21214738054116292,"acs":2948,"articleLive":2,"columnArticles":55,"formTitle":"[420]强密码检验器","frequency":2.1995541978,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","submitted":13896,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6208163777494936,"acs":34631,"articleLive":2,"columnArticles":316,"formTitle":"[421]数组中两个数的最大异或值","frequency":1.4161956376,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"ac","submitted":55783,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.43278048780487804,"acs":2218,"articleLive":2,"columnArticles":55,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"","submitted":5125,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.6120995796492246,"acs":33783,"articleLive":2,"columnArticles":393,"formTitle":"[423]从英文中重建数字","frequency":3.1291742289,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","submitted":55192,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.5328649690081639,"acs":54762,"articleLive":2,"columnArticles":475,"formTitle":"[424]替换后的最长重复字符","frequency":2.6800920989,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"ac","submitted":102769,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6185336806847785,"acs":1662,"articleLive":2,"columnArticles":36,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"","submitted":2687,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6754764930114359,"acs":7974,"articleLive":2,"columnArticles":126,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":1.0847265383,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"","submitted":11805,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.6177616926503341,"acs":4438,"articleLive":2,"columnArticles":74,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","submitted":7184,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.6607223476297969,"acs":2927,"articleLive":2,"columnArticles":57,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"","submitted":4430,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.7052517375098021,"acs":65654,"articleLive":2,"columnArticles":526,"formTitle":"[429]N 叉树的层序遍历","frequency":1.8292079513,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"ac","submitted":93093,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5887887453403462,"acs":46121,"articleLive":2,"columnArticles":699,"formTitle":"[430]扁平化多级双向链表","frequency":2.2101475172,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"ac","submitted":78332,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.727475800446761,"acs":977,"articleLive":2,"columnArticles":32,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"771","status":"","submitted":1343,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.3821693747982352,"acs":7103,"articleLive":2,"columnArticles":98,"formTitle":"[432]全 O(1) 的数据结构","frequency":2.0628228025,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","submitted":18586,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.53320458509843,"acs":17118,"articleLive":2,"columnArticles":241,"formTitle":"[433]最小基因变化","frequency":1.4161956376,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","submitted":32104,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.3982815052386566,"acs":66562,"articleLive":2,"columnArticles":910,"formTitle":"[434]字符串中的单词数","frequency":3.2157615477,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"ac","submitted":167123,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5064422957329292,"acs":109939,"articleLive":2,"columnArticles":964,"formTitle":"[435]无重叠区间","frequency":2.8275738221,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"ac","submitted":217081,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.490064902646031,"acs":9816,"articleLive":2,"columnArticles":166,"formTitle":"[436]寻找右区间","frequency":0.5233893954,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"ac","submitted":20030,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5742426828227665,"acs":134591,"articleLive":2,"columnArticles":1089,"formTitle":"[437]路径总和 III","frequency":2.9501259975,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"ac","submitted":234380,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5364692677885081,"acs":132877,"articleLive":2,"columnArticles":1148,"formTitle":"[438]找到字符串中所有字母异位词","frequency":1.9672086251,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"ac","submitted":247688,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5914669783752192,"acs":3036,"articleLive":2,"columnArticles":71,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"","submitted":5133,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.38211574442461127,"acs":17768,"articleLive":2,"columnArticles":134,"formTitle":"[440]字典序的第K小数字","frequency":3.2137656984,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","submitted":46499,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.45875885076252726,"acs":80859,"articleLive":2,"columnArticles":776,"formTitle":"[441]排列硬币","frequency":2.6800920989,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"ac","submitted":176256,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6978866687342165,"acs":47256,"articleLive":2,"columnArticles":478,"formTitle":"[442]数组中重复的数据","frequency":3.0355020511,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","submitted":67713,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.477436903234138,"acs":59153,"articleLive":2,"columnArticles":719,"formTitle":"[443]压缩字符串","frequency":2.8868938123,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"ac","submitted":123897,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.25617685305591675,"acs":3743,"articleLive":2,"columnArticles":57,"formTitle":"[444]序列重建","frequency":0.60905819,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"","submitted":14611,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5906480666805473,"acs":87941,"articleLive":2,"columnArticles":992,"formTitle":"[445]两数相加 II","frequency":2.0628228025,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"ac","submitted":148889,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.550624479600333,"acs":19839,"articleLive":2,"columnArticles":176,"formTitle":"[446]等差数列划分 II - 子序列","frequency":2.3712246899,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"ac","submitted":36030,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6635319262623564,"acs":49672,"articleLive":2,"columnArticles":387,"formTitle":"[447]回旋镖的数量","frequency":2.3385286839,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"ac","submitted":74860,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6511699984503332,"acs":151272,"articleLive":2,"columnArticles":1189,"formTitle":"[448]找到所有数组中消失的数字","frequency":2.3926446821,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","submitted":232308,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5618643787060655,"acs":16961,"articleLive":2,"columnArticles":151,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":0.5233893954,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"ac","submitted":30187,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.4903694029097127,"acs":72838,"articleLive":2,"columnArticles":717,"formTitle":"[450]删除二叉搜索树中的节点","frequency":2.3314162784,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","submitted":148537,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.712026345747276,"acs":87565,"articleLive":2,"columnArticles":1007,"formTitle":"[451]根据字符出现频率排序","frequency":3.1693402707,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"ac","submitted":122980,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5078632510866183,"acs":107731,"articleLive":2,"columnArticles":945,"formTitle":"[452]用最少数量的箭引爆气球","frequency":2.6389983064,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"ac","submitted":212126,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.611436218231252,"acs":57571,"articleLive":2,"columnArticles":693,"formTitle":"[453]最小操作次数使数组元素相等","frequency":2.8825327063,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"ac","submitted":94157,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.6091547596892813,"acs":88378,"articleLive":2,"columnArticles":558,"formTitle":"[454]四数相加 II","frequency":3.0095965511,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"ac","submitted":145083,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5759593553050898,"acs":169707,"articleLive":2,"columnArticles":1385,"formTitle":"[455]分发饼干","frequency":3.2173802472,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"ac","submitted":294651,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.3627695440384815,"acs":59504,"articleLive":2,"columnArticles":473,"formTitle":"[456]132 模式","frequency":2.0628228025,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"ac","submitted":164027,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.4352653753876763,"acs":29753,"articleLive":2,"columnArticles":338,"formTitle":"[457]环形数组是否存在循环","frequency":2.2763969028,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"ac","submitted":68356,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6982180954956579,"acs":23236,"articleLive":2,"columnArticles":212,"formTitle":"[458]可怜的小猪","frequency":2.8100372043,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","submitted":33279,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5095876493326015,"acs":87273,"articleLive":2,"columnArticles":700,"formTitle":"[459]重复的子字符串","frequency":2.1634100394,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","submitted":171262,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.4345102639296188,"acs":37042,"articleLive":2,"columnArticles":427,"formTitle":"[460]LFU 缓存","frequency":2.5544170643,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","submitted":85250,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8130875186183497,"acs":180690,"articleLive":2,"columnArticles":1442,"formTitle":"[461]汉明距离","frequency":1.8003142275,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"ac","submitted":222227,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.60969868173258,"acs":15540,"articleLive":2,"columnArticles":149,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":1.4161956376,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","submitted":25488,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7049804884612797,"acs":83825,"articleLive":2,"columnArticles":1014,"formTitle":"[463]岛屿的周长","frequency":2.5544170643,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","submitted":118904,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.35463905599259604,"acs":12262,"articleLive":2,"columnArticles":118,"formTitle":"[464]我能赢吗","frequency":1.2518925863,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","submitted":34576,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.5350931677018633,"acs":1723,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":1.055182292,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"","submitted":3220,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.37305780964961943,"acs":11861,"articleLive":2,"columnArticles":184,"formTitle":"[466]统计重复个数","frequency":1.6209900502,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","submitted":31794,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.44252071116075586,"acs":9508,"articleLive":2,"columnArticles":123,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":1.0847265383,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","submitted":21486,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.25311007004035435,"acs":27284,"articleLive":2,"columnArticles":321,"formTitle":"[468]验证IP地址","frequency":2.5191275874,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","submitted":107795,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.4318738101713353,"acs":1588,"articleLive":2,"columnArticles":21,"formTitle":"[469]凸多边形","frequency":0.865557335,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"","submitted":3677,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.5476028302869552,"acs":68337,"articleLive":2,"columnArticles":352,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":3.1501064427,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"ac","submitted":124793,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.601984126984127,"acs":1517,"articleLive":2,"columnArticles":26,"formTitle":"[471]编码最短长度的字符串","frequency":1.9439887946,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"","submitted":2520,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.38983421786945344,"acs":7125,"articleLive":2,"columnArticles":89,"formTitle":"[472]连接词","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","submitted":18277,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.42108024021416685,"acs":23279,"articleLive":2,"columnArticles":203,"formTitle":"[473]火柴拼正方形","frequency":2.2426782668,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","submitted":55284,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6155754900707566,"acs":81866,"articleLive":2,"columnArticles":653,"formTitle":"[474]一和零","frequency":2.1189385052,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"ac","submitted":132991,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.40167595043603943,"acs":49468,"articleLive":2,"columnArticles":560,"formTitle":"[475]供暖器","frequency":2.5716055246,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","submitted":123154,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7123499513355683,"acs":65871,"articleLive":2,"columnArticles":886,"formTitle":"[476]数字的补数","frequency":2.17872662,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"ac","submitted":92470,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6039726690047164,"acs":39954,"articleLive":2,"columnArticles":340,"formTitle":"[477]汉明距离总和","frequency":0.5233893954,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"ac","submitted":66152,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.4452014907989751,"acs":7645,"articleLive":2,"columnArticles":55,"formTitle":"[478]在圆内随机生成点","frequency":1.1474135162,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","submitted":17172,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.43125719401457985,"acs":3372,"articleLive":2,"columnArticles":34,"formTitle":"[479]最大回文数乘积","frequency":1.1474135162,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"ac","submitted":7819,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.4475172755634604,"acs":30697,"articleLive":2,"columnArticles":418,"formTitle":"[480]滑动窗口中位数","frequency":2.2763969028,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"ac","submitted":68594,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.5486663751639703,"acs":6274,"articleLive":2,"columnArticles":107,"formTitle":"[481]神奇字符串","frequency":0.0,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","submitted":11435,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.47266913050213555,"acs":42717,"articleLive":2,"columnArticles":454,"formTitle":"[482]密钥格式化","frequency":1.4470622855,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"ac","submitted":90374,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5898740664811832,"acs":16113,"articleLive":2,"columnArticles":121,"formTitle":"[483]最小好进制","frequency":0.0,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"ac","submitted":27316,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.631578947368421,"acs":1608,"articleLive":2,"columnArticles":36,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"","submitted":2546,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6087201228992033,"acs":131948,"articleLive":2,"columnArticles":1069,"formTitle":"[485]最大连续 1 的个数","frequency":2.9157347127,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","submitted":216763,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5871728668921294,"acs":48440,"articleLive":2,"columnArticles":415,"formTitle":"[486]预测赢家","frequency":2.3712246899,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"ac","submitted":82497,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5786396574440053,"acs":7027,"articleLive":2,"columnArticles":131,"formTitle":"[487]最大连续1的个数 II","frequency":1.3864315356,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"","submitted":12144,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.5259337935917862,"acs":17826,"articleLive":2,"columnArticles":174,"formTitle":"[488]祖玛游戏","frequency":3.0286592709,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"ac","submitted":33894,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.7350194552529183,"acs":1889,"articleLive":2,"columnArticles":26,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"","submitted":2570,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.4855091555789751,"acs":7371,"articleLive":2,"columnArticles":89,"formTitle":"[490]迷宫","frequency":0.4972098898,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"","submitted":15182,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.54067504561119,"acs":53343,"articleLive":2,"columnArticles":453,"formTitle":"[491]递增子序列","frequency":2.2426782668,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"ac","submitted":98660,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.6051134107932139,"acs":45726,"articleLive":2,"columnArticles":440,"formTitle":"[492]构造矩形","frequency":2.2426782668,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","submitted":75566,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.347016947016947,"acs":27541,"articleLive":2,"columnArticles":277,"formTitle":"[493]翻转对","frequency":1.1474135162,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","submitted":79365,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.4915363075253999,"acs":167636,"articleLive":2,"columnArticles":1132,"formTitle":"[494]目标和","frequency":2.8825327063,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"ac","submitted":341045,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.6065868044107411,"acs":66232,"articleLive":2,"columnArticles":952,"formTitle":"[495]提莫攻击","frequency":2.7779989787,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"ac","submitted":109188,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.7050845504012602,"acs":146812,"articleLive":2,"columnArticles":1501,"formTitle":"[496]下一个更大元素 I","frequency":2.7318724315,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"ac","submitted":208219,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.4053756872327428,"acs":3318,"articleLive":2,"columnArticles":41,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.60905819,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","submitted":8185,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.47858789396287904,"acs":48167,"articleLive":2,"columnArticles":503,"formTitle":"[498]对角线遍历","frequency":2.6470758948,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","submitted":100644,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.3776725304465494,"acs":2791,"articleLive":2,"columnArticles":51,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"","submitted":7390,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.7444794952681388,"acs":52864,"articleLive":2,"columnArticles":773,"formTitle":"[500]键盘行","frequency":2.17872662,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"ac","submitted":71008,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5174891177257808,"acs":73470,"articleLive":2,"columnArticles":600,"formTitle":"[501]二叉搜索树中的众数","frequency":2.4767986003,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","submitted":141974,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.44100273312369587,"acs":30012,"articleLive":2,"columnArticles":364,"formTitle":"[502]IPO","frequency":2.3712246899,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"ac","submitted":68054,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6403093238064013,"acs":113272,"articleLive":2,"columnArticles":1065,"formTitle":"[503]下一个更大元素 II","frequency":2.6055660292,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"ac","submitted":176902,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5035781261720801,"acs":33566,"articleLive":2,"columnArticles":360,"formTitle":"[504]七进制数","frequency":0.4720829397,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","submitted":66655,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.49070484929989716,"acs":6203,"articleLive":2,"columnArticles":72,"formTitle":"[505]迷宫 II","frequency":0.6731005563,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"","submitted":12641,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.6535078136678817,"acs":56831,"articleLive":2,"columnArticles":733,"formTitle":"[506]相对名次","frequency":1.3449630011,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","submitted":86963,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.4198309231904509,"acs":32429,"articleLive":2,"columnArticles":259,"formTitle":"[507]完美数","frequency":1.0267308708,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","submitted":77243,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6799208193476203,"acs":15800,"articleLive":2,"columnArticles":231,"formTitle":"[508]出现次数最多的子树元素和","frequency":1.4161956376,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","submitted":23238,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6705655935275323,"acs":287104,"articleLive":2,"columnArticles":1687,"formTitle":"[509]斐波那契数","frequency":3.0436520555,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"ac","submitted":428152,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6094785119755394,"acs":3588,"articleLive":2,"columnArticles":59,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":0.0,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"","submitted":5887,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7300020354162426,"acs":21519,"articleLive":2,"columnArticles":118,"formTitle":"[511]游戏玩法分析 I","frequency":1.4161956376,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"","submitted":29478,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5385818422796554,"acs":20318,"articleLive":2,"columnArticles":161,"formTitle":"[512]游戏玩法分析 II","frequency":0.5233893954,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"","submitted":37725,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7312595489824605,"acs":59828,"articleLive":2,"columnArticles":669,"formTitle":"[513]找树左下角的值","frequency":1.055182292,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","submitted":81815,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.49877468999656915,"acs":20353,"articleLive":2,"columnArticles":253,"formTitle":"[514]自由之路","frequency":0.5233893954,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","submitted":40806,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.6489193386846269,"acs":44706,"articleLive":2,"columnArticles":478,"formTitle":"[515]在每个树行中找最大值","frequency":1.0267308708,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","submitted":68893,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6579561942928212,"acs":95226,"articleLive":2,"columnArticles":686,"formTitle":"[516]最长回文子序列","frequency":3.2461200117,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"ac","submitted":144730,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.5086699253923335,"acs":19772,"articleLive":2,"columnArticles":170,"formTitle":"[517]超级洗衣机","frequency":2.9857931162,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"ac","submitted":38870,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.6639385482578541,"acs":120143,"articleLive":2,"columnArticles":746,"formTitle":"[518]零钱兑换 II","frequency":3.2005967218,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"ac","submitted":180955,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.4701671802586562,"acs":19377,"articleLive":2,"columnArticles":190,"formTitle":"[519]随机翻转矩阵","frequency":1.3767427891,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","submitted":41213,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5760765389336338,"acs":68522,"articleLive":2,"columnArticles":1050,"formTitle":"[520]检测大写字母","frequency":2.2101475172,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"ac","submitted":118946,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7128689178409997,"acs":26811,"articleLive":2,"columnArticles":271,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":0.4972098898,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","submitted":37610,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.3621691413815365,"acs":7293,"articleLive":2,"columnArticles":115,"formTitle":"[522]最长特殊序列 II","frequency":1.479109463,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","submitted":20137,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.27606551367286697,"acs":72293,"articleLive":2,"columnArticles":625,"formTitle":"[523]连续的子数组和","frequency":1.2155249421,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"ac","submitted":261869,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.49654949599379683,"acs":76846,"articleLive":2,"columnArticles":792,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":2.7470013131,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"ac","submitted":154760,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5372615628736492,"acs":48079,"articleLive":2,"columnArticles":542,"formTitle":"[525]连续数组","frequency":2.6470758948,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"ac","submitted":89489,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7344794852863622,"acs":34818,"articleLive":2,"columnArticles":398,"formTitle":"[526]优美的排列","frequency":3.1063030204,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"ac","submitted":47405,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5768692243069168,"acs":2060,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"","submitted":3571,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.47906412725586706,"acs":33580,"articleLive":2,"columnArticles":268,"formTitle":"[528]按权重随机选择","frequency":2.5873472706,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"ac","submitted":70095,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6435978604955791,"acs":41272,"articleLive":2,"columnArticles":480,"formTitle":"[529]扫雷游戏","frequency":1.6504212504,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","submitted":64127,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6211863801841673,"acs":87022,"articleLive":2,"columnArticles":698,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":0.3852459659,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"ac","submitted":140090,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6625242091672047,"acs":4105,"articleLive":2,"columnArticles":80,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"","submitted":6196,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.37904050445946713,"acs":26689,"articleLive":2,"columnArticles":296,"formTitle":"[532]数组中的 k-diff 数对","frequency":0.4720829397,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","submitted":70412,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5259701492537313,"acs":1762,"articleLive":2,"columnArticles":35,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"","submitted":3350,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6750147318797879,"acs":16037,"articleLive":2,"columnArticles":150,"formTitle":"[534]游戏玩法分析 III","frequency":0.5233893954,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"","submitted":23758,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8443398613430494,"acs":16685,"articleLive":2,"columnArticles":109,"formTitle":"[535]TinyURL 的加密与解密","frequency":1.0847265383,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","submitted":19761,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5353040281819574,"acs":3495,"articleLive":2,"columnArticles":58,"formTitle":"[536]从字符串生成二叉树","frequency":1.1474135162,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"","submitted":6529,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7133633114262654,"acs":12374,"articleLive":2,"columnArticles":191,"formTitle":"[537]复数乘法","frequency":0.0,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","submitted":17346,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.7111754883855399,"acs":120535,"articleLive":2,"columnArticles":927,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":1.5649843742,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","submitted":169487,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.6010510682051868,"acs":15783,"articleLive":2,"columnArticles":220,"formTitle":"[539]最小时间差","frequency":1.9551921383,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","submitted":26259,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5833964919878736,"acs":43106,"articleLive":2,"columnArticles":445,"formTitle":"[540]有序数组中的单一元素","frequency":2.17872662,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"ac","submitted":73888,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6022272986864649,"acs":82251,"articleLive":2,"columnArticles":868,"formTitle":"[541]反转字符串 II","frequency":2.7893182311,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"ac","submitted":136578,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.4576521653463453,"acs":78972,"articleLive":2,"columnArticles":722,"formTitle":"[542]01 矩阵","frequency":2.7318724315,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"ac","submitted":172559,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.5567154803236832,"acs":164839,"articleLive":2,"columnArticles":1325,"formTitle":"[543]二叉树的直径","frequency":3.3645764488,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","submitted":296092,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7115554248750368,"acs":2420,"articleLive":2,"columnArticles":57,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"","submitted":3401,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.423843334860284,"acs":3701,"articleLive":2,"columnArticles":79,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"","submitted":8732,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6264098701087177,"acs":15384,"articleLive":2,"columnArticles":123,"formTitle":"[546]移除盒子","frequency":0.60905819,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","submitted":24559,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6187941218592921,"acs":177149,"articleLive":2,"columnArticles":1239,"formTitle":"[547]省份数量","frequency":2.0099703443,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"ac","submitted":286281,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.3550468262226847,"acs":1706,"articleLive":2,"columnArticles":42,"formTitle":"[548]将数组分割成和相等的子数组","frequency":1.055182292,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","questionId":"548","status":"","submitted":4805,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.4894461859979101,"acs":2342,"articleLive":2,"columnArticles":53,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"","submitted":4785,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.4378765874609894,"acs":14171,"articleLive":2,"columnArticles":197,"formTitle":"[550]游戏玩法分析 IV","frequency":1.1474135162,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"","submitted":32363,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.5674522174800519,"acs":61160,"articleLive":2,"columnArticles":776,"formTitle":"[551]学生出勤记录 I","frequency":2.4522875692,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"ac","submitted":107780,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5771108086544328,"acs":24593,"articleLive":2,"columnArticles":289,"formTitle":"[552]学生出勤记录 II","frequency":2.4205724375,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"ac","submitted":42614,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6062924356890121,"acs":6340,"articleLive":2,"columnArticles":98,"formTitle":"[553]最优除法","frequency":0.0,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","submitted":10457,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5040928566860651,"acs":47295,"articleLive":2,"columnArticles":494,"formTitle":"[554]砖墙","frequency":2.128636021,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"ac","submitted":93822,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.344271901552886,"acs":1175,"articleLive":2,"columnArticles":24,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"","submitted":3413,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.3293230637917369,"acs":16205,"articleLive":2,"columnArticles":243,"formTitle":"[556]下一个更大元素 III","frequency":2.2101475172,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","submitted":49207,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7434558946872329,"acs":186145,"articleLive":2,"columnArticles":1556,"formTitle":"[557]反转字符串中的单词 III","frequency":3.4187537404,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"ac","submitted":250378,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5047540983606558,"acs":3079,"articleLive":2,"columnArticles":42,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","questionId":"773","status":"","submitted":6100,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7400527266513695,"acs":90951,"articleLive":2,"columnArticles":807,"formTitle":"[559]N 叉树的最大深度","frequency":1.9722632254,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","submitted":122898,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.44623767391686636,"acs":170017,"articleLive":2,"columnArticles":1034,"formTitle":"[560]和为 K 的子数组","frequency":3.918624638,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","submitted":381001,"title":"和为 K 的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7764523158990372,"acs":95485,"articleLive":2,"columnArticles":791,"formTitle":"[561]数组拆分 I","frequency":1.7124614537,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"ac","submitted":122976,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.47235280949182895,"acs":4220,"articleLive":2,"columnArticles":69,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.5792230415,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"","submitted":8934,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.654180900367719,"acs":60131,"articleLive":2,"columnArticles":603,"formTitle":"[563]二叉树的坡度","frequency":2.405109009,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","submitted":91918,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.18192334387290815,"acs":4718,"articleLive":2,"columnArticles":84,"formTitle":"[564]寻找最近的回文数","frequency":1.1474135162,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"notac","submitted":25934,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.60678327476606,"acs":15368,"articleLive":2,"columnArticles":151,"formTitle":"[565]数组嵌套","frequency":1.479109463,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","submitted":25327,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.6789282086014223,"acs":80195,"articleLive":2,"columnArticles":756,"formTitle":"[566]重塑矩阵","frequency":2.5873472706,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"ac","submitted":118120,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.4337945064222584,"acs":139245,"articleLive":2,"columnArticles":1254,"formTitle":"[567]字符串的排列","frequency":3.2328940551,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"ac","submitted":320993,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.5066079295154186,"acs":1265,"articleLive":2,"columnArticles":26,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"","submitted":2497,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.5645186215422655,"acs":10959,"articleLive":2,"columnArticles":168,"formTitle":"[569]员工薪水中位数","frequency":1.9896640473,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"","submitted":19413,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6587718503758717,"acs":14547,"articleLive":2,"columnArticles":120,"formTitle":"[570]至少有5名直接下属的经理","frequency":0.5233893954,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"","submitted":22082,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.4776654294125176,"acs":7464,"articleLive":2,"columnArticles":101,"formTitle":"[571]给定数字的频率查询中位数","frequency":0.60905819,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"","submitted":15626,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.4739474739374499,"acs":94562,"articleLive":2,"columnArticles":815,"formTitle":"[572]另一棵树的子树","frequency":2.8504419398,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"ac","submitted":199520,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6570915619389587,"acs":1098,"articleLive":2,"columnArticles":35,"formTitle":"[573]松鼠模拟","frequency":0.0,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"","submitted":1671,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.6496037596756358,"acs":14099,"articleLive":2,"columnArticles":121,"formTitle":"[574]当选者","frequency":0.4972098898,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"","submitted":21704,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.7119042181841908,"acs":87288,"articleLive":2,"columnArticles":842,"formTitle":"[575]分糖果","frequency":3.1063030204,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"ac","submitted":122612,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.4683823657184562,"acs":26954,"articleLive":2,"columnArticles":291,"formTitle":"[576]出界的路径数","frequency":2.2763969028,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"ac","submitted":57547,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.6988216172287688,"acs":17198,"articleLive":2,"columnArticles":93,"formTitle":"[577]员工奖金","frequency":1.6808881918,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"","submitted":24610,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.48539197109240734,"acs":11015,"articleLive":2,"columnArticles":125,"formTitle":"[578]查询回答率最高的问题","frequency":1.1474135162,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"","submitted":22693,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.4098557116149753,"acs":8550,"articleLive":2,"columnArticles":139,"formTitle":"[579]查询员工的累计薪水","frequency":0.5792230415,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"","submitted":20861,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5228628230616302,"acs":11309,"articleLive":2,"columnArticles":87,"formTitle":"[580]统计各专业学生人数","frequency":1.5124236696,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"","submitted":21629,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.40597099279784316,"acs":106310,"articleLive":2,"columnArticles":911,"formTitle":"[581]最短无序连续子数组","frequency":2.9833737407,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"ac","submitted":261866,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.4170447908711083,"acs":9283,"articleLive":2,"columnArticles":144,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"","submitted":22259,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.6267377431734481,"acs":56669,"articleLive":2,"columnArticles":533,"formTitle":"[583]两个字符串的删除操作","frequency":3.3186731461,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"ac","submitted":90419,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7738125157074642,"acs":15395,"articleLive":2,"columnArticles":65,"formTitle":"[584]寻找用户推荐人","frequency":0.5506985748,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"","submitted":19895,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.5750478897608602,"acs":9306,"articleLive":2,"columnArticles":115,"formTitle":"[585]2016年的投资","frequency":0.5506985748,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"","submitted":16183,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7432936255342366,"acs":16348,"articleLive":2,"columnArticles":92,"formTitle":"[586]订单最多的客户","frequency":1.1154414835,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"","submitted":21994,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.39073634204275537,"acs":2303,"articleLive":2,"columnArticles":39,"formTitle":"[587]安装栅栏","frequency":0.0,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","submitted":5894,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.42507492507492506,"acs":1702,"articleLive":2,"columnArticles":31,"formTitle":"[588]设计内存文件系统","frequency":1.7018094569,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"","submitted":4004,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7465824284304048,"acs":94536,"articleLive":2,"columnArticles":609,"formTitle":"[589]N 叉树的前序遍历","frequency":1.5382983344,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","submitted":126625,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7633488499452354,"acs":66906,"articleLive":2,"columnArticles":502,"formTitle":"[590]N 叉树的后序遍历","frequency":0.0,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","submitted":87648,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.34179446500969507,"acs":1939,"articleLive":2,"columnArticles":43,"formTitle":"[591]标签验证器","frequency":1.4161956376,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"ac","submitted":5673,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5274929085751691,"acs":4835,"articleLive":2,"columnArticles":115,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","submitted":9166,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.44274063583532747,"acs":9066,"articleLive":2,"columnArticles":145,"formTitle":"[593]有效的正方形","frequency":1.8899799896,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","submitted":20477,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5660006457617139,"acs":59601,"articleLive":2,"columnArticles":544,"formTitle":"[594]最长和谐子序列","frequency":2.4205724375,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","submitted":105302,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.7904298763329918,"acs":109552,"articleLive":2,"columnArticles":253,"formTitle":"[595]大的国家","frequency":1.8292079513,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","submitted":138598,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.4318086981281204,"acs":87959,"articleLive":2,"columnArticles":315,"formTitle":"[596]超过5名学生的课","frequency":2.3712246899,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","submitted":203699,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.44164256795835743,"acs":11454,"articleLive":2,"columnArticles":88,"formTitle":"[597]好友申请 I:总体通过率","frequency":0.5506985748,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"","submitted":25935,"title":"好友申请 I:总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5710425549249111,"acs":42055,"articleLive":2,"columnArticles":493,"formTitle":"[598]范围求和 II","frequency":2.4522875692,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","submitted":73646,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5218734511812324,"acs":31589,"articleLive":2,"columnArticles":303,"formTitle":"[599]两个列表的最小索引总和","frequency":0.5792230415,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"ac","submitted":60530,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.48235553055684627,"acs":19724,"articleLive":2,"columnArticles":239,"formTitle":"[600]不含连续1的非负整数","frequency":2.5191275874,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"ac","submitted":40891,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.5052400320636523,"acs":34036,"articleLive":2,"columnArticles":407,"formTitle":"[601]体育馆的人流量","frequency":1.9219929666,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","submitted":67366,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6190867955573838,"acs":9030,"articleLive":2,"columnArticles":99,"formTitle":"[602]好友申请 II :谁有最多的好友","frequency":1.180738826,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"","submitted":14586,"title":"好友申请 II :谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6692747376311844,"acs":14285,"articleLive":2,"columnArticles":124,"formTitle":"[603]连续空余座位","frequency":1.1154414835,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"","submitted":21344,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.3740425531914894,"acs":2637,"articleLive":2,"columnArticles":62,"formTitle":"[604]迭代压缩字符串","frequency":0.0,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"","submitted":7050,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.3323272560571072,"acs":116713,"articleLive":2,"columnArticles":1336,"formTitle":"[605]种花问题","frequency":2.5225976443,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","submitted":351199,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.5733279390941356,"acs":31177,"articleLive":2,"columnArticles":339,"formTitle":"[606]根据二叉树创建字符串","frequency":0.4972098898,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","submitted":54379,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.661988190881812,"acs":13678,"articleLive":2,"columnArticles":96,"formTitle":"[607]销售员","frequency":1.1474135162,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"","submitted":20662,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.6239570917759237,"acs":8376,"articleLive":2,"columnArticles":109,"formTitle":"[608]树节点","frequency":1.1474135162,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"","submitted":13424,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.48813087365123564,"acs":7012,"articleLive":2,"columnArticles":110,"formTitle":"[609]在系统中查找重复文件","frequency":0.0,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","submitted":14365,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6636202661792426,"acs":11618,"articleLive":2,"columnArticles":81,"formTitle":"[610]判断三角形","frequency":0.0,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"","submitted":17507,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.5325216811207472,"acs":54281,"articleLive":2,"columnArticles":421,"formTitle":"[611]有效三角形的个数","frequency":4.1124735774,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"ac","submitted":101932,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6635476324917319,"acs":8226,"articleLive":2,"columnArticles":71,"formTitle":"[612]平面上的最近距离","frequency":1.1154414835,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"","submitted":12397,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8151147959183673,"acs":12781,"articleLive":2,"columnArticles":88,"formTitle":"[613]直线上的最近距离","frequency":0.0,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"","submitted":15680,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.35158113410787106,"acs":9139,"articleLive":2,"columnArticles":75,"formTitle":"[614]二级关注者","frequency":1.479109463,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"","submitted":25994,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.423901277332756,"acs":5874,"articleLive":2,"columnArticles":95,"formTitle":"[615]平均工资:部门与公司比较","frequency":0.0,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"","submitted":13857,"title":"平均工资:部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.46767160832191357,"acs":3754,"articleLive":2,"columnArticles":64,"formTitle":"[616]给字符串添加加粗标签","frequency":1.4470622855,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"","submitted":8027,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7867552658159471,"acs":212645,"articleLive":2,"columnArticles":1397,"formTitle":"[617]合并二叉树","frequency":3.2079551068,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"ac","submitted":270281,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.620414673046252,"acs":5057,"articleLive":2,"columnArticles":51,"formTitle":"[618]学生地理信息报告","frequency":0.5233893954,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"","submitted":8151,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.46381385789782736,"acs":12638,"articleLive":2,"columnArticles":87,"formTitle":"[619]只出现一次的最大数字","frequency":1.0847265383,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"","submitted":27248,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7726946537495515,"acs":99061,"articleLive":2,"columnArticles":337,"formTitle":"[620]有趣的电影","frequency":2.0628228025,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","submitted":128202,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.574063131278429,"acs":83548,"articleLive":2,"columnArticles":542,"formTitle":"[621]任务调度器","frequency":3.1766045769,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","submitted":145538,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.4403586837608939,"acs":71649,"articleLive":2,"columnArticles":471,"formTitle":"[622]设计循环队列","frequency":2.0316190228,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"ac","submitted":162706,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5464130185652074,"acs":11920,"articleLive":2,"columnArticles":200,"formTitle":"[623]在二叉树中增加一行","frequency":0.0,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","submitted":21815,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.42335099579755164,"acs":2317,"articleLive":2,"columnArticles":54,"formTitle":"[624]数组列表中的最大距离","frequency":0.865557335,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"","submitted":5473,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.3443874193972891,"acs":2617,"articleLive":2,"columnArticles":55,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"","submitted":7599,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.6841273425152404,"acs":48480,"articleLive":2,"columnArticles":384,"formTitle":"[626]换座位","frequency":1.055182292,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","submitted":70864,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.8093958769903103,"acs":90382,"articleLive":2,"columnArticles":369,"formTitle":"[627]变更性别","frequency":1.055182292,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","submitted":111666,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5243184865186951,"acs":84474,"articleLive":2,"columnArticles":805,"formTitle":"[628]三个数的最大乘积","frequency":1.4470622855,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"ac","submitted":161112,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.5218615435574694,"acs":18906,"articleLive":2,"columnArticles":172,"formTitle":"[629]K个逆序对数组","frequency":2.8347909435,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"ac","submitted":36228,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.46322974880590956,"acs":23955,"articleLive":2,"columnArticles":225,"formTitle":"[630]课程表 III","frequency":1.2997852857,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","submitted":51713,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.29378675530554843,"acs":1149,"articleLive":2,"columnArticles":36,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"","submitted":3911,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5991658232894778,"acs":19537,"articleLive":2,"columnArticles":248,"formTitle":"[632]最小区间","frequency":0.5506985748,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","submitted":32607,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.3953167602245389,"acs":98592,"articleLive":2,"columnArticles":804,"formTitle":"[633]平方数之和","frequency":1.4470622855,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"ac","submitted":249400,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.44001208824418253,"acs":1456,"articleLive":2,"columnArticles":22,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"","submitted":3309,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.5525609756097561,"acs":4531,"articleLive":2,"columnArticles":74,"formTitle":"[635]设计日志存储系统","frequency":0.6731005563,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"","submitted":8200,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.5577002690954254,"acs":10777,"articleLive":2,"columnArticles":124,"formTitle":"[636]函数的独占时间","frequency":0.0,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"ac","submitted":19324,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6909642616318273,"acs":81976,"articleLive":2,"columnArticles":701,"formTitle":"[637]二叉树的层平均值","frequency":1.4470622855,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","submitted":118640,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.6456951408719898,"acs":28716,"articleLive":2,"columnArticles":274,"formTitle":"[638]大礼包","frequency":2.405109009,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"ac","submitted":44473,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.376363268534015,"acs":20464,"articleLive":2,"columnArticles":275,"formTitle":"[639]解码方法 II","frequency":2.4402681938,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"ac","submitted":54373,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.42656526486201574,"acs":11330,"articleLive":2,"columnArticles":227,"formTitle":"[640]求解方程","frequency":0.4972098898,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","submitted":26561,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5315256081801074,"acs":23444,"articleLive":2,"columnArticles":268,"formTitle":"[641]设计循环双端队列","frequency":1.0267308708,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","submitted":44107,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.4982350864807624,"acs":2823,"articleLive":2,"columnArticles":60,"formTitle":"[642]设计搜索自动补全系统","frequency":0.6731005563,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"","submitted":5666,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.448119269985434,"acs":67990,"articleLive":2,"columnArticles":617,"formTitle":"[643]子数组最大平均数 I","frequency":1.3864315356,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","submitted":151723,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.40522022838499183,"acs":1242,"articleLive":2,"columnArticles":26,"formTitle":"[644]子数组最大平均数 II","frequency":1.5124236696,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"","submitted":3065,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.42910666406236125,"acs":72498,"articleLive":2,"columnArticles":736,"formTitle":"[645]错误的集合","frequency":1.8590751815,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"ac","submitted":168951,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5801737377615666,"acs":24177,"articleLive":2,"columnArticles":221,"formTitle":"[646]最长数对链","frequency":0.0,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","submitted":41672,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6588934569755003,"acs":137347,"articleLive":2,"columnArticles":1007,"formTitle":"[647]回文子串","frequency":3.006194493,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","submitted":208451,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.5897812065258632,"acs":23317,"articleLive":2,"columnArticles":307,"formTitle":"[648]单词替换","frequency":0.5506985748,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","submitted":39535,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.4800850302081002,"acs":30037,"articleLive":2,"columnArticles":316,"formTitle":"[649]Dota2 参议院","frequency":1.4470622855,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","submitted":62566,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5677803952796487,"acs":51337,"articleLive":2,"columnArticles":672,"formTitle":"[650]只有两个键的键盘","frequency":2.3712246899,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"ac","submitted":90417,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.5823060188542422,"acs":4015,"articleLive":2,"columnArticles":67,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"","submitted":6895,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.5712350695727128,"acs":37112,"articleLive":2,"columnArticles":264,"formTitle":"[652]寻找重复的子树","frequency":2.9157347127,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"ac","submitted":64968,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.6014024421396822,"acs":47085,"articleLive":2,"columnArticles":480,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"ac","submitted":78292,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.809568968508217,"acs":70001,"articleLive":2,"columnArticles":700,"formTitle":"[654]最大二叉树","frequency":2.3034988326,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","submitted":86467,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.6002022485277497,"acs":10090,"articleLive":2,"columnArticles":155,"formTitle":"[655]输出二叉树","frequency":1.7124614537,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","submitted":16811,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.30991174473862865,"acs":913,"articleLive":2,"columnArticles":26,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"","submitted":2946,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.7832508656782926,"acs":84371,"articleLive":2,"columnArticles":651,"formTitle":"[657]机器人能否返回原点","frequency":0.5233893954,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","submitted":107719,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.4544723831478055,"acs":29967,"articleLive":2,"columnArticles":267,"formTitle":"[658]找到 K 个最接近的元素","frequency":1.6504212504,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","submitted":65938,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.541906281304493,"acs":29212,"articleLive":2,"columnArticles":267,"formTitle":"[659]分割数组为连续子序列","frequency":0.4720829397,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","submitted":53906,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.6371168185584093,"acs":769,"articleLive":2,"columnArticles":26,"formTitle":"[660]移除 9","frequency":0.7821409289,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"","submitted":1207,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5635154394299288,"acs":17793,"articleLive":2,"columnArticles":228,"formTitle":"[661]图片平滑器","frequency":0.0,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","submitted":31575,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.40925594412647187,"acs":32463,"articleLive":2,"columnArticles":312,"formTitle":"[662]二叉树最大宽度","frequency":2.3385286839,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","submitted":79322,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.45945291696925683,"acs":1898,"articleLive":2,"columnArticles":38,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"","submitted":4131,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.6538973824415103,"acs":22583,"articleLive":2,"columnArticles":194,"formTitle":"[664]奇怪的打印机","frequency":0.0,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"ac","submitted":34536,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.2715302664788811,"acs":77889,"articleLive":2,"columnArticles":977,"formTitle":"[665]非递减数列","frequency":2.0628228025,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","questionId":"665","status":"","submitted":286852,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6197144426139484,"acs":2257,"articleLive":2,"columnArticles":82,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"","submitted":3642,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.6241962900007391,"acs":8446,"articleLive":2,"columnArticles":127,"formTitle":"[667]优美的排列 II","frequency":0.0,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","submitted":13531,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5126290059750136,"acs":7550,"articleLive":2,"columnArticles":81,"formTitle":"[668]乘法表中第k小的数","frequency":0.5792230415,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","submitted":14728,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6653818240464479,"acs":41257,"articleLive":2,"columnArticles":345,"formTitle":"[669]修剪二叉搜索树","frequency":0.4972098898,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","submitted":62005,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.45543456999413184,"acs":20955,"articleLive":2,"columnArticles":311,"formTitle":"[670]最大交换","frequency":2.4851132736,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","submitted":46011,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.48517501477284575,"acs":55832,"articleLive":2,"columnArticles":700,"formTitle":"[671]二叉树中第二小的节点","frequency":2.6800920989,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"ac","submitted":115076,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5465554359526372,"acs":4062,"articleLive":2,"columnArticles":47,"formTitle":"[672]灯泡开关 Ⅱ","frequency":0.5233893954,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","submitted":7432,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.43643610745946676,"acs":51791,"articleLive":2,"columnArticles":434,"formTitle":"[673]最长递增子序列的个数","frequency":3.4462394638,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"ac","submitted":118668,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.5036351021146943,"acs":100170,"articleLive":2,"columnArticles":836,"formTitle":"[674]最长连续递增序列","frequency":2.17872662,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","submitted":198894,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.4039608988193475,"acs":3182,"articleLive":2,"columnArticles":52,"formTitle":"[675]为高尔夫比赛砍树","frequency":0.5792230415,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","submitted":7877,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5943625697524682,"acs":8308,"articleLive":2,"columnArticles":143,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","submitted":13978,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6666487791789644,"acs":37269,"articleLive":2,"columnArticles":558,"formTitle":"[677]键值映射","frequency":1.6504212504,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","submitted":55905,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.3859397298463377,"acs":46515,"articleLive":2,"columnArticles":493,"formTitle":"[678]有效的括号字符串","frequency":3.2861831672,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"ac","submitted":120524,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5402687884725769,"acs":27296,"articleLive":2,"columnArticles":268,"formTitle":"[679]24 点游戏","frequency":3.4041988046,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","submitted":50523,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.4005877471404006,"acs":93647,"articleLive":2,"columnArticles":882,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":1.8292079513,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","submitted":233774,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5030610460031485,"acs":2876,"articleLive":2,"columnArticles":67,"formTitle":"[681]最近时刻","frequency":0.6731005563,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"","submitted":5717,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6943735292020252,"acs":48686,"articleLive":2,"columnArticles":546,"formTitle":"[682]棒球比赛","frequency":1.0847265383,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"ac","submitted":70115,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.43637318396639246,"acs":2493,"articleLive":2,"columnArticles":53,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"","submitted":5713,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.666860278178254,"acs":64294,"articleLive":2,"columnArticles":645,"formTitle":"[684]冗余连接","frequency":1.055182292,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","submitted":96413,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.42873860556787385,"acs":20883,"articleLive":2,"columnArticles":262,"formTitle":"[685]冗余连接 II","frequency":0.0,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","submitted":48708,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.4006805574089254,"acs":42037,"articleLive":2,"columnArticles":567,"formTitle":"[686]重复叠加字符串匹配","frequency":0.8143472387,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","submitted":104914,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.4437354668782579,"acs":40265,"articleLive":2,"columnArticles":286,"formTitle":"[687]最长同值路径","frequency":1.8590751815,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","submitted":90741,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5130683852488364,"acs":8598,"articleLive":2,"columnArticles":113,"formTitle":"[688]“马”在棋盘上的概率","frequency":1.7452190502,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","submitted":16758,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.5617492545790146,"acs":19782,"articleLive":2,"columnArticles":265,"formTitle":"[689]三个无重叠子数组的最大和","frequency":2.0214518562,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","submitted":35215,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6491028357603355,"acs":57591,"articleLive":2,"columnArticles":586,"formTitle":"[690]员工的重要性","frequency":1.0847265383,"frontendQuestionId":"690","leaf":true,"level":2,"nodeType":"def","questionId":"690","status":"ac","submitted":88724,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.4877961662102631,"acs":4097,"articleLive":2,"columnArticles":53,"formTitle":"[691]贴纸拼词","frequency":1.1474135162,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","submitted":8399,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5747649717966156,"acs":71837,"articleLive":2,"columnArticles":784,"formTitle":"[692]前K个高频单词","frequency":1.9551921383,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"ac","submitted":124985,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6088574537540805,"acs":27977,"articleLive":2,"columnArticles":318,"formTitle":"[693]交替位二进制数","frequency":0.0,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","submitted":45950,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5378683241252302,"acs":4673,"articleLive":2,"columnArticles":89,"formTitle":"[694]不同岛屿的数量","frequency":0.5233893954,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"","submitted":8688,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6678739877191421,"acs":150098,"articleLive":2,"columnArticles":1485,"formTitle":"[695]岛屿的最大面积","frequency":3.3059458751,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"ac","submitted":224740,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6334295551768511,"acs":54639,"articleLive":2,"columnArticles":493,"formTitle":"[696]计数二进制子串","frequency":1.6808881918,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","submitted":86259,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.6039391490951426,"acs":69514,"articleLive":2,"columnArticles":884,"formTitle":"[697]数组的度","frequency":0.5792230415,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","submitted":115101,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.4496876246178386,"acs":33830,"articleLive":2,"columnArticles":241,"formTitle":"[698]划分为k个相等的子集","frequency":2.7866306354,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","submitted":75230,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.48266408643767134,"acs":2993,"articleLive":2,"columnArticles":44,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","submitted":6201,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.7739627153717001,"acs":124923,"articleLive":2,"columnArticles":820,"formTitle":"[700]二叉搜索树中的搜索","frequency":1.9846580296,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"ac","submitted":161407,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7215158743821164,"acs":88017,"articleLive":2,"columnArticles":651,"formTitle":"[701]二叉搜索树中的插入操作","frequency":1.2770828351,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"ac","submitted":121989,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7440866778574698,"acs":4876,"articleLive":2,"columnArticles":86,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"786","status":"","submitted":6553,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5138210207897038,"acs":64037,"articleLive":2,"columnArticles":588,"formTitle":"[703]数据流中的第 K 大元素","frequency":1.7452190502,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","submitted":124629,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.548825263986859,"acs":373542,"articleLive":2,"columnArticles":1798,"formTitle":"[704]二分查找","frequency":4.8458309272,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"ac","submitted":680621,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6427228214589839,"acs":72458,"articleLive":2,"columnArticles":456,"formTitle":"[705]设计哈希集合","frequency":2.7779989787,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"ac","submitted":112736,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6416598958803527,"acs":63969,"articleLive":2,"columnArticles":419,"formTitle":"[706]设计哈希映射","frequency":1.3576994309,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"ac","submitted":99693,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.32527516475848894,"acs":76453,"articleLive":2,"columnArticles":518,"formTitle":"[707]设计链表","frequency":2.9501259975,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"ac","submitted":235041,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.34823989569752284,"acs":2671,"articleLive":2,"columnArticles":56,"formTitle":"[708]循环有序列表的插入","frequency":0.60905819,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"850","status":"","submitted":7670,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7729725930033663,"acs":98966,"articleLive":2,"columnArticles":720,"formTitle":"[709]转换成小写字母","frequency":0.8582232354,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","submitted":128033,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.3616229518036132,"acs":6025,"articleLive":2,"columnArticles":70,"formTitle":"[710]黑名单中的随机数","frequency":0.5506985748,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","submitted":16661,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5617732558139535,"acs":773,"articleLive":2,"columnArticles":26,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"","submitted":1376,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6762132382727052,"acs":16693,"articleLive":2,"columnArticles":193,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":1.0267308708,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","submitted":24686,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.42621570619828714,"acs":29362,"articleLive":2,"columnArticles":258,"formTitle":"[713]乘积小于K的子数组","frequency":2.3113899763,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"ac","submitted":68890,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7269197190623249,"acs":111572,"articleLive":2,"columnArticles":760,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":1.9600366396,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"","submitted":153486,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.40995954805412194,"acs":2939,"articleLive":2,"columnArticles":51,"formTitle":"[715]Range 模块","frequency":0.0,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","submitted":7169,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.4636046750051261,"acs":4522,"articleLive":2,"columnArticles":83,"formTitle":"[716]最大栈","frequency":0.5506985748,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"ac","submitted":9754,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5114609611012488,"acs":32845,"articleLive":2,"columnArticles":403,"formTitle":"[717]1比特与2比特字符","frequency":0.0,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","submitted":64218,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5647076698675094,"acs":92917,"articleLive":2,"columnArticles":629,"formTitle":"[718]最长重复子数组","frequency":2.8623503866,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","submitted":164540,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.3761768629693158,"acs":9869,"articleLive":2,"columnArticles":92,"formTitle":"[719]找出第 k 小的距离对","frequency":2.3855961947,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","submitted":26235,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.48418316674767026,"acs":22913,"articleLive":2,"columnArticles":309,"formTitle":"[720]词典中最长的单词","frequency":1.3864315356,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","submitted":47323,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.4710541878054094,"acs":30269,"articleLive":2,"columnArticles":346,"formTitle":"[721]账户合并","frequency":1.055182292,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","submitted":64258,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.32257673911727314,"acs":5328,"articleLive":2,"columnArticles":75,"formTitle":"[722]删除注释","frequency":2.0628228025,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","submitted":16517,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7235091177920158,"acs":1468,"articleLive":2,"columnArticles":42,"formTitle":"[723]粉碎糖果","frequency":0.865557335,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"","submitted":2029,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.4698901598077008,"acs":148958,"articleLive":2,"columnArticles":928,"formTitle":"[724]寻找数组的中心下标","frequency":2.0316190228,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"","submitted":317006,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.6083662555405666,"acs":50509,"articleLive":2,"columnArticles":648,"formTitle":"[725]分隔链表","frequency":2.6470758948,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"ac","submitted":83024,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5524316859031272,"acs":22400,"articleLive":2,"columnArticles":408,"formTitle":"[726]原子的数量","frequency":3.0812034011,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"ac","submitted":40548,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.40796393688955673,"acs":3258,"articleLive":2,"columnArticles":55,"formTitle":"[727]最小窗口子序列","frequency":2.0255050395,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"","submitted":7986,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7575918679823069,"acs":35625,"articleLive":2,"columnArticles":325,"formTitle":"[728]自除数","frequency":0.5233893954,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","submitted":47024,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.5194104768516047,"acs":9727,"articleLive":2,"columnArticles":120,"formTitle":"[729]我的日程安排表 I","frequency":0.0,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","submitted":18727,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.4955457892861385,"acs":4172,"articleLive":2,"columnArticles":52,"formTitle":"[730]统计不同回文子序列","frequency":1.814643173,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","submitted":8419,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5032514052683787,"acs":4566,"articleLive":2,"columnArticles":50,"formTitle":"[731]我的日程安排表 II","frequency":0.0,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","submitted":9073,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6175609756097561,"acs":3798,"articleLive":2,"columnArticles":59,"formTitle":"[732]我的日程安排表 III","frequency":1.5124236696,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","submitted":6150,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5796599195049629,"acs":78781,"articleLive":2,"columnArticles":662,"formTitle":"[733]图像渲染","frequency":2.9199668963,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"ac","submitted":135909,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.47751741608613046,"acs":2262,"articleLive":2,"columnArticles":41,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"","submitted":4737,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.41010153157804163,"acs":23831,"articleLive":2,"columnArticles":300,"formTitle":"[735]行星碰撞","frequency":2.8775251846,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"ac","submitted":58110,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.46945798680814455,"acs":1637,"articleLive":2,"columnArticles":48,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","submitted":3487,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.46710380084463216,"acs":4203,"articleLive":2,"columnArticles":74,"formTitle":"[737]句子相似性 II","frequency":0.5792230415,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"","submitted":8998,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.5017638560693447,"acs":44804,"articleLive":2,"columnArticles":617,"formTitle":"[738]单调递增的数字","frequency":1.779247512,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"ac","submitted":89293,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.683145140288917,"acs":233471,"articleLive":2,"columnArticles":1643,"formTitle":"[739]每日温度","frequency":3.6334208816,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"ac","submitted":341759,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.6282052610312782,"acs":60635,"articleLive":2,"columnArticles":669,"formTitle":"[740]删除并获得点数","frequency":2.9232715373,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","submitted":96521,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.3699482773735426,"acs":4220,"articleLive":2,"columnArticles":49,"formTitle":"[741]摘樱桃","frequency":1.7452190502,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","submitted":11407,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.4917095483133219,"acs":1720,"articleLive":2,"columnArticles":49,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"","submitted":3498,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.5257265106676989,"acs":63155,"articleLive":2,"columnArticles":563,"formTitle":"[743]网络延迟时间","frequency":2.7649606443,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"ac","submitted":120129,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.4593512796051267,"acs":44298,"articleLive":2,"columnArticles":398,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":0.4247143878,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","submitted":96436,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.401,"acs":3208,"articleLive":2,"columnArticles":58,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","submitted":8000,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5980944973750729,"acs":156876,"articleLive":2,"columnArticles":1466,"formTitle":"[746]使用最小花费爬楼梯","frequency":2.466215371,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","submitted":262293,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.42007365333000435,"acs":47110,"articleLive":2,"columnArticles":430,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":0.0,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","submitted":112147,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.6822119751275064,"acs":39058,"articleLive":2,"columnArticles":496,"formTitle":"[748]最短补全词","frequency":0.9247617853,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","submitted":57252,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.5050178051149239,"acs":1560,"articleLive":2,"columnArticles":37,"formTitle":"[749]隔离病毒","frequency":0.0,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","submitted":3089,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.7188862797718887,"acs":2143,"articleLive":2,"columnArticles":43,"formTitle":"[750]角矩形的数量","frequency":0.8226322903,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"","submitted":2981,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.4952413324269205,"acs":1457,"articleLive":2,"columnArticles":28,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","questionId":"752","status":"","submitted":2942,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5302339308677718,"acs":75456,"articleLive":2,"columnArticles":635,"formTitle":"[752]打开转盘锁","frequency":1.3864315356,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"ac","submitted":142307,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5974240422721269,"acs":3618,"articleLive":2,"columnArticles":48,"formTitle":"[753]破解保险箱","frequency":1.0847265383,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","submitted":6056,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.4327969348659004,"acs":8472,"articleLive":2,"columnArticles":100,"formTitle":"[754]到达终点数字","frequency":0.5792230415,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","submitted":19575,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.49784637473079685,"acs":1387,"articleLive":2,"columnArticles":32,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"","submitted":2786,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.5564644399000227,"acs":4898,"articleLive":2,"columnArticles":72,"formTitle":"[756]金字塔转换矩阵","frequency":0.0,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","submitted":8802,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.42463086159337987,"acs":2617,"articleLive":2,"columnArticles":40,"formTitle":"[757]设置交集大小至少为2","frequency":0.0,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","submitted":6163,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.4658987964281092,"acs":3600,"articleLive":2,"columnArticles":71,"formTitle":"[758]字符串中的加粗单词","frequency":0.0,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","questionId":"760","status":"","submitted":7727,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6708821714990747,"acs":2175,"articleLive":2,"columnArticles":50,"formTitle":"[759]员工空闲时间","frequency":0.4720829397,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"","submitted":3242,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.839271417133707,"acs":4193,"articleLive":2,"columnArticles":95,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"","submitted":4996,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.5942688805570434,"acs":2219,"articleLive":2,"columnArticles":35,"formTitle":"[761]特殊的二进制序列","frequency":0.0,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","submitted":3734,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.7026119402985075,"acs":18830,"articleLive":2,"columnArticles":163,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"767","status":"","submitted":26800,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7631705648328815,"acs":90351,"articleLive":2,"columnArticles":1063,"formTitle":"[763]划分字母区间","frequency":3.0095965511,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","submitted":118389,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.4984220018034265,"acs":4422,"articleLive":2,"columnArticles":59,"formTitle":"[764]最大加号标志","frequency":0.5792230415,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","submitted":8872,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.664034410499614,"acs":30104,"articleLive":2,"columnArticles":454,"formTitle":"[765]情侣牵手","frequency":1.7124614537,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","submitted":45335,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7071540586961392,"acs":56817,"articleLive":2,"columnArticles":651,"formTitle":"[766]托普利茨矩阵","frequency":0.4720829397,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","submitted":80346,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.4777972068195937,"acs":41533,"articleLive":2,"columnArticles":504,"formTitle":"[767]重构字符串","frequency":2.7142972866,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","submitted":86926,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.5139359854437184,"acs":6214,"articleLive":2,"columnArticles":90,"formTitle":"[768]最多能完成排序的块 II","frequency":0.4972098898,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","submitted":12091,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5847603098178773,"acs":13967,"articleLive":2,"columnArticles":168,"formTitle":"[769]最多能完成排序的块","frequency":0.5233893954,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","submitted":23885,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5641137855579869,"acs":1289,"articleLive":2,"columnArticles":26,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","submitted":2285,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8512839981560322,"acs":156964,"articleLive":2,"columnArticles":1167,"formTitle":"[771]宝石与石头","frequency":1.1154414835,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"ac","submitted":184385,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.4974478634971562,"acs":6822,"articleLive":2,"columnArticles":131,"formTitle":"[772]基本计算器 III","frequency":1.1474135162,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"","submitted":13714,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7096232856894855,"acs":24526,"articleLive":2,"columnArticles":348,"formTitle":"[773]滑动谜题","frequency":1.0847265383,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","submitted":34562,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5935357492654261,"acs":1212,"articleLive":2,"columnArticles":23,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.8226322903,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"","submitted":2042,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.45780445969125216,"acs":5338,"articleLive":2,"columnArticles":84,"formTitle":"[775]全局倒置与局部倒置","frequency":0.6403107335,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","submitted":11660,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5694527961515333,"acs":1894,"articleLive":2,"columnArticles":39,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"","submitted":3326,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.3242266630166986,"acs":5922,"articleLive":2,"columnArticles":64,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":1.2155249421,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","submitted":18265,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5928146607997679,"acs":24520,"articleLive":2,"columnArticles":355,"formTitle":"[778]水位上升的泳池中游泳","frequency":0.0,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","submitted":41362,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.43663105190218604,"acs":19534,"articleLive":2,"columnArticles":243,"formTitle":"[779]第K个语法符号","frequency":1.7452190502,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","submitted":44738,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.2879980324643384,"acs":3513,"articleLive":2,"columnArticles":54,"formTitle":"[780]到达终点","frequency":0.6731005563,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","submitted":12198,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.6134851886025918,"acs":44547,"articleLive":2,"columnArticles":679,"formTitle":"[781]森林中的兔子","frequency":2.2101475172,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","submitted":72613,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.41460905349794236,"acs":1612,"articleLive":2,"columnArticles":34,"formTitle":"[782]变为棋盘","frequency":0.8226322903,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","submitted":3888,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5965716183123729,"acs":71866,"articleLive":2,"columnArticles":697,"formTitle":"[783]二叉搜索树节点最小距离","frequency":1.0847265383,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"ac","submitted":120465,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6910241497729035,"acs":49903,"articleLive":2,"columnArticles":576,"formTitle":"[784]字母大小写全排列","frequency":2.0628228025,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"ac","submitted":72216,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5163868904876099,"acs":43928,"articleLive":2,"columnArticles":436,"formTitle":"[785]判断二分图","frequency":1.9896640473,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"ac","submitted":85068,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.674618014745165,"acs":25255,"articleLive":2,"columnArticles":257,"formTitle":"[786]第 K 个最小的素数分数","frequency":1.1065414604,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","submitted":37436,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.3891725987826266,"acs":45267,"articleLive":2,"columnArticles":427,"formTitle":"[787]K 站中转内最便宜的航班","frequency":2.8775251846,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"ac","submitted":116316,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.609106446099771,"acs":18889,"articleLive":2,"columnArticles":197,"formTitle":"[788]旋转数字","frequency":0.0,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","questionId":"804","status":"","submitted":31011,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6911755107368971,"acs":21179,"articleLive":2,"columnArticles":301,"formTitle":"[789]逃脱阻碍者","frequency":2.4402681938,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"ac","submitted":30642,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.4528463099433942,"acs":4240,"articleLive":2,"columnArticles":74,"formTitle":"[790]多米诺和托米诺平铺","frequency":0.5506985748,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","submitted":9363,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6962946252326434,"acs":12346,"articleLive":2,"columnArticles":218,"formTitle":"[791]自定义字符串排序","frequency":1.1154414835,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","submitted":17731,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.46558091089858916,"acs":9834,"articleLive":2,"columnArticles":107,"formTitle":"[792]匹配子序列的单词数","frequency":1.1474135162,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","submitted":21122,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.3946886446886447,"acs":5603,"articleLive":2,"columnArticles":71,"formTitle":"[793]阶乘函数后 K 个零","frequency":0.0,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","submitted":14196,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3893884152526111,"acs":28409,"articleLive":2,"columnArticles":460,"formTitle":"[794]有效的井字游戏","frequency":0.0770123818,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","submitted":72958,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5300995323180238,"acs":8841,"articleLive":2,"columnArticles":101,"formTitle":"[795]区间子数组个数","frequency":1.9219929666,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","submitted":16678,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5394073859041616,"acs":26014,"articleLive":2,"columnArticles":325,"formTitle":"[796]旋转字符串","frequency":2.3069429551,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","submitted":48227,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.7895927601809954,"acs":49558,"articleLive":2,"columnArticles":599,"formTitle":"[797]所有可能的路径","frequency":2.3034988326,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"ac","submitted":62764,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.47116564417177914,"acs":1536,"articleLive":2,"columnArticles":38,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","submitted":3260,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.41329127536024085,"acs":5765,"articleLive":2,"columnArticles":75,"formTitle":"[799]香槟塔","frequency":1.4161956376,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","submitted":13949,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.710085933966531,"acs":1570,"articleLive":2,"columnArticles":38,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"","submitted":2211,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.4207839262187088,"acs":7665,"articleLive":2,"columnArticles":91,"formTitle":"[801]使序列递增的最小交换次数","frequency":1.7124614537,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","questionId":"819","status":"","submitted":18216,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5775449420274439,"acs":32577,"articleLive":2,"columnArticles":342,"formTitle":"[802]找到最终的安全状态","frequency":2.5225976443,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"ac","submitted":56406,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.47997700708948077,"acs":12525,"articleLive":2,"columnArticles":128,"formTitle":"[803]打砖块","frequency":0.6731005563,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","submitted":26095,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7739007626400527,"acs":41098,"articleLive":2,"columnArticles":421,"formTitle":"[804]唯一摩尔斯密码词","frequency":1.0847265383,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","submitted":53105,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.2982719009090001,"acs":2986,"articleLive":2,"columnArticles":45,"formTitle":"[805]数组的均值分割","frequency":0.6403107335,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","submitted":10011,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.6549590536851684,"acs":14396,"articleLive":2,"columnArticles":168,"formTitle":"[806]写字符串需要的行数","frequency":0.5233893954,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","submitted":21980,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8894819083953974,"acs":43831,"articleLive":2,"columnArticles":618,"formTitle":"[807]保持城市天际线","frequency":1.3225234598,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","submitted":49277,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.4833487988452418,"acs":4688,"articleLive":2,"columnArticles":43,"formTitle":"[808]分汤","frequency":0.6403107335,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","submitted":9699,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.4206451612903226,"acs":5216,"articleLive":2,"columnArticles":99,"formTitle":"[809]情感丰富的文字","frequency":0.4972098898,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","submitted":12400,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7305623047552933,"acs":16838,"articleLive":2,"columnArticles":135,"formTitle":"[810]黑板异或游戏","frequency":0.5506985748,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"ac","submitted":23048,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7057780468817576,"acs":16319,"articleLive":2,"columnArticles":209,"formTitle":"[811]子域名访问计数","frequency":1.0267308708,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","questionId":"829","status":"","submitted":23122,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.6321614583333334,"acs":11652,"articleLive":2,"columnArticles":109,"formTitle":"[812]最大三角形面积","frequency":0.5233893954,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","submitted":18432,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5540718038528897,"acs":7593,"articleLive":2,"columnArticles":90,"formTitle":"[813]最大平均值和的分组","frequency":0.0,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","submitted":13704,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.7001620284829018,"acs":24631,"articleLive":2,"columnArticles":380,"formTitle":"[814]二叉树剪枝","frequency":1.4470622855,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","submitted":35179,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.4329784754060145,"acs":27860,"articleLive":2,"columnArticles":324,"formTitle":"[815]公交路线","frequency":3.0134382769,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"ac","submitted":64345,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.5134881223996779,"acs":3826,"articleLive":2,"columnArticles":70,"formTitle":"[816]模糊坐标","frequency":0.60905819,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","submitted":7451,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5924218291558387,"acs":14134,"articleLive":2,"columnArticles":176,"formTitle":"[817]链表组件","frequency":0.5506985748,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"ac","submitted":23858,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.4354088692298968,"acs":3839,"articleLive":2,"columnArticles":47,"formTitle":"[818]赛车","frequency":0.6403107335,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","submitted":8817,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.4222797461755559,"acs":23491,"articleLive":2,"columnArticles":265,"formTitle":"[819]最常见的单词","frequency":0.4479388408,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","submitted":55629,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5095258048123813,"acs":57153,"articleLive":2,"columnArticles":628,"formTitle":"[820]单词的压缩编码","frequency":0.5233893954,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","submitted":112169,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.6944217617638052,"acs":27213,"articleLive":2,"columnArticles":372,"formTitle":"[821]字符的最短距离","frequency":1.3864315356,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","submitted":39188,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5082073785145458,"acs":3127,"articleLive":2,"columnArticles":42,"formTitle":"[822]翻转卡片游戏","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","submitted":6153,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.4276914836636315,"acs":3194,"articleLive":2,"columnArticles":56,"formTitle":"[823]带因子的二叉树","frequency":0.6731005563,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","submitted":7468,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6173882923449948,"acs":17824,"articleLive":2,"columnArticles":248,"formTitle":"[824]山羊拉丁文","frequency":0.0,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","submitted":28870,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.3979847523591193,"acs":7465,"articleLive":2,"columnArticles":105,"formTitle":"[825]适龄的朋友","frequency":1.055182292,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"","submitted":18757,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.3810551347542716,"acs":8653,"articleLive":2,"columnArticles":125,"formTitle":"[826]安排工作以达到最大收益","frequency":1.7452190502,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","submitted":22708,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.39152625060982477,"acs":10433,"articleLive":2,"columnArticles":203,"formTitle":"[827]最大人工岛","frequency":1.1474135162,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","submitted":26647,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.5014144271570015,"acs":3545,"articleLive":2,"columnArticles":57,"formTitle":"[828]统计子串中的唯一字符","frequency":0.5506985748,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"855","status":"","submitted":7070,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.36756905426112924,"acs":9355,"articleLive":2,"columnArticles":110,"formTitle":"[829]连续整数求和","frequency":1.0847265383,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","submitted":25451,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5429739250100131,"acs":52871,"articleLive":2,"columnArticles":594,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","submitted":97373,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.407159067464411,"acs":7894,"articleLive":2,"columnArticles":78,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","submitted":19388,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.7955387640093139,"acs":87806,"articleLive":2,"columnArticles":962,"formTitle":"[832]翻转图像","frequency":0.5233893954,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","submitted":110373,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.4373827392120075,"acs":5595,"articleLive":2,"columnArticles":84,"formTitle":"[833]字符串中的查找与替换","frequency":0.0,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","submitted":12792,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5267401236226821,"acs":13720,"articleLive":2,"columnArticles":134,"formTitle":"[834]树中距离之和","frequency":1.180738826,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","submitted":26047,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5758730158730159,"acs":4535,"articleLive":2,"columnArticles":52,"formTitle":"[835]图像重叠","frequency":0.5506985748,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","submitted":7875,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.48076570464630164,"acs":39330,"articleLive":2,"columnArticles":675,"formTitle":"[836]矩形重叠","frequency":1.7124614537,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","submitted":81807,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.39584002569868293,"acs":19716,"articleLive":2,"columnArticles":247,"formTitle":"[837]新 21 点","frequency":1.180738826,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","submitted":49808,"title":"新 21 点","titleSlug":"new-21-game"},{"acceptance":0.5011611404980003,"acs":7769,"articleLive":2,"columnArticles":138,"formTitle":"[838]推多米诺","frequency":2.5191275874,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","submitted":15502,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5749013878743608,"acs":19676,"articleLive":2,"columnArticles":277,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","submitted":34225,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.36068887765812696,"acs":9278,"articleLive":2,"columnArticles":117,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","submitted":25723,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.6594306570987619,"acs":58537,"articleLive":2,"columnArticles":579,"formTitle":"[841]钥匙和房间","frequency":1.4161956376,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"ac","submitted":88769,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.48708524243492274,"acs":29022,"articleLive":2,"columnArticles":324,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":2.0951357915,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","submitted":59583,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.38596932361076186,"acs":3070,"articleLive":2,"columnArticles":37,"formTitle":"[843]猜猜这个单词","frequency":0.0,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","submitted":7954,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5077568489734022,"acs":101789,"articleLive":2,"columnArticles":1084,"formTitle":"[844]比较含退格的字符串","frequency":1.3299352933,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"ac","submitted":200468,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.42199803415387604,"acs":39069,"articleLive":2,"columnArticles":574,"formTitle":"[845]数组中的最长山脉","frequency":1.9551921383,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","submitted":92581,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5155350978135789,"acs":9408,"articleLive":2,"columnArticles":131,"formTitle":"[846]一手顺子","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","submitted":18249,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.6790258344200473,"acs":19266,"articleLive":2,"columnArticles":160,"formTitle":"[847]访问所有节点的最短路径","frequency":2.9501259975,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"ac","submitted":28373,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.4481693258323342,"acs":9719,"articleLive":2,"columnArticles":107,"formTitle":"[848]字母移位","frequency":1.479109463,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","submitted":21686,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.4282036097736811,"acs":16631,"articleLive":2,"columnArticles":200,"formTitle":"[849]到最近的人的最大距离","frequency":0.0,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","submitted":38839,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.4476012249064308,"acs":2631,"articleLive":2,"columnArticles":45,"formTitle":"[850]矩形面积 II","frequency":2.2371761896,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","submitted":5878,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.6282645166136666,"acs":25091,"articleLive":2,"columnArticles":270,"formTitle":"[851]喧闹和富有","frequency":0.8437747268,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","submitted":39937,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7143669780633582,"acs":89163,"articleLive":2,"columnArticles":768,"formTitle":"[852]山脉数组的峰顶索引","frequency":0.0,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"ac","submitted":124814,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.3890303009170473,"acs":11157,"articleLive":2,"columnArticles":141,"formTitle":"[853]车队","frequency":1.6808881918,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","submitted":28679,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.3630147877245985,"acs":4566,"articleLive":2,"columnArticles":75,"formTitle":"[854]相似度为 K 的字符串","frequency":0.0,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","submitted":12578,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.4122832794593006,"acs":5612,"articleLive":2,"columnArticles":65,"formTitle":"[855]考场就座","frequency":0.5233893954,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","submitted":13612,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6289365753625311,"acs":17175,"articleLive":2,"columnArticles":235,"formTitle":"[856]括号的分数","frequency":2.7992379633,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"ac","submitted":27308,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.4717035334673944,"acs":3284,"articleLive":2,"columnArticles":52,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":0.5233893954,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","submitted":6962,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5572256428830134,"acs":3077,"articleLive":2,"columnArticles":52,"formTitle":"[858]镜面反射","frequency":1.9722632254,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","submitted":5522,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.34577760148397896,"acs":59277,"articleLive":2,"columnArticles":751,"formTitle":"[859]亲密字符串","frequency":2.4522875692,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","submitted":171431,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5859195073992339,"acs":97439,"articleLive":2,"columnArticles":843,"formTitle":"[860]柠檬水找零","frequency":1.3576994309,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"ac","submitted":166301,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8092354277062831,"acs":32070,"articleLive":2,"columnArticles":454,"formTitle":"[861]翻转矩阵后的得分","frequency":1.180738826,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"ac","submitted":39630,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.1963000682685528,"acs":17540,"articleLive":2,"columnArticles":138,"formTitle":"[862]和至少为 K 的最短子数组","frequency":2.405109009,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","submitted":89353,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.6062677786397724,"acs":37511,"articleLive":2,"columnArticles":580,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":2.668958606,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"ac","submitted":61872,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.46145220072890386,"acs":3292,"articleLive":2,"columnArticles":47,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.6731005563,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","submitted":7134,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.6636632598171059,"acs":9870,"articleLive":2,"columnArticles":142,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.4972098898,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","submitted":14872,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.227441598649029,"acs":8081,"articleLive":2,"columnArticles":96,"formTitle":"[866]回文素数","frequency":0.0,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","submitted":35530,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6689475780938767,"acs":85638,"articleLive":2,"columnArticles":769,"formTitle":"[867]转置矩阵","frequency":1.0847265383,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","submitted":128019,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6261110301617369,"acs":17188,"articleLive":2,"columnArticles":250,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","submitted":27452,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.6423969450700088,"acs":32804,"articleLive":2,"columnArticles":470,"formTitle":"[869]重新排序得到 2 的幂","frequency":1.9551921383,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"ac","submitted":51065,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.4378195547864391,"acs":16698,"articleLive":2,"columnArticles":217,"formTitle":"[870]优势洗牌","frequency":1.3864315356,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"ac","submitted":38139,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.3468173706127305,"acs":10494,"articleLive":2,"columnArticles":135,"formTitle":"[871]最低加油次数","frequency":2.0951357915,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","submitted":30258,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6518902362270801,"acs":62146,"articleLive":2,"columnArticles":745,"formTitle":"[872]叶子相似的树","frequency":0.0,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"ac","submitted":95332,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5191341561744093,"acs":16740,"articleLive":2,"columnArticles":126,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":1.9896640473,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","submitted":32246,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.41947332620736566,"acs":21584,"articleLive":2,"columnArticles":242,"formTitle":"[874]模拟行走机器人","frequency":1.479109463,"frontendQuestionId":"874","leaf":true,"level":2,"nodeType":"def","questionId":"906","status":"","submitted":51455,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.48232168403842224,"acs":51920,"articleLive":2,"columnArticles":411,"formTitle":"[875]爱吃香蕉的珂珂","frequency":1.8899799896,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","submitted":107646,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7058020504669809,"acs":179405,"articleLive":2,"columnArticles":1869,"formTitle":"[876]链表的中间结点","frequency":2.5278268245,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"ac","submitted":254186,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.758025297015976,"acs":71077,"articleLive":2,"columnArticles":499,"formTitle":"[877]石子游戏","frequency":1.3299352933,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"ac","submitted":93766,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.28615273515074924,"acs":4755,"articleLive":2,"columnArticles":67,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","submitted":16617,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5526650220527771,"acs":22179,"articleLive":2,"columnArticles":187,"formTitle":"[879]盈利计划","frequency":2.0628228025,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"ac","submitted":40131,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.25501095512456384,"acs":6285,"articleLive":2,"columnArticles":83,"formTitle":"[880]索引处的解码字符串","frequency":0.0,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"ac","submitted":24646,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.5379045813041418,"acs":49924,"articleLive":2,"columnArticles":607,"formTitle":"[881]救生艇","frequency":3.5998606851,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"ac","submitted":92812,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.4930011862396204,"acs":2078,"articleLive":2,"columnArticles":34,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","submitted":4215,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.6928519593613933,"acs":11457,"articleLive":2,"columnArticles":123,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","submitted":16536,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6626359175032877,"acs":20659,"articleLive":2,"columnArticles":269,"formTitle":"[884]两句话中的不常见单词","frequency":1.1154414835,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","submitted":31177,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6995067141682653,"acs":5105,"articleLive":2,"columnArticles":75,"formTitle":"[885]螺旋矩阵 III","frequency":1.180738826,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","submitted":7298,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.43928864332887296,"acs":10177,"articleLive":2,"columnArticles":135,"formTitle":"[886]可能的二分法","frequency":1.8899799896,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","submitted":23167,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.2906603687108063,"acs":53905,"articleLive":2,"columnArticles":355,"formTitle":"[887]鸡蛋掉落","frequency":2.7649606443,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","submitted":185457,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6409442706787516,"acs":56148,"articleLive":2,"columnArticles":479,"formTitle":"[888]公平的糖果交换","frequency":0.0,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","submitted":87602,"title":"公平的糖果交换","titleSlug":"fair-candy-swap"},{"acceptance":0.6747220879652006,"acs":16752,"articleLive":2,"columnArticles":164,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":1.9551921383,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"925","status":"","submitted":24828,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.7277615244722069,"acs":9204,"articleLive":2,"columnArticles":132,"formTitle":"[890]查找和替换模式","frequency":0.6403107335,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","submitted":12647,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.3313708064874472,"acs":2983,"articleLive":2,"columnArticles":40,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","submitted":9002,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.638423292779389,"acs":33899,"articleLive":2,"columnArticles":692,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","submitted":53098,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.7246814659135689,"acs":11034,"articleLive":2,"columnArticles":111,"formTitle":"[893]特殊等价字符串组","frequency":0.0,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","questionId":"929","status":"","submitted":15226,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7752808988764045,"acs":13938,"articleLive":2,"columnArticles":131,"formTitle":"[894]所有可能的满二叉树","frequency":0.5506985748,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","submitted":17978,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.5573480362126472,"acs":8188,"articleLive":2,"columnArticles":93,"formTitle":"[895]最大频率栈","frequency":2.128636021,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","submitted":14691,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5849117479597646,"acs":61638,"articleLive":2,"columnArticles":736,"formTitle":"[896]单调数列","frequency":0.4479388408,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","submitted":105380,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.7430580411264158,"acs":64357,"articleLive":2,"columnArticles":740,"formTitle":"[897]递增顺序搜索树","frequency":0.0,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"ac","submitted":86611,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.34182666427417907,"acs":5715,"articleLive":2,"columnArticles":41,"formTitle":"[898]子数组按位或操作","frequency":0.4972098898,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","submitted":16719,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5412732994432341,"acs":4472,"articleLive":2,"columnArticles":53,"formTitle":"[899]有序队列","frequency":0.0,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","submitted":8262,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.4991885312415472,"acs":3691,"articleLive":2,"columnArticles":57,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","submitted":7394,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.5500800756123815,"acs":20952,"articleLive":2,"columnArticles":253,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"ac","submitted":38089,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.33865844544095663,"acs":3625,"articleLive":2,"columnArticles":83,"formTitle":"[902]最大为 N 的数字组合","frequency":1.1474135162,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","submitted":10704,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.5371770082615573,"acs":3056,"articleLive":2,"columnArticles":44,"formTitle":"[903]DI 序列的有效排列","frequency":0.9598334118,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","submitted":5689,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.4479761483652534,"acs":26595,"articleLive":2,"columnArticles":374,"formTitle":"[904]水果成篮","frequency":2.3779038491,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","submitted":59367,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.700882393492348,"acs":61002,"articleLive":2,"columnArticles":643,"formTitle":"[905]按奇偶排序数组","frequency":1.4470622855,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","submitted":87036,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.2874011099303342,"acs":2434,"articleLive":2,"columnArticles":44,"formTitle":"[906]超级回文数","frequency":0.0,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","submitted":8469,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.3222281927279241,"acs":12593,"articleLive":2,"columnArticles":138,"formTitle":"[907]子数组的最小值之和","frequency":2.0628228025,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"ac","submitted":39081,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.6989996201089022,"acs":22080,"articleLive":2,"columnArticles":207,"formTitle":"[908]最小差值 I","frequency":0.0,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","submitted":31588,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.4597905004710968,"acs":16592,"articleLive":2,"columnArticles":199,"formTitle":"[909]蛇梯棋","frequency":1.2518925863,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"ac","submitted":36086,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.3212652966982221,"acs":6957,"articleLive":2,"columnArticles":71,"formTitle":"[910]最小差值 II","frequency":0.5233893954,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","submitted":21655,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.542298433078515,"acs":25680,"articleLive":2,"columnArticles":318,"formTitle":"[911]在线选举","frequency":1.0635087348,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","submitted":47354,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.5575227098458101,"acs":261026,"articleLive":2,"columnArticles":1185,"formTitle":"[912]排序数组","frequency":4.0001029088,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"ac","submitted":468189,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.4028324154209284,"acs":2048,"articleLive":2,"columnArticles":35,"formTitle":"[913]猫和老鼠","frequency":0.9598334118,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","submitted":5084,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.38891081141725276,"acs":50264,"articleLive":2,"columnArticles":632,"formTitle":"[914]卡牌分组","frequency":1.0847265383,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"950","status":"ac","submitted":129243,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.46841444707851065,"acs":10077,"articleLive":2,"columnArticles":125,"formTitle":"[915]分割数组","frequency":0.5506985748,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","submitted":21513,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.44677760169043845,"acs":6766,"articleLive":2,"columnArticles":80,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","submitted":15144,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5692607216288506,"acs":31286,"articleLive":2,"columnArticles":464,"formTitle":"[917]仅仅反转字母","frequency":1.4470622855,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","submitted":54959,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.36107030846798205,"acs":27285,"articleLive":2,"columnArticles":274,"formTitle":"[918]环形子数组的最大和","frequency":2.5873472706,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","submitted":75567,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6440677966101694,"acs":6080,"articleLive":2,"columnArticles":109,"formTitle":"[919]完全二叉树插入器","frequency":0.5792230415,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","submitted":9440,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.48784637822070975,"acs":2007,"articleLive":2,"columnArticles":21,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","submitted":4114,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.743800057898292,"acs":23124,"articleLive":2,"columnArticles":342,"formTitle":"[921]使括号有效的最少添加","frequency":1.055182292,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"ac","submitted":31089,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7140478071602299,"acs":92185,"articleLive":2,"columnArticles":861,"formTitle":"[922]按奇偶排序数组 II","frequency":1.4161956376,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"ac","submitted":129102,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.34364754098360656,"acs":6708,"articleLive":2,"columnArticles":88,"formTitle":"[923]三数之和的多种可能","frequency":1.180738826,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","submitted":19520,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.3583380821633943,"acs":6917,"articleLive":2,"columnArticles":99,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.6403107335,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","submitted":19303,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.3870319307134157,"acs":51793,"articleLive":2,"columnArticles":693,"formTitle":"[925]长按键入","frequency":1.4470622855,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","submitted":133821,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.5343734763529986,"acs":7672,"articleLive":2,"columnArticles":142,"formTitle":"[926]将字符串翻转到单调递增","frequency":0.4972098898,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","submitted":14357,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.3416549789621318,"acs":3654,"articleLive":2,"columnArticles":77,"formTitle":"[927]三等分","frequency":1.3299352933,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","submitted":10695,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.4229122055674518,"acs":2370,"articleLive":2,"columnArticles":46,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","submitted":5604,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6450984166706771,"acs":26809,"articleLive":2,"columnArticles":239,"formTitle":"[929]独特的电子邮件地址","frequency":0.4972098898,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","submitted":41558,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.5451469195784114,"acs":35120,"articleLive":2,"columnArticles":352,"formTitle":"[930]和相同的二元子数组","frequency":2.9131395331,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"ac","submitted":64423,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6710400824848562,"acs":26033,"articleLive":2,"columnArticles":331,"formTitle":"[931]下降路径最小和","frequency":1.0267308708,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","submitted":38795,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6377073069183263,"acs":9190,"articleLive":2,"columnArticles":88,"formTitle":"[932]漂亮数组","frequency":1.1154414835,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","submitted":14411,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.7276824978012313,"acs":39714,"articleLive":2,"columnArticles":344,"formTitle":"[933]最近的请求次数","frequency":2.0951357915,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","submitted":54576,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.4709106921404051,"acs":26201,"articleLive":2,"columnArticles":291,"formTitle":"[934]最短的桥","frequency":0.4720829397,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","submitted":55639,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.47995033233511064,"acs":6571,"articleLive":2,"columnArticles":88,"formTitle":"[935]骑士拨号器","frequency":1.0847265383,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","submitted":13691,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.37904893177119225,"acs":1650,"articleLive":2,"columnArticles":28,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","submitted":4353,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.5874757325387151,"acs":13012,"articleLive":2,"columnArticles":137,"formTitle":"[937]重新排列日志文件","frequency":1.1154414835,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","submitted":22149,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8200509535476204,"acs":100749,"articleLive":2,"columnArticles":835,"formTitle":"[938]二叉搜索树的范围和","frequency":1.0267308708,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"ac","submitted":122857,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.4588889735578755,"acs":6022,"articleLive":2,"columnArticles":65,"formTitle":"[939]最小面积矩形","frequency":1.0847265383,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","submitted":13123,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.42477027566919695,"acs":5316,"articleLive":2,"columnArticles":67,"formTitle":"[940]不同的子序列 II","frequency":0.0,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"notac","submitted":12515,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.3929905677825042,"acs":63747,"articleLive":2,"columnArticles":637,"formTitle":"[941]有效的山脉数组","frequency":1.4161956376,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","submitted":162210,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7318740611300163,"acs":23873,"articleLive":2,"columnArticles":226,"formTitle":"[942]增减字符串匹配","frequency":0.5233893954,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","submitted":32619,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.45535317636605954,"acs":2050,"articleLive":2,"columnArticles":46,"formTitle":"[943]最短超级串","frequency":0.6731005563,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","submitted":4502,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6868828458399526,"acs":22051,"articleLive":2,"columnArticles":189,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","submitted":32103,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.48536066010114454,"acs":36470,"articleLive":2,"columnArticles":547,"formTitle":"[945]使数组唯一的最小增量","frequency":0.5233893954,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","submitted":75140,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.6279562075011761,"acs":29367,"articleLive":2,"columnArticles":337,"formTitle":"[946]验证栈序列","frequency":1.9219929666,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"ac","submitted":46766,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6127546460734664,"acs":26740,"articleLive":2,"columnArticles":344,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"","submitted":43639,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.3936821213958873,"acs":7141,"articleLive":2,"columnArticles":103,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","submitted":18139,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.3731140294955162,"acs":8779,"articleLive":2,"columnArticles":126,"formTitle":"[949]给定数字能组成的最大时间","frequency":1.7452190502,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","submitted":23529,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7769611519424029,"acs":10360,"articleLive":2,"columnArticles":161,"formTitle":"[950]按递增顺序显示卡牌","frequency":1.055182292,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","submitted":13334,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6631111111111111,"acs":11936,"articleLive":2,"columnArticles":182,"formTitle":"[951]翻转等价二叉树","frequency":0.0,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","submitted":18000,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.3627565670530682,"acs":3411,"articleLive":2,"columnArticles":66,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","submitted":9403,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.5510954014138727,"acs":15747,"articleLive":2,"columnArticles":187,"formTitle":"[953]验证外星语词典","frequency":0.5233893954,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","submitted":28574,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.3045821010412024,"acs":7518,"articleLive":2,"columnArticles":109,"formTitle":"[954]二倍数对数组","frequency":1.5124236696,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","submitted":24683,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.33323721645520954,"acs":3467,"articleLive":2,"columnArticles":56,"formTitle":"[955]删列造序 II","frequency":0.0,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","submitted":10404,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.44132573795960645,"acs":4261,"articleLive":2,"columnArticles":54,"formTitle":"[956]最高的广告牌","frequency":0.6731005563,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","submitted":9655,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.3612521976948623,"acs":14794,"articleLive":2,"columnArticles":148,"formTitle":"[957]N 天后的牢房","frequency":2.3113899763,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","submitted":40952,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.53740460957373,"acs":27887,"articleLive":2,"columnArticles":269,"formTitle":"[958]二叉树的完全性检验","frequency":1.9219929666,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","submitted":51892,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7439872715163176,"acs":20107,"articleLive":2,"columnArticles":309,"formTitle":"[959]由斜杠划分区域","frequency":0.5506985748,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","submitted":27026,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5599157229391625,"acs":2126,"articleLive":2,"columnArticles":35,"formTitle":"[960]删列造序 III","frequency":0.0,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","submitted":3797,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6774935835029648,"acs":38275,"articleLive":2,"columnArticles":330,"formTitle":"[961]在长度 2N 的数组中找出重复 N 次的元素","frequency":0.0,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","submitted":56495,"title":"在长度 2N 的数组中找出重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.4463770755547461,"acs":14705,"articleLive":2,"columnArticles":149,"formTitle":"[962]最大宽度坡","frequency":1.180738826,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","submitted":32943,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5119453924914675,"acs":2700,"articleLive":2,"columnArticles":33,"formTitle":"[963]最小面积矩形 II","frequency":1.4161956376,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","submitted":5274,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.4398876404494382,"acs":1566,"articleLive":2,"columnArticles":29,"formTitle":"[964]表示数字的最少运算符","frequency":0.0,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","submitted":3560,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6843107460906696,"acs":35578,"articleLive":2,"columnArticles":419,"formTitle":"[965]单值二叉树","frequency":1.4161956376,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","submitted":51991,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.40841553252590834,"acs":3271,"articleLive":2,"columnArticles":54,"formTitle":"[966]元音拼写检查器","frequency":0.0,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","submitted":8009,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.4712822283609576,"acs":8189,"articleLive":2,"columnArticles":165,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","submitted":17376,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.5025191675794085,"acs":27528,"articleLive":2,"columnArticles":356,"formTitle":"[968]监控二叉树","frequency":1.4470622855,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"ac","submitted":54780,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6480772236986088,"acs":16583,"articleLive":2,"columnArticles":207,"formTitle":"[969]煎饼排序","frequency":0.0,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","submitted":25588,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.41290415496507527,"acs":11468,"articleLive":2,"columnArticles":130,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","submitted":27774,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.4446546253356114,"acs":7287,"articleLive":2,"columnArticles":113,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":0.0,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","submitted":16388,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.4031783402001177,"acs":1370,"articleLive":2,"columnArticles":29,"formTitle":"[972]相等的有理数","frequency":0.7821409289,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","submitted":3398,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.6426511144265111,"acs":71074,"articleLive":2,"columnArticles":661,"formTitle":"[973]最接近原点的 K 个点","frequency":1.4161956376,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"ac","submitted":110595,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.46633613227656545,"acs":39598,"articleLive":2,"columnArticles":401,"formTitle":"[974]和可被 K 整除的子数组","frequency":2.0951357915,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","submitted":84913,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.45069849450698496,"acs":3323,"articleLive":2,"columnArticles":52,"formTitle":"[975]奇偶跳","frequency":0.5792230415,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","submitted":7373,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.5978867794862984,"acs":55680,"articleLive":2,"columnArticles":521,"formTitle":"[976]三角形的最大周长","frequency":1.6504212504,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"ac","submitted":93128,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7022479935586089,"acs":216298,"articleLive":2,"columnArticles":1626,"formTitle":"[977]有序数组的平方","frequency":3.1291742289,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"ac","submitted":308008,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.4733023733601558,"acs":44232,"articleLive":2,"columnArticles":607,"formTitle":"[978]最长湍流子数组","frequency":0.5506985748,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","submitted":93454,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7143874080518864,"acs":9032,"articleLive":2,"columnArticles":142,"formTitle":"[979]在二叉树中分配硬币","frequency":1.4161956376,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","submitted":12643,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7348176173845556,"acs":15149,"articleLive":2,"columnArticles":229,"formTitle":"[980]不同路径 III","frequency":2.3712246899,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","submitted":20616,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5305746796710652,"acs":22195,"articleLive":2,"columnArticles":320,"formTitle":"[981]基于时间的键值存储","frequency":2.6214663006,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"ac","submitted":41832,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5507246376811594,"acs":2736,"articleLive":2,"columnArticles":32,"formTitle":"[982]按位与为零的三元组","frequency":0.5792230415,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","submitted":4968,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6336408585447174,"acs":33448,"articleLive":2,"columnArticles":462,"formTitle":"[983]最低票价","frequency":1.479109463,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","submitted":52787,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.4198486714763329,"acs":9544,"articleLive":2,"columnArticles":154,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":1.4161956376,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","submitted":22732,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.6017644719239252,"acs":16643,"articleLive":2,"columnArticles":192,"formTitle":"[985]查询后的偶数和","frequency":0.5792230415,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","questionId":"1027","status":"","submitted":27657,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.682392920978882,"acs":30924,"articleLive":2,"columnArticles":291,"formTitle":"[986]区间列表的交集","frequency":1.8003142275,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"ac","submitted":45317,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5326106000876041,"acs":24319,"articleLive":2,"columnArticles":426,"formTitle":"[987]二叉树的垂序遍历","frequency":2.6470758948,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"ac","submitted":45660,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.5013970661610617,"acs":10049,"articleLive":2,"columnArticles":123,"formTitle":"[988]从叶结点开始的最小字符串","frequency":0.5233893954,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","submitted":20042,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.4697315453449912,"acs":54960,"articleLive":2,"columnArticles":623,"formTitle":"[989]数组形式的整数加法","frequency":1.0847265383,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","submitted":117003,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.5081476602325449,"acs":35487,"articleLive":2,"columnArticles":525,"formTitle":"[990]等式方程的可满足性","frequency":0.5506985748,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","submitted":69836,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5212427581506305,"acs":9177,"articleLive":2,"columnArticles":114,"formTitle":"[991]坏了的计算器","frequency":0.0,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","submitted":17606,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.45558595276645636,"acs":24480,"articleLive":2,"columnArticles":279,"formTitle":"[992]K 个不同整数的子数组","frequency":1.4470622855,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","submitted":53733,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5571792014465634,"acs":53000,"articleLive":2,"columnArticles":835,"formTitle":"[993]二叉树的堂兄弟节点","frequency":1.4161956376,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"ac","submitted":95122,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5110110639822195,"acs":62768,"articleLive":2,"columnArticles":1503,"formTitle":"[994]腐烂的橘子","frequency":2.0316190228,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"ac","submitted":122831,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5389662855324046,"acs":22013,"articleLive":2,"columnArticles":255,"formTitle":"[995]K 连续位的最小翻转次数","frequency":0.5792230415,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","submitted":40843,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.4946797190891679,"acs":4649,"articleLive":2,"columnArticles":96,"formTitle":"[996]正方形数组的数目","frequency":0.0,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","submitted":9398,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5356276619685439,"acs":64263,"articleLive":2,"columnArticles":688,"formTitle":"[997]找到小镇的法官","frequency":1.2274653825,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","submitted":119977,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6178724708767627,"acs":8062,"articleLive":2,"columnArticles":121,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","submitted":13048,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.691250083427885,"acs":31071,"articleLive":2,"columnArticles":580,"formTitle":"[999]可以被一步捕获的棋子数","frequency":0.0,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","submitted":44949,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.4113255838754399,"acs":3857,"articleLive":2,"columnArticles":43,"formTitle":"[1000]合并石头的最低成本","frequency":1.6209900502,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","submitted":9377,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.29740755362547705,"acs":2260,"articleLive":2,"columnArticles":58,"formTitle":"[1001]网格照明","frequency":0.7438514124,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","submitted":7599,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7309000171245443,"acs":59754,"articleLive":2,"columnArticles":632,"formTitle":"[1002]查找共用字符","frequency":2.3712246899,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","submitted":81754,"title":"查找共用字符","titleSlug":"find-common-characters"},{"acceptance":0.5791849015317286,"acs":12705,"articleLive":2,"columnArticles":191,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"ac","submitted":21936,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5955257894219104,"acs":72647,"articleLive":2,"columnArticles":761,"formTitle":"[1004]最大连续1的个数 III","frequency":2.4620152724,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"ac","submitted":121988,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5208165129384517,"acs":63862,"articleLive":2,"columnArticles":1013,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":0.8783052927,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","submitted":122619,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.6268836311231128,"acs":44804,"articleLive":2,"columnArticles":611,"formTitle":"[1006]笨阶乘","frequency":0.0,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"ac","submitted":71471,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.4664576802507837,"acs":6696,"articleLive":2,"columnArticles":89,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","submitted":14355,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7218380205932073,"acs":18788,"articleLive":2,"columnArticles":242,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":1.6504212504,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","submitted":26028,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5885422030000343,"acs":17146,"articleLive":2,"columnArticles":244,"formTitle":"[1009]十进制整数的反码","frequency":1.0847265383,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","submitted":29133,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.45574128597207714,"acs":19194,"articleLive":2,"columnArticles":257,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":0.5233893954,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","questionId":"1055","status":"","submitted":42116,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6256432205285838,"acs":64318,"articleLive":2,"columnArticles":615,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":1.3864315356,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"ac","submitted":102803,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.33885071830106184,"acs":3255,"articleLive":2,"columnArticles":68,"formTitle":"[1012]至少有 1 位重复的数字","frequency":1.2518925863,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","submitted":9606,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.39435078618900954,"acs":48655,"articleLive":2,"columnArticles":941,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":1.7452190502,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1062","status":"","submitted":123380,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5567198468410977,"acs":43619,"articleLive":2,"columnArticles":501,"formTitle":"[1014]最佳观光组合","frequency":0.9993018336,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","submitted":78350,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.3577246997100649,"acs":5182,"articleLive":2,"columnArticles":44,"formTitle":"[1015]可被 K 整除的最小整数","frequency":0.7075629605,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","submitted":14486,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5839872746553553,"acs":5507,"articleLive":2,"columnArticles":88,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.60905819,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1065","status":"","submitted":9430,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.5623880597014925,"acs":3768,"articleLive":2,"columnArticles":58,"formTitle":"[1017]负二进制转换","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","submitted":6700,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.5156724661695664,"acs":44814,"articleLive":2,"columnArticles":385,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","submitted":86904,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.6000500737196428,"acs":21570,"articleLive":2,"columnArticles":287,"formTitle":"[1019]链表中的下一个更大节点","frequency":0.5506985748,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"ac","submitted":35947,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5514613093735803,"acs":10925,"articleLive":2,"columnArticles":169,"formTitle":"[1020]飞地的数量","frequency":1.0267308708,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","submitted":19811,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7831494430814846,"acs":59694,"articleLive":2,"columnArticles":678,"formTitle":"[1021]删除最外层的括号","frequency":0.0,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"ac","submitted":76223,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7075644832994094,"acs":21205,"articleLive":2,"columnArticles":283,"formTitle":"[1022]从根到叶的二进制数之和","frequency":0.5233893954,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","submitted":29969,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5671986873508353,"acs":7605,"articleLive":2,"columnArticles":174,"formTitle":"[1023]驼峰式匹配","frequency":0.0,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","submitted":13408,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.555667080903674,"acs":34877,"articleLive":2,"columnArticles":398,"formTitle":"[1024]视频拼接","frequency":0.0,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","submitted":62766,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7091062854648625,"acs":77979,"articleLive":2,"columnArticles":664,"formTitle":"[1025]除数博弈","frequency":1.055182292,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","submitted":109968,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6756996327719387,"acs":10672,"articleLive":2,"columnArticles":185,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","submitted":15794,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.4341380770859805,"acs":14350,"articleLive":2,"columnArticles":130,"formTitle":"[1027]最长等差数列","frequency":1.479109463,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"ac","submitted":33054,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7319171164896395,"acs":21017,"articleLive":2,"columnArticles":440,"formTitle":"[1028]从先序遍历还原二叉树","frequency":1.814643173,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","submitted":28715,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6602046511627907,"acs":17743,"articleLive":2,"columnArticles":193,"formTitle":"[1029]两地调度","frequency":0.4972098898,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"ac","submitted":26875,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7095823769228133,"acs":41424,"articleLive":2,"columnArticles":456,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":0.60905819,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","submitted":58378,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5737581804527411,"acs":5348,"articleLive":2,"columnArticles":88,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","submitted":9321,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.410263720598717,"acs":2878,"articleLive":2,"columnArticles":47,"formTitle":"[1032]字符流","frequency":1.1474135162,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","submitted":7015,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.3936232888580835,"acs":11358,"articleLive":2,"columnArticles":172,"formTitle":"[1033]移动石子直到连续","frequency":0.5792230415,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","questionId":"1103","status":"","submitted":28855,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.5602195545727373,"acs":28374,"articleLive":2,"columnArticles":460,"formTitle":"[1034]边界着色","frequency":1.2770828351,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","submitted":50648,"title":"边界着色","titleSlug":"coloring-a-border"},{"acceptance":0.6398196844477836,"acs":38322,"articleLive":2,"columnArticles":412,"formTitle":"[1035]不相交的线","frequency":0.5233893954,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"ac","submitted":59895,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.3025117071094083,"acs":3553,"articleLive":2,"columnArticles":60,"formTitle":"[1036]逃离大迷宫","frequency":1.2155249421,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","submitted":11745,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.4394592310942121,"acs":10402,"articleLive":2,"columnArticles":135,"formTitle":"[1037]有效的回旋镖","frequency":1.479109463,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","submitted":23670,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.7957730234703881,"acs":27599,"articleLive":2,"columnArticles":343,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":1.0267308708,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","submitted":34682,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5580206760367058,"acs":4804,"articleLive":2,"columnArticles":65,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","submitted":8609,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.52275291462956,"acs":2780,"articleLive":2,"columnArticles":32,"formTitle":"[1040]移动石子直到连续 II","frequency":0.7438514124,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","submitted":5318,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.4872671007671975,"acs":7558,"articleLive":2,"columnArticles":123,"formTitle":"[1041]困于环中的机器人","frequency":1.5124236696,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","submitted":15511,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5343100809096873,"acs":12217,"articleLive":2,"columnArticles":160,"formTitle":"[1042]不邻接植花","frequency":0.5506985748,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","submitted":22865,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.6926301668483273,"acs":8261,"articleLive":2,"columnArticles":104,"formTitle":"[1043]分隔数组以得到最大和","frequency":1.479109463,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","submitted":11927,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.34467470873285905,"acs":20058,"articleLive":2,"columnArticles":183,"formTitle":"[1044]最长重复子串","frequency":2.491818408,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"ac","submitted":58194,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6412485454172085,"acs":9368,"articleLive":2,"columnArticles":117,"formTitle":"[1045]买下所有产品的客户","frequency":0.5233893954,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"","submitted":14609,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6590353326273226,"acs":68454,"articleLive":2,"columnArticles":956,"formTitle":"[1046]最后一块石头的重量","frequency":1.055182292,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","submitted":103870,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.7242835146277257,"acs":116656,"articleLive":2,"columnArticles":1036,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":2.5843057207,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"ac","submitted":161064,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.46461848400906575,"acs":11070,"articleLive":2,"columnArticles":157,"formTitle":"[1048]最长字符串链","frequency":2.7142972866,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","submitted":23826,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6511589944498858,"acs":47868,"articleLive":2,"columnArticles":443,"formTitle":"[1049]最后一块石头的重量 II","frequency":1.0267308708,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"ac","submitted":73512,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7606261288380494,"acs":12634,"articleLive":2,"columnArticles":60,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":1.4161956376,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1136","status":"","submitted":16610,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7562478123906196,"acs":32409,"articleLive":2,"columnArticles":385,"formTitle":"[1051]高度检查器","frequency":1.055182292,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","submitted":42855,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5801835288651411,"acs":49948,"articleLive":2,"columnArticles":773,"formTitle":"[1052]爱生气的书店老板","frequency":1.1474135162,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","submitted":86090,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.45973678340397056,"acs":6183,"articleLive":2,"columnArticles":98,"formTitle":"[1053]交换一次的先前排列","frequency":0.0,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","submitted":13449,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.3822017852312686,"acs":8478,"articleLive":2,"columnArticles":113,"formTitle":"[1054]距离相等的条形码","frequency":0.5233893954,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","submitted":22182,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5944382647385984,"acs":5344,"articleLive":2,"columnArticles":99,"formTitle":"[1055]形成字符串的最短路径","frequency":1.1154414835,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"","submitted":8990,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.41799929963814636,"acs":3581,"articleLive":2,"columnArticles":70,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"","submitted":8567,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.4718786808009423,"acs":3205,"articleLive":2,"columnArticles":42,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"","submitted":6792,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.3474722564734895,"acs":1409,"articleLive":2,"columnArticles":36,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"","submitted":4055,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.3647723891698899,"acs":2452,"articleLive":2,"columnArticles":40,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"511","status":"","submitted":6722,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.5296531509526136,"acs":5421,"articleLive":2,"columnArticles":80,"formTitle":"[1060]有序数组中的缺失元素","frequency":0.0,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"","submitted":10235,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.6092936028339238,"acs":2924,"articleLive":2,"columnArticles":64,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"","submitted":4799,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.5467625899280576,"acs":3724,"articleLive":2,"columnArticles":52,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"","submitted":6811,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.7152627789776818,"acs":1987,"articleLive":2,"columnArticles":43,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"","submitted":2778,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6491836997043322,"acs":5050,"articleLive":2,"columnArticles":72,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"","submitted":7779,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5429995845450769,"acs":2614,"articleLive":2,"columnArticles":73,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"","submitted":4814,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.47773454388240383,"acs":2210,"articleLive":2,"columnArticles":43,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"","submitted":4626,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.4173076923076923,"acs":868,"articleLive":2,"columnArticles":26,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"","submitted":2080,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.8667194832104334,"acs":14222,"articleLive":2,"columnArticles":69,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"","submitted":16409,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8185451097263614,"acs":12085,"articleLive":2,"columnArticles":60,"formTitle":"[1069]产品销售分析 II","frequency":0.0,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"","submitted":14764,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.47897196261682246,"acs":8610,"articleLive":2,"columnArticles":76,"formTitle":"[1070]产品销售分析 III","frequency":0.0,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"","submitted":17976,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5875496688741721,"acs":35488,"articleLive":2,"columnArticles":683,"formTitle":"[1071]字符串的最大公因子","frequency":1.055182292,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"ac","submitted":60400,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5892564690468391,"acs":3598,"articleLive":2,"columnArticles":61,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":0.0,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1147","status":"","submitted":6106,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.34192037470725994,"acs":2628,"articleLive":2,"columnArticles":56,"formTitle":"[1073]负二进制数相加","frequency":0.0,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","submitted":7686,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6687668129689933,"acs":18894,"articleLive":2,"columnArticles":195,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":0.0,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"ac","submitted":28252,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6942039521512128,"acs":10504,"articleLive":2,"columnArticles":78,"formTitle":"[1075]项目员工 I","frequency":0.4972098898,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"","submitted":15131,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.4939310284387187,"acs":11272,"articleLive":2,"columnArticles":94,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"","submitted":22821,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7226706439726268,"acs":8237,"articleLive":2,"columnArticles":91,"formTitle":"[1077]项目员工 III","frequency":0.5233893954,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"","submitted":11398,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.7360916458472976,"acs":12080,"articleLive":2,"columnArticles":200,"formTitle":"[1079]活字印刷","frequency":0.5506985748,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","submitted":16411,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.49684120355498446,"acs":4640,"articleLive":2,"columnArticles":102,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","submitted":9339,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.5722700174918788,"acs":16031,"articleLive":2,"columnArticles":161,"formTitle":"[1081]不同字符的最小子序列","frequency":1.6808881918,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"ac","submitted":28013,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7608946696651067,"acs":12519,"articleLive":2,"columnArticles":99,"formTitle":"[1082]销售分析 I ","frequency":1.1154414835,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"","submitted":16453,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.5278502654548727,"acs":11732,"articleLive":2,"columnArticles":109,"formTitle":"[1083]销售分析 II","frequency":1.1154414835,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"","submitted":22226,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.536050007157513,"acs":11234,"articleLive":2,"columnArticles":105,"formTitle":"[1084]销售分析III","frequency":0.5233893954,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"","submitted":20957,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.7718940936863544,"acs":3790,"articleLive":2,"columnArticles":76,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"","submitted":4910,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6858203224980803,"acs":5359,"articleLive":2,"columnArticles":85,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"","submitted":7814,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.5391038129696633,"acs":1937,"articleLive":2,"columnArticles":55,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"","submitted":3593,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.45734208367514356,"acs":1115,"articleLive":2,"columnArticles":36,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"","submitted":2438,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.584166265537843,"acs":20631,"articleLive":2,"columnArticles":306,"formTitle":"[1089]复写零","frequency":0.0,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","submitted":35317,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5520446096654275,"acs":4158,"articleLive":2,"columnArticles":86,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","submitted":7532,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.3800180186504733,"acs":32479,"articleLive":2,"columnArticles":328,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":2.5225976443,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"ac","submitted":85467,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.49411561093804085,"acs":2855,"articleLive":2,"columnArticles":56,"formTitle":"[1092]最短公共超序列","frequency":1.9301783279,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","submitted":5778,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.3707896971412397,"acs":3930,"articleLive":2,"columnArticles":63,"formTitle":"[1093]大样本统计","frequency":0.0,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","submitted":10599,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.5924224163904791,"acs":31460,"articleLive":2,"columnArticles":439,"formTitle":"[1094]拼车","frequency":2.2763969028,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","submitted":53104,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.3724594779971842,"acs":20635,"articleLive":2,"columnArticles":397,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","submitted":55402,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5474044140503574,"acs":1761,"articleLive":2,"columnArticles":49,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","submitted":3217,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.52284225628634,"acs":6924,"articleLive":2,"columnArticles":123,"formTitle":"[1097]游戏玩法分析 V","frequency":2.0255050395,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"","submitted":13243,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.47493682787800434,"acs":8082,"articleLive":2,"columnArticles":107,"formTitle":"[1098]小众书籍","frequency":0.5792230415,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"","submitted":17017,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5864291958041958,"acs":5367,"articleLive":2,"columnArticles":99,"formTitle":"[1099]小于 K 的两数之和","frequency":0.4972098898,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"","submitted":9152,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.6986888861659111,"acs":5702,"articleLive":2,"columnArticles":115,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":1.1154414835,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1084","status":"","submitted":8161,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6743642968344578,"acs":2599,"articleLive":2,"columnArticles":64,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1085","status":"","submitted":3854,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.37474962848097176,"acs":5800,"articleLive":2,"columnArticles":70,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"","submitted":15477,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6371084169696126,"acs":36628,"articleLive":2,"columnArticles":1120,"formTitle":"[1103]分糖果 II","frequency":1.4470622855,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","submitted":57491,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.760418837257762,"acs":29194,"articleLive":2,"columnArticles":686,"formTitle":"[1104]二叉树寻路","frequency":2.3069429551,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"ac","submitted":38392,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5617393113492146,"acs":5400,"articleLive":2,"columnArticles":71,"formTitle":"[1105]填充书架","frequency":1.2518925863,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","submitted":9613,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.5814408770555991,"acs":4455,"articleLive":2,"columnArticles":131,"formTitle":"[1106]解析布尔表达式","frequency":0.9598334118,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","submitted":7662,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.4117972554227534,"acs":7442,"articleLive":2,"columnArticles":99,"formTitle":"[1107]每日新用户统计","frequency":1.180738826,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"","submitted":18072,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.8388214277092436,"acs":69493,"articleLive":2,"columnArticles":703,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","submitted":82846,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.583741799955775,"acs":63357,"articleLive":2,"columnArticles":624,"formTitle":"[1109]航班预订统计","frequency":2.5225976443,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"ac","submitted":108536,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6304937324123817,"acs":12323,"articleLive":2,"columnArticles":223,"formTitle":"[1110]删点成林","frequency":1.055182292,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","submitted":19545,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7714132930703659,"acs":24524,"articleLive":2,"columnArticles":405,"formTitle":"[1111]有效括号的嵌套深度","frequency":1.2155249421,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"","submitted":31791,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.6468474099539027,"acs":8279,"articleLive":2,"columnArticles":96,"formTitle":"[1112]每位学生的最高成绩","frequency":0.0,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"","submitted":12799,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5403986663829183,"acs":7618,"articleLive":2,"columnArticles":53,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"","submitted":14097,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.653312418970181,"acs":81634,"articleLive":2,"columnArticles":602,"formTitle":"[1114]按序打印","frequency":3.2945183547,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","submitted":124954,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5613647249548653,"acs":45708,"articleLive":2,"columnArticles":494,"formTitle":"[1115]交替打印 FooBar","frequency":1.055182292,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","submitted":81423,"title":"交替打印 FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.521431499018487,"acs":24172,"articleLive":2,"columnArticles":381,"formTitle":"[1116]打印零与奇偶数","frequency":2.6214663006,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","submitted":46357,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.5233927298645759,"acs":18358,"articleLive":2,"columnArticles":261,"formTitle":"[1117]H2O 生成","frequency":1.8899799896,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","submitted":35075,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.6357715430861723,"acs":2538,"articleLive":2,"columnArticles":42,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"","submitted":3992,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8654465004022526,"acs":8606,"articleLive":2,"columnArticles":152,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"","submitted":9944,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.6157538730089461,"acs":2822,"articleLive":2,"columnArticles":52,"formTitle":"[1120]子树的最大平均值","frequency":0.0,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"","submitted":4583,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5712151394422311,"acs":1147,"articleLive":2,"columnArticles":20,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"","submitted":2008,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.7069075407232491,"acs":67656,"articleLive":2,"columnArticles":901,"formTitle":"[1122]数组的相对排序","frequency":2.0316190228,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","submitted":95707,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7043798542717592,"acs":8797,"articleLive":2,"columnArticles":115,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.5233893954,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","submitted":12489,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.3211846168241789,"acs":13730,"articleLive":2,"columnArticles":148,"formTitle":"[1124]表现良好的最长时间段","frequency":0.5506985748,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"ac","submitted":42748,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.49284945409810854,"acs":3205,"articleLive":2,"columnArticles":52,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","submitted":6503,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6905226409282267,"acs":6725,"articleLive":2,"columnArticles":99,"formTitle":"[1126]查询活跃业务","frequency":0.4972098898,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"","submitted":9739,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.42422513785890853,"acs":4462,"articleLive":2,"columnArticles":78,"formTitle":"[1127]用户购买平台","frequency":1.2155249421,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"","submitted":10518,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.5447005137330311,"acs":37958,"articleLive":2,"columnArticles":488,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":1.055182292,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","submitted":69686,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.3838248954946586,"acs":6611,"articleLive":2,"columnArticles":122,"formTitle":"[1129]颜色交替的最短路径","frequency":1.180738826,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","submitted":17224,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6323236349143085,"acs":6346,"articleLive":2,"columnArticles":114,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.5233893954,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"ac","submitted":10036,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.45787700084245997,"acs":3261,"articleLive":2,"columnArticles":49,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","submitted":7122,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.3920849854118351,"acs":5241,"articleLive":2,"columnArticles":56,"formTitle":"[1132]报告的记录 II","frequency":0.6731005563,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"","submitted":13367,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6441266598569969,"acs":3153,"articleLive":2,"columnArticles":68,"formTitle":"[1133]最大唯一数","frequency":0.5792230415,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"","submitted":4895,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7722428174235403,"acs":3333,"articleLive":2,"columnArticles":56,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"","submitted":4316,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.5410373760488177,"acs":7093,"articleLive":2,"columnArticles":79,"formTitle":"[1135]最低成本联通所有城市","frequency":0.5506985748,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"","submitted":13110,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5752544188537762,"acs":3222,"articleLive":2,"columnArticles":56,"formTitle":"[1136]平行课程","frequency":0.60905819,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"","submitted":5601,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.6094935614622621,"acs":95184,"articleLive":2,"columnArticles":967,"formTitle":"[1137]第 N 个泰波那契数","frequency":2.2295279688,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"ac","submitted":156169,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.4362506753106429,"acs":6460,"articleLive":2,"columnArticles":144,"formTitle":"[1138]字母板上的路径","frequency":0.0,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","submitted":14808,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.48144369960167105,"acs":9911,"articleLive":2,"columnArticles":158,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":1.7452190502,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","submitted":20586,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.651797906235776,"acs":7160,"articleLive":2,"columnArticles":99,"formTitle":"[1140]石子游戏 II","frequency":1.055182292,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","submitted":10985,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5085652602431125,"acs":10836,"articleLive":2,"columnArticles":70,"formTitle":"[1141]查询近30天活跃用户数","frequency":1.0847265383,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1245","status":"","submitted":21307,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.3722293370111319,"acs":7557,"articleLive":2,"columnArticles":52,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1246","status":"","submitted":20302,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6385009254192271,"acs":183184,"articleLive":2,"columnArticles":1216,"formTitle":"[1143]最长公共子序列","frequency":3.349033705,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"ac","submitted":286897,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.443021072397246,"acs":10617,"articleLive":2,"columnArticles":148,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":0.6403107335,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"notac","submitted":23965,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.469883572245777,"acs":6982,"articleLive":2,"columnArticles":110,"formTitle":"[1145]二叉树着色游戏","frequency":0.0,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","submitted":14859,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.2909136389218936,"acs":4652,"articleLive":2,"columnArticles":67,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","submitted":15991,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5625159154570919,"acs":4418,"articleLive":2,"columnArticles":89,"formTitle":"[1147]段式回文","frequency":2.128636021,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","submitted":7854,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7121377572448551,"acs":8478,"articleLive":2,"columnArticles":38,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"","submitted":11905,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.44244550612123024,"acs":5927,"articleLive":2,"columnArticles":50,"formTitle":"[1149]文章浏览 II","frequency":0.5506985748,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"","submitted":13396,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.600117716303708,"acs":5098,"articleLive":2,"columnArticles":90,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":1.0847265383,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1102","status":"","submitted":8495,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.49690386762765204,"acs":4895,"articleLive":2,"columnArticles":74,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":1.0847265383,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"","submitted":9851,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.3910485933503836,"acs":1529,"articleLive":2,"columnArticles":37,"formTitle":"[1152]用户网站访问行为分析","frequency":0.6731005563,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"","submitted":3910,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.36921783010933557,"acs":1756,"articleLive":2,"columnArticles":24,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"","submitted":4756,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.6502933193240522,"acs":44562,"articleLive":2,"columnArticles":530,"formTitle":"[1154]一年中的第几天","frequency":1.3819457145,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","submitted":68526,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.4806560323522804,"acs":10697,"articleLive":2,"columnArticles":136,"formTitle":"[1155]掷骰子的N种方法","frequency":1.5471012081,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","submitted":22255,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.43040115998066697,"acs":5343,"articleLive":2,"columnArticles":98,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.5233893954,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","submitted":12414,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.322606436138317,"acs":3228,"articleLive":2,"columnArticles":49,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":0.0,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","submitted":10006,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5520233854023934,"acs":6043,"articleLive":2,"columnArticles":64,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"","submitted":10947,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.49341953359501267,"acs":4274,"articleLive":2,"columnArticles":89,"formTitle":"[1159]市场分析 II","frequency":1.1154414835,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"","submitted":8662,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6871951630666876,"acs":61148,"articleLive":2,"columnArticles":930,"formTitle":"[1160]拼写单词","frequency":1.4161956376,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1112","status":"","submitted":88982,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6328677260645817,"acs":11191,"articleLive":2,"columnArticles":183,"formTitle":"[1161]最大层内元素和","frequency":1.0847265383,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","submitted":17683,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.4711422418893017,"acs":39820,"articleLive":2,"columnArticles":504,"formTitle":"[1162]地图分析","frequency":0.4972098898,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","submitted":84518,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.26781539527231796,"acs":6186,"articleLive":2,"columnArticles":106,"formTitle":"[1163]按字典序排在最后的子串","frequency":0.0,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","submitted":23098,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6101253616200578,"acs":6327,"articleLive":2,"columnArticles":92,"formTitle":"[1164]指定日期的产品价格","frequency":1.479109463,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"","submitted":10370,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8354430379746836,"acs":7854,"articleLive":2,"columnArticles":120,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"","submitted":9401,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.476354525524585,"acs":3042,"articleLive":2,"columnArticles":53,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"","submitted":6386,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.4481385281385281,"acs":2588,"articleLive":2,"columnArticles":39,"formTitle":"[1167]连接棒材的最低费用","frequency":0.5792230415,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"","submitted":5775,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5677715786019035,"acs":1730,"articleLive":2,"columnArticles":32,"formTitle":"[1168]水资源分配优化","frequency":0.9993018336,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"","submitted":3047,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.32254807471660013,"acs":7028,"articleLive":2,"columnArticles":83,"formTitle":"[1169]查询无效交易","frequency":0.5792230415,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","submitted":21789,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6161120840630473,"acs":14072,"articleLive":2,"columnArticles":224,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":0.5792230415,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","questionId":"1273","status":"","submitted":22840,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.47594603031459193,"acs":13722,"articleLive":2,"columnArticles":166,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":2.128636021,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"ac","submitted":28831,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.2630315157578789,"acs":2629,"articleLive":2,"columnArticles":59,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","submitted":9995,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.7546816479400749,"acs":8866,"articleLive":2,"columnArticles":81,"formTitle":"[1173]即时食物配送 I","frequency":0.4972098898,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"","submitted":11748,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.6222709945708675,"acs":5387,"articleLive":2,"columnArticles":68,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"","submitted":8657,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.49109764478040857,"acs":7861,"articleLive":2,"columnArticles":123,"formTitle":"[1175]质数排列","frequency":1.0847265383,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","submitted":16007,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.45438247011952193,"acs":4562,"articleLive":2,"columnArticles":70,"formTitle":"[1176]健身计划评估","frequency":0.0,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"","submitted":10040,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.26929074128703273,"acs":6390,"articleLive":2,"columnArticles":98,"formTitle":"[1177]构建回文串检测","frequency":1.2155249421,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","submitted":23729,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.46267229116593905,"acs":18865,"articleLive":2,"columnArticles":186,"formTitle":"[1178]猜字谜","frequency":0.0,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","submitted":40774,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.6371591018598824,"acs":33059,"articleLive":2,"columnArticles":197,"formTitle":"[1179]重新格式化部门表","frequency":2.4522875692,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","submitted":51885,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7748753265257659,"acs":3263,"articleLive":2,"columnArticles":76,"formTitle":"[1180]统计只含单一字母的子串","frequency":0.0,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1131","status":"","submitted":4211,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.3731524109522656,"acs":1540,"articleLive":2,"columnArticles":30,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"","submitted":4127,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.4188327611574301,"acs":2562,"articleLive":2,"columnArticles":45,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"","submitted":6117,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.5888501742160279,"acs":676,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"","submitted":1148,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5836998921072288,"acs":14066,"articleLive":2,"columnArticles":275,"formTitle":"[1184]公交站间的距离","frequency":0.5233893954,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","submitted":24098,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6009750332397695,"acs":12204,"articleLive":2,"columnArticles":221,"formTitle":"[1185]一周中的第几天","frequency":0.4720829397,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","submitted":20307,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.39780230858410204,"acs":7892,"articleLive":2,"columnArticles":115,"formTitle":"[1186]删除一次得到子数组最大和","frequency":1.0847265383,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","submitted":19839,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.44454402868025994,"acs":1984,"articleLive":2,"columnArticles":35,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","submitted":4463,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.697601871709885,"acs":3578,"articleLive":2,"columnArticles":68,"formTitle":"[1188]设计有限阻塞队列","frequency":1.5124236696,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"","submitted":5129,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6455346650998824,"acs":21974,"articleLive":2,"columnArticles":346,"formTitle":"[1189]“气球” 的最大数量","frequency":1.0847265383,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","submitted":34040,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6506871294035578,"acs":46638,"articleLive":2,"columnArticles":628,"formTitle":"[1190]反转每对括号间的子串","frequency":2.1995541978,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"ac","submitted":71675,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.2663779797633339,"acs":6213,"articleLive":2,"columnArticles":96,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","submitted":23324,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.5018295307791649,"acs":4663,"articleLive":2,"columnArticles":54,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","submitted":9292,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.6045642337202439,"acs":6146,"articleLive":2,"columnArticles":76,"formTitle":"[1193]每月交易 I","frequency":0.60905819,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"","submitted":10166,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5131233595800525,"acs":3910,"articleLive":2,"columnArticles":67,"formTitle":"[1194]锦标赛优胜者","frequency":0.4972098898,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"","submitted":7620,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6380635688374503,"acs":14775,"articleLive":2,"columnArticles":284,"formTitle":"[1195]交替打印字符串","frequency":2.0316190228,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","submitted":23156,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6869677897075157,"acs":3711,"articleLive":2,"columnArticles":62,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.60905819,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"","submitted":5402,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.37474892395982784,"acs":5224,"articleLive":2,"columnArticles":63,"formTitle":"[1197]进击的骑士","frequency":0.60905819,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"","submitted":13940,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7402031930333817,"acs":4080,"articleLive":2,"columnArticles":63,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"","submitted":5512,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.4378531073446328,"acs":775,"articleLive":2,"columnArticles":20,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"","submitted":1770,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6840436646611665,"acs":18987,"articleLive":2,"columnArticles":269,"formTitle":"[1200]最小绝对差","frequency":1.4161956376,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","submitted":27757,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.25006790051604394,"acs":6445,"articleLive":2,"columnArticles":90,"formTitle":"[1201]丑数 III","frequency":1.9896640473,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","submitted":25773,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.503248714241265,"acs":27496,"articleLive":2,"columnArticles":303,"formTitle":"[1202]交换字符串中的元素","frequency":0.5792230415,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","submitted":54637,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6188442211055276,"acs":12315,"articleLive":2,"columnArticles":146,"formTitle":"[1203]项目管理","frequency":0.0,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","submitted":19900,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7302899592619219,"acs":6095,"articleLive":2,"columnArticles":85,"formTitle":"[1204]最后一个能进入电梯的人","frequency":0.0,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1327","status":"","submitted":8346,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.4680834001603849,"acs":5837,"articleLive":2,"columnArticles":87,"formTitle":"[1205]每月交易II","frequency":0.60905819,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"","submitted":12470,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6136592937524253,"acs":7907,"articleLive":2,"columnArticles":98,"formTitle":"[1206]设计跳表","frequency":0.0,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","submitted":12885,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7297268357683339,"acs":61335,"articleLive":2,"columnArticles":850,"formTitle":"[1207]独一无二的出现次数","frequency":1.6808881918,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","submitted":84052,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.4973541827694869,"acs":50190,"articleLive":2,"columnArticles":632,"formTitle":"[1208]尽可能使字符串相等","frequency":0.0,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","submitted":100914,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5236589271417134,"acs":13081,"articleLive":2,"columnArticles":166,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":0.5792230415,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"ac","submitted":24980,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.452932479053721,"acs":2757,"articleLive":2,"columnArticles":56,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":0.9111856876,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","submitted":6087,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6592851909142717,"acs":8098,"articleLive":2,"columnArticles":65,"formTitle":"[1211]查询结果的质量和占比","frequency":0.4720829397,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"","submitted":12283,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5145694135115071,"acs":5545,"articleLive":2,"columnArticles":106,"formTitle":"[1212]查询球队积分","frequency":1.1154414835,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"","submitted":10776,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7762246412666997,"acs":6275,"articleLive":2,"columnArticles":135,"formTitle":"[1213]三个有序数组的交集","frequency":0.5506985748,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"","submitted":8084,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6387343532684284,"acs":3674,"articleLive":2,"columnArticles":75,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":0.5792230415,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"","submitted":5752,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.4128757108042242,"acs":2033,"articleLive":2,"columnArticles":43,"formTitle":"[1215]步进数","frequency":0.0,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"","submitted":4924,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5391860073999327,"acs":1603,"articleLive":2,"columnArticles":38,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"","submitted":2973,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6958874458874459,"acs":23148,"articleLive":2,"columnArticles":371,"formTitle":"[1217]玩筹码","frequency":1.055182292,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1329","status":"ac","submitted":33264,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.514361473213666,"acs":37051,"articleLive":2,"columnArticles":358,"formTitle":"[1218]最长定差子序列","frequency":2.8504419398,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"ac","submitted":72033,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6298669536294267,"acs":12877,"articleLive":2,"columnArticles":184,"formTitle":"[1219]黄金矿工","frequency":1.4161956376,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","submitted":20444,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5287207951465083,"acs":4096,"articleLive":2,"columnArticles":79,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","submitted":7747,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.8439129595055688,"acs":78651,"articleLive":2,"columnArticles":1137,"formTitle":"[1221]分割平衡字符串","frequency":2.5873472706,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"ac","submitted":93198,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6755878209990248,"acs":6235,"articleLive":2,"columnArticles":136,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.5506985748,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","submitted":9229,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.4749254540525888,"acs":3504,"articleLive":2,"columnArticles":60,"formTitle":"[1223]掷骰子模拟","frequency":0.8226322903,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","questionId":"1343","status":"","submitted":7378,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.3257570693228157,"acs":4873,"articleLive":2,"columnArticles":71,"formTitle":"[1224]最大相等频率","frequency":1.3299352933,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","submitted":14959,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5393471291168755,"acs":3701,"articleLive":2,"columnArticles":86,"formTitle":"[1225]报告系统状态的连续日期","frequency":1.055182292,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"","submitted":6862,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.59412265758092,"acs":12555,"articleLive":2,"columnArticles":140,"formTitle":"[1226]哲学家进餐","frequency":2.2426782668,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","submitted":21132,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6641856392294221,"acs":10619,"articleLive":2,"columnArticles":167,"formTitle":"[1227]飞机座位分配概率","frequency":1.0847265383,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","submitted":15988,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5379079497907949,"acs":3214,"articleLive":2,"columnArticles":57,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"","submitted":5975,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.4319296221517162,"acs":2995,"articleLive":2,"columnArticles":55,"formTitle":"[1229]安排会议日程","frequency":0.5233893954,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"","submitted":6934,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.5013247803653604,"acs":3595,"articleLive":2,"columnArticles":70,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"","submitted":7171,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.5712268591151554,"acs":3641,"articleLive":2,"columnArticles":50,"formTitle":"[1231]分享巧克力","frequency":0.5792230415,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"","submitted":6374,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.46892509383669695,"acs":34481,"articleLive":2,"columnArticles":428,"formTitle":"[1232]缀点成线","frequency":0.5233893954,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","submitted":73532,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.4862773887508471,"acs":8611,"articleLive":2,"columnArticles":124,"formTitle":"[1233]删除子文件夹","frequency":0.0,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","submitted":17708,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.3474824517769303,"acs":6287,"articleLive":2,"columnArticles":97,"formTitle":"[1234]替换子串得到平衡字符串","frequency":1.7452190502,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","submitted":18093,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.46736634962282714,"acs":7125,"articleLive":2,"columnArticles":124,"formTitle":"[1235]规划兼职工作","frequency":1.9301783279,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","submitted":15245,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.5706472196900638,"acs":1252,"articleLive":2,"columnArticles":33,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"","submitted":2194,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.7119583818194264,"acs":10401,"articleLive":2,"columnArticles":138,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","questionId":"1358","status":"","submitted":14609,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.6623062990541356,"acs":3291,"articleLive":2,"columnArticles":77,"formTitle":"[1238]循环码排列","frequency":0.7075629605,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","submitted":4969,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.4914389448929352,"acs":35734,"articleLive":2,"columnArticles":391,"formTitle":"[1239]串联字符串的最大长度","frequency":0.0,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","questionId":"1360","status":"","submitted":72713,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.49651120088138084,"acs":2704,"articleLive":2,"columnArticles":41,"formTitle":"[1240]铺瓷砖","frequency":1.4629331154,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","submitted":5446,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5931698177482542,"acs":6965,"articleLive":2,"columnArticles":69,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"","submitted":11742,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.47002067539627845,"acs":1364,"articleLive":2,"columnArticles":21,"formTitle":"[1242]多线程网页爬虫","frequency":0.9993018336,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"","submitted":2902,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5384157236450268,"acs":2712,"articleLive":2,"columnArticles":62,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"","submitted":5037,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6244630341397241,"acs":2762,"articleLive":2,"columnArticles":46,"formTitle":"[1244]力扣排行榜","frequency":0.7075629605,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"","submitted":4423,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5122641509433963,"acs":3801,"articleLive":2,"columnArticles":69,"formTitle":"[1245]树的直径","frequency":0.6403107335,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"","submitted":7420,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.48100255427841637,"acs":3013,"articleLive":2,"columnArticles":43,"formTitle":"[1246]删除回文子数组","frequency":0.9598334118,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"","submitted":6264,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.6216163072687947,"acs":9484,"articleLive":2,"columnArticles":163,"formTitle":"[1247]交换字符使得字符串相同","frequency":0.0,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"ac","submitted":15257,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5624358797678656,"acs":36731,"articleLive":2,"columnArticles":495,"formTitle":"[1248]统计「优美子数组」","frequency":1.4470622855,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","submitted":65307,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5785968819599109,"acs":25979,"articleLive":2,"columnArticles":361,"formTitle":"[1249]移除无效的括号","frequency":1.055182292,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"ac","submitted":44900,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5663442940038684,"acs":2928,"articleLive":2,"columnArticles":41,"formTitle":"[1250]检查「好数组」","frequency":0.6403107335,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","submitted":5170,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7716703786191537,"acs":8662,"articleLive":2,"columnArticles":101,"formTitle":"[1251]平均售价","frequency":0.0,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"","submitted":11225,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.7488843324086358,"acs":18627,"articleLive":2,"columnArticles":329,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","submitted":24873,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.39470853947085394,"acs":5505,"articleLive":2,"columnArticles":85,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":0.0,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","submitted":13947,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.6052104208416834,"acs":16912,"articleLive":2,"columnArticles":264,"formTitle":"[1254]统计封闭岛屿的数目","frequency":0.4972098898,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"ac","submitted":27944,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6877837837837838,"acs":3181,"articleLive":2,"columnArticles":70,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","submitted":4625,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6659776767259198,"acs":1611,"articleLive":2,"columnArticles":40,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"","submitted":2419,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.5647713950762017,"acs":1927,"articleLive":2,"columnArticles":44,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"","submitted":3412,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.5532631578947368,"acs":1314,"articleLive":2,"columnArticles":47,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"","submitted":2375,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.4820846905537459,"acs":2072,"articleLive":2,"columnArticles":45,"formTitle":"[1259]不相交的握手","frequency":0.0,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"","submitted":4298,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6034599270171644,"acs":13395,"articleLive":2,"columnArticles":266,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","submitted":22197,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.7303537201603066,"acs":8383,"articleLive":2,"columnArticles":114,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","submitted":11478,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5285922384491839,"acs":14152,"articleLive":2,"columnArticles":206,"formTitle":"[1262]可被三整除的最大和","frequency":1.479109463,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","submitted":26773,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.4265340364333653,"acs":3559,"articleLive":2,"columnArticles":64,"formTitle":"[1263]推箱子","frequency":1.2899779203,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","questionId":"1389","status":"","submitted":8344,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.5671609943454604,"acs":5316,"articleLive":2,"columnArticles":91,"formTitle":"[1264]页面推荐","frequency":0.0,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"","submitted":9373,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.9127008184298272,"acs":3011,"articleLive":2,"columnArticles":76,"formTitle":"[1265]逆序打印不可变链表","frequency":0.7075629605,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"","submitted":3299,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.824550510231629,"acs":30543,"articleLive":2,"columnArticles":462,"formTitle":"[1266]访问所有点的最小时间","frequency":0.0,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","submitted":37042,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6087466798443387,"acs":9855,"articleLive":2,"columnArticles":154,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","submitted":16189,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.5876445325404691,"acs":8894,"articleLive":2,"columnArticles":152,"formTitle":"[1268]搜索推荐系统","frequency":1.0847265383,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"ac","submitted":15135,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.4909058660388919,"acs":30445,"articleLive":2,"columnArticles":324,"formTitle":"[1269]停在原地的方案数","frequency":0.0,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","questionId":"1398","status":"ac","submitted":62018,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.8036114570361146,"acs":6453,"articleLive":2,"columnArticles":88,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":0.0,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","questionId":"1405","status":"","submitted":8030,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.5068684053354569,"acs":2546,"articleLive":2,"columnArticles":46,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"","submitted":5023,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.5236064575083765,"acs":1719,"articleLive":2,"columnArticles":34,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"","submitted":3283,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.54177545691906,"acs":1660,"articleLive":2,"columnArticles":49,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"","submitted":3064,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.6084905660377359,"acs":1032,"articleLive":2,"columnArticles":25,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"","submitted":1696,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5454084542746689,"acs":8606,"articleLive":2,"columnArticles":176,"formTitle":"[1275]找出井字棋的获胜者","frequency":0.4720829397,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","questionId":"1400","status":"","submitted":15779,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5038771139502253,"acs":6823,"articleLive":2,"columnArticles":102,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","questionId":"1401","status":"","submitted":13541,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7281899532960177,"acs":20425,"articleLive":2,"columnArticles":250,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":1.6808881918,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","submitted":28049,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.6035376639219274,"acs":3958,"articleLive":2,"columnArticles":60,"formTitle":"[1278]分割回文串 III","frequency":1.5832497222,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","submitted":6558,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6250925240562546,"acs":1689,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":0.0,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1410","status":"","submitted":2702,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.5051476102815845,"acs":7409,"articleLive":2,"columnArticles":75,"formTitle":"[1280]学生们参加各科测试的次数","frequency":0.0,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"","submitted":14667,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.8314180360147496,"acs":46448,"articleLive":2,"columnArticles":631,"formTitle":"[1281]整数的各位积和之差","frequency":1.0847265383,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","questionId":"1406","status":"","submitted":55866,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8109775091894585,"acs":13017,"articleLive":2,"columnArticles":245,"formTitle":"[1282]用户分组","frequency":0.0,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","questionId":"1407","status":"","submitted":16051,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.4209005002779322,"acs":7572,"articleLive":2,"columnArticles":104,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":0.5792230415,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","submitted":17990,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6675583657587548,"acs":2745,"articleLive":2,"columnArticles":62,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":0.8226322903,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","questionId":"1409","status":"","submitted":4112,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8133086876155268,"acs":4840,"articleLive":2,"columnArticles":66,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","questionId":"1420","status":"","submitted":5951,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.6512546172462107,"acs":5113,"articleLive":2,"columnArticles":101,"formTitle":"[1286]字母组合迭代器","frequency":0.6403107335,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","submitted":7851,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6018545667790647,"acs":16421,"articleLive":2,"columnArticles":228,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":1.0847265383,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","questionId":"1221","status":"","submitted":27284,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.565085504114056,"acs":14903,"articleLive":2,"columnArticles":181,"formTitle":"[1288]删除被覆盖区间","frequency":1.479109463,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","submitted":26373,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.6226430766674973,"acs":7496,"articleLive":2,"columnArticles":110,"formTitle":"[1289]下降路径最小和 II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","submitted":12039,"title":"下降路径最小和 II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8076879206113836,"acs":56648,"articleLive":2,"columnArticles":734,"formTitle":"[1290]二进制链表转整数","frequency":0.4972098898,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","questionId":"1411","status":"ac","submitted":70136,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5205146036161336,"acs":7485,"articleLive":2,"columnArticles":167,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","submitted":14380,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.476204443792623,"acs":6494,"articleLive":2,"columnArticles":100,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":0.0,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","questionId":"1413","status":"","submitted":13637,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.36499573485874853,"acs":14548,"articleLive":2,"columnArticles":130,"formTitle":"[1293]网格中的最短路径","frequency":2.7142972866,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","questionId":"1414","status":"","submitted":39858,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6549471331556778,"acs":7619,"articleLive":2,"columnArticles":81,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"","submitted":11633,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.8081058996568067,"acs":49448,"articleLive":2,"columnArticles":657,"formTitle":"[1295]统计位数为偶数的数字","frequency":0.5233893954,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","submitted":61190,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.45496833492125766,"acs":8118,"articleLive":2,"columnArticles":130,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.0,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","questionId":"1422","status":"","submitted":17843,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.46196957566052843,"acs":6924,"articleLive":2,"columnArticles":96,"formTitle":"[1297]子串的最大出现次数","frequency":1.0847265383,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","submitted":14988,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5906746884400516,"acs":2749,"articleLive":2,"columnArticles":96,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","submitted":4654,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.787656171914043,"acs":31522,"articleLive":2,"columnArticles":449,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","questionId":"1231","status":"","submitted":40020,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.46493170219153407,"acs":24779,"articleLive":2,"columnArticles":375,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":0.5506985748,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","submitted":53296,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.3611359348624764,"acs":3637,"articleLive":2,"columnArticles":87,"formTitle":"[1301]最大得分的路径数目","frequency":0.5233893954,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","submitted":10071,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8209036472509527,"acs":21112,"articleLive":2,"columnArticles":313,"formTitle":"[1302]层数最深叶子节点的和","frequency":1.055182292,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","submitted":25718,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8229768163406016,"acs":9549,"articleLive":2,"columnArticles":89,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"","submitted":11603,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.72319713495035,"acs":22213,"articleLive":2,"columnArticles":400,"formTitle":"[1304]和为零的N个唯一整数","frequency":0.0,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","questionId":"1426","status":"","submitted":30715,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7483669412098836,"acs":15810,"articleLive":2,"columnArticles":238,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":0.5506985748,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","submitted":21126,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5763091656946405,"acs":18775,"articleLive":2,"columnArticles":289,"formTitle":"[1306]跳跃游戏 III","frequency":1.055182292,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","submitted":32578,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.3299704296399374,"acs":1897,"articleLive":2,"columnArticles":58,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","submitted":5749,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7525450274079875,"acs":5766,"articleLive":2,"columnArticles":63,"formTitle":"[1308]不同性别每日分数总计","frequency":0.0,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"","submitted":7662,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7543913309446824,"acs":17265,"articleLive":2,"columnArticles":300,"formTitle":"[1309]解码字母到整数映射","frequency":0.5233893954,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","submitted":22886,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.7143751897965381,"acs":37639,"articleLive":2,"columnArticles":506,"formTitle":"[1310]子数组异或查询","frequency":0.0,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"ac","submitted":52688,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.3831519968727604,"acs":5881,"articleLive":2,"columnArticles":90,"formTitle":"[1311]获取你好友已观看的视频","frequency":0.0,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","submitted":15349,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6692056583242655,"acs":11685,"articleLive":2,"columnArticles":156,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":0.5506985748,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","questionId":"1437","status":"","submitted":17461,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8328277331357247,"acs":35964,"articleLive":2,"columnArticles":552,"formTitle":"[1313]解压缩编码列表","frequency":0.0,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","submitted":43183,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7484904032779814,"acs":13883,"articleLive":2,"columnArticles":223,"formTitle":"[1314]矩阵区域和","frequency":1.5124236696,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","submitted":18548,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.8113093802748975,"acs":13458,"articleLive":2,"columnArticles":280,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","submitted":16588,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.4428550141558635,"acs":2972,"articleLive":2,"columnArticles":64,"formTitle":"[1316]不同的循环子字符串","frequency":0.7438514124,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","submitted":6711,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6167423676191571,"acs":10727,"articleLive":2,"columnArticles":203,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","questionId":"1440","status":"ac","submitted":17393,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6571708272148801,"acs":6713,"articleLive":2,"columnArticles":123,"formTitle":"[1318]或运算的最小翻转次数","frequency":1.180738826,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","questionId":"1441","status":"","submitted":10215,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6182009167303285,"acs":32369,"articleLive":2,"columnArticles":522,"formTitle":"[1319]连通网络的操作次数","frequency":0.0,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","submitted":52360,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5932318873495344,"acs":2612,"articleLive":2,"columnArticles":62,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","questionId":"1443","status":"","submitted":4403,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.6182027061526678,"acs":4843,"articleLive":2,"columnArticles":89,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.60905819,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"","submitted":7834,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5951313913220615,"acs":5843,"articleLive":2,"columnArticles":68,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"","submitted":9818,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.7539065910082933,"acs":25908,"articleLive":2,"columnArticles":503,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":0.4720829397,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","submitted":34365,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5901716657234484,"acs":6257,"articleLive":2,"columnArticles":126,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","submitted":10602,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.7292006525285482,"acs":11175,"articleLive":2,"columnArticles":195,"formTitle":"[1325]删除给定值的叶子节点","frequency":0.0,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","submitted":15325,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.47349686605277413,"acs":6119,"articleLive":2,"columnArticles":97,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":0.0,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","questionId":"1451","status":"","submitted":12923,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6898777957113212,"acs":5984,"articleLive":2,"columnArticles":57,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","questionId":"1462","status":"","submitted":8674,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.4662950575994054,"acs":6274,"articleLive":2,"columnArticles":125,"formTitle":"[1328]破坏回文串","frequency":0.5506985748,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","submitted":13455,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.77109440267335,"acs":7384,"articleLive":2,"columnArticles":168,"formTitle":"[1329]将矩阵按对角线排序","frequency":1.055182292,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","submitted":9576,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.3848069738480697,"acs":1236,"articleLive":2,"columnArticles":32,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":1.055182292,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","submitted":3212,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5325493139830685,"acs":12770,"articleLive":2,"columnArticles":220,"formTitle":"[1331]数组序号转换","frequency":1.479109463,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","submitted":23979,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6914180125923898,"acs":10103,"articleLive":2,"columnArticles":141,"formTitle":"[1332]删除回文子序列","frequency":0.4972098898,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"ac","submitted":14612,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5490839485917418,"acs":6024,"articleLive":2,"columnArticles":126,"formTitle":"[1333]餐厅过滤器","frequency":1.180738826,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","questionId":"1455","status":"","submitted":10971,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.49815852682145717,"acs":6222,"articleLive":2,"columnArticles":97,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":1.5832497222,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","questionId":"1456","status":"","submitted":12490,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5899640456463967,"acs":3774,"articleLive":2,"columnArticles":61,"formTitle":"[1335]工作计划的最低难度","frequency":0.60905819,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","submitted":6397,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.43299415457891316,"acs":2000,"articleLive":2,"columnArticles":50,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"","submitted":4619,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.7044704312403427,"acs":40121,"articleLive":2,"columnArticles":645,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":2.2426782668,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"ac","submitted":56952,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6400854872103119,"acs":9584,"articleLive":2,"columnArticles":143,"formTitle":"[1338]数组大小减半","frequency":0.0,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"ac","submitted":14973,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.40197983998553544,"acs":8893,"articleLive":2,"columnArticles":142,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":0.5233893954,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","submitted":22123,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5744733581164808,"acs":4636,"articleLive":2,"columnArticles":100,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","submitted":8070,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.43905368079740603,"acs":3656,"articleLive":2,"columnArticles":52,"formTitle":"[1341]电影评分","frequency":0.5506985748,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"","submitted":8327,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.8190274921221956,"acs":43406,"articleLive":2,"columnArticles":651,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.5233893954,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","questionId":"1444","status":"","submitted":52997,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.5483698116318371,"acs":13304,"articleLive":2,"columnArticles":226,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","questionId":"1445","status":"","submitted":24261,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.596529284164859,"acs":6600,"articleLive":2,"columnArticles":124,"formTitle":"[1344]时钟指针的夹角","frequency":1.0847265383,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","submitted":11064,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.36370570288664633,"acs":6199,"articleLive":2,"columnArticles":115,"formTitle":"[1345]跳跃游戏 IV","frequency":0.6403107335,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","submitted":17044,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.433148238184191,"acs":16927,"articleLive":2,"columnArticles":290,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","submitted":39079,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.744019992859693,"acs":8336,"articleLive":2,"columnArticles":128,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","questionId":"1469","status":"ac","submitted":11204,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.31063903882987987,"acs":3568,"articleLive":2,"columnArticles":58,"formTitle":"[1348]推文计数","frequency":1.4161956376,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","submitted":11486,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5056028686687584,"acs":3384,"articleLive":2,"columnArticles":99,"formTitle":"[1349]参加考试的最大学生数","frequency":0.0,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","submitted":6693,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.8461465899443449,"acs":8970,"articleLive":2,"columnArticles":89,"formTitle":"[1350]院系无效的学生","frequency":0.0,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"","submitted":10601,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7534213453261763,"acs":31160,"articleLive":2,"columnArticles":567,"formTitle":"[1351]统计有序矩阵中的负数","frequency":0.5233893954,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","submitted":41358,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.4494417262576841,"acs":7165,"articleLive":2,"columnArticles":80,"formTitle":"[1352]最后 K 个数的乘积","frequency":0.0,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","submitted":15942,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.286434144529073,"acs":12335,"articleLive":2,"columnArticles":161,"formTitle":"[1353]最多可以参加的会议数目","frequency":1.9551921383,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","questionId":"1478","status":"","submitted":43064,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.2816835832014154,"acs":3025,"articleLive":2,"columnArticles":75,"formTitle":"[1354]多次求和构造目标数组","frequency":0.7821409289,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","submitted":10739,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6633941093969145,"acs":4257,"articleLive":2,"columnArticles":63,"formTitle":"[1355]活动参与者","frequency":0.60905819,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"","submitted":6417,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.7306918650886467,"acs":46860,"articleLive":2,"columnArticles":525,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":1.0847265383,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","questionId":"1458","status":"","submitted":64131,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5327705475436745,"acs":4544,"articleLive":2,"columnArticles":45,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.4972098898,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","submitted":8529,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.49570533157935465,"acs":6406,"articleLive":2,"columnArticles":121,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":0.0,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","submitted":12923,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5549430356486585,"acs":3020,"articleLive":2,"columnArticles":73,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","submitted":5442,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.5057477556382746,"acs":9239,"articleLive":2,"columnArticles":150,"formTitle":"[1360]日期之间隔几天","frequency":1.4161956376,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","submitted":18268,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.39983169150042075,"acs":8077,"articleLive":2,"columnArticles":214,"formTitle":"[1361]验证二叉树","frequency":0.5233893954,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","submitted":20201,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5306908890723919,"acs":5784,"articleLive":2,"columnArticles":74,"formTitle":"[1362]最接近的因数","frequency":0.60905819,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","submitted":10899,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.36804888095565014,"acs":5361,"articleLive":2,"columnArticles":102,"formTitle":"[1363]形成三的最大倍数","frequency":0.6403107335,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","submitted":14566,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.683995015132633,"acs":3842,"articleLive":2,"columnArticles":71,"formTitle":"[1364]顾客的可信联系人数量","frequency":0.0,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","questionId":"1495","status":"","submitted":5617,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.82468959558202,"acs":87808,"articleLive":2,"columnArticles":1113,"formTitle":"[1365]有多少小于当前数字的数字","frequency":0.5506985748,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","questionId":"1482","status":"","submitted":106474,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5408809610484164,"acs":7429,"articleLive":2,"columnArticles":144,"formTitle":"[1366]通过投票对团队排名","frequency":0.5233893954,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","submitted":13735,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.41911648698396003,"acs":15939,"articleLive":2,"columnArticles":233,"formTitle":"[1367]二叉树中的列表","frequency":0.0,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"ac","submitted":38030,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5368981039421634,"acs":3936,"articleLive":2,"columnArticles":96,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.0,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","questionId":"1485","status":"","submitted":7331,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.6052895211380485,"acs":3021,"articleLive":2,"columnArticles":44,"formTitle":"[1369]获取最近第二次的活动","frequency":0.5792230415,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"","submitted":4991,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7903183969911161,"acs":48750,"articleLive":2,"columnArticles":583,"formTitle":"[1370]上升下降字符串","frequency":0.5506985748,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","submitted":61684,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5811222852252059,"acs":21727,"articleLive":2,"columnArticles":280,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":1.1154414835,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","questionId":"1473","status":"","submitted":37388,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5183348095659877,"acs":8778,"articleLive":2,"columnArticles":172,"formTitle":"[1372]二叉树中的最长交错路径","frequency":0.0,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","submitted":16935,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.40503523779974293,"acs":9138,"articleLive":2,"columnArticles":191,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":1.4470622855,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","submitted":22561,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7406907033690788,"acs":17544,"articleLive":2,"columnArticles":233,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","questionId":"1490","status":"","submitted":23686,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.5790829469345699,"acs":8992,"articleLive":2,"columnArticles":177,"formTitle":"[1375]二进制字符串前缀一致的次数","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","submitted":15528,"title":"二进制字符串前缀一致的次数","titleSlug":"number-of-times-binary-string-is-prefix-aligned"},{"acceptance":0.5074187771808647,"acs":7934,"articleLive":2,"columnArticles":162,"formTitle":"[1376]通知所有员工所需的时间","frequency":0.0,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","submitted":15636,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.32784838022478513,"acs":4463,"articleLive":2,"columnArticles":136,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.5792230415,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","submitted":13613,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.8644277209929238,"acs":7696,"articleLive":2,"columnArticles":64,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","questionId":"1509","status":"","submitted":8903,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8387568274482653,"acs":10903,"articleLive":2,"columnArticles":171,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","questionId":"1498","status":"","submitted":12999,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.7274128379222726,"acs":17463,"articleLive":2,"columnArticles":268,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","submitted":24007,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.731000171556013,"acs":12783,"articleLive":2,"columnArticles":176,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.5792230415,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"ac","submitted":17487,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.7026104760279815,"acs":12354,"articleLive":2,"columnArticles":189,"formTitle":"[1382]将二叉搜索树变平衡","frequency":0.0,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","submitted":17583,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.3262050471016984,"acs":4744,"articleLive":2,"columnArticles":92,"formTitle":"[1383]最大的团队表现值","frequency":1.2899779203,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","submitted":14543,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5484932894403647,"acs":2166,"articleLive":2,"columnArticles":49,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"","submitted":3949,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.6989902838635931,"acs":14676,"articleLive":2,"columnArticles":222,"formTitle":"[1385]两个数组间的距离值","frequency":0.0,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","submitted":20996,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.31745879647374475,"acs":6626,"articleLive":2,"columnArticles":134,"formTitle":"[1386]安排电影院座位","frequency":1.1474135162,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","submitted":20872,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6943620178041543,"acs":10296,"articleLive":2,"columnArticles":189,"formTitle":"[1387]将整数按权重排序","frequency":0.0,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","submitted":14828,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5481366459627329,"acs":4589,"articleLive":2,"columnArticles":56,"formTitle":"[1388]3n 块披萨","frequency":0.60905819,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","submitted":8372,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8307130424858048,"acs":29114,"articleLive":2,"columnArticles":495,"formTitle":"[1389]按既定顺序创建目标数组","frequency":0.5233893954,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","submitted":35047,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.363996869292982,"acs":6976,"articleLive":2,"columnArticles":124,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","submitted":19165,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.4017217471689392,"acs":6953,"articleLive":2,"columnArticles":210,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":0.5792230415,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","questionId":"1507","status":"","submitted":17308,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.41159434051846927,"acs":8669,"articleLive":2,"columnArticles":157,"formTitle":"[1392]最长快乐前缀","frequency":1.180738826,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","submitted":21062,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.856702025072324,"acs":4442,"articleLive":2,"columnArticles":66,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"","submitted":5185,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.6655557590184947,"acs":18173,"articleLive":2,"columnArticles":296,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","submitted":27305,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7390895130529549,"acs":14920,"articleLive":2,"columnArticles":214,"formTitle":"[1395]统计作战单位数","frequency":0.4972098898,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","submitted":20187,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.4064924729756615,"acs":12259,"articleLive":2,"columnArticles":167,"formTitle":"[1396]设计地铁系统","frequency":0.4972098898,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","submitted":30158,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.38289703315881324,"acs":1097,"articleLive":2,"columnArticles":38,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","submitted":2865,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7591888466413181,"acs":4792,"articleLive":2,"columnArticles":76,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","questionId":"1536","status":"","submitted":6312,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6710067114093959,"acs":9998,"articleLive":2,"columnArticles":161,"formTitle":"[1399]统计最大组的数目","frequency":0.5233893954,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","submitted":14900,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.6086055462350736,"acs":6167,"articleLive":2,"columnArticles":104,"formTitle":"[1400]构造 K 个回文字符串","frequency":0.0,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"ac","submitted":10133,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.4191755910284906,"acs":4149,"articleLive":2,"columnArticles":96,"formTitle":"[1401]圆和矩形是否有重叠","frequency":0.0,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","submitted":9898,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7539224393132031,"acs":10187,"articleLive":2,"columnArticles":186,"formTitle":"[1402]做菜顺序","frequency":0.0,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","submitted":13512,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6894735211180316,"acs":22250,"articleLive":2,"columnArticles":375,"formTitle":"[1403]非递增顺序的最小子序列","frequency":1.1154414835,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","submitted":32271,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.493713163064833,"acs":7539,"articleLive":2,"columnArticles":160,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":0.0,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","questionId":"1520","status":"","submitted":15270,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5095519864750634,"acs":6028,"articleLive":2,"columnArticles":145,"formTitle":"[1405]最长快乐字符串","frequency":1.5124236696,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","submitted":11830,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.568781025923883,"acs":5156,"articleLive":2,"columnArticles":85,"formTitle":"[1406]石子游戏 III","frequency":0.0,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","submitted":9065,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6698711176843439,"acs":6341,"articleLive":2,"columnArticles":71,"formTitle":"[1407]排名靠前的旅行者","frequency":0.0,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"","submitted":9466,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.6145715528490648,"acs":14129,"articleLive":2,"columnArticles":214,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","submitted":22990,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.8075860097207662,"acs":8474,"articleLive":2,"columnArticles":140,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","submitted":10493,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.4756317129198485,"acs":7661,"articleLive":2,"columnArticles":121,"formTitle":"[1410]HTML 实体解析器","frequency":0.7075629605,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"ac","submitted":16107,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5512248679064022,"acs":8033,"articleLive":2,"columnArticles":146,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":1.2899779203,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","questionId":"1527","status":"","submitted":14573,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5504358655043586,"acs":3094,"articleLive":2,"columnArticles":73,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","questionId":"1546","status":"","submitted":5621,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.6951909476661952,"acs":11796,"articleLive":2,"columnArticles":246,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":0.4972098898,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","questionId":"1514","status":"","submitted":16968,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.6050945460228161,"acs":7744,"articleLive":2,"columnArticles":154,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":1.4470622855,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","questionId":"1515","status":"","submitted":12798,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.6865420745575003,"acs":6943,"articleLive":2,"columnArticles":187,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":0.5792230415,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","questionId":"1516","status":"","submitted":10113,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.411493288590604,"acs":2943,"articleLive":2,"columnArticles":55,"formTitle":"[1416]恢复数组","frequency":0.0,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","submitted":7152,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.5210771937877745,"acs":13622,"articleLive":2,"columnArticles":190,"formTitle":"[1417]重新格式化字符串","frequency":0.5233893954,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","submitted":26142,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.731518370960602,"acs":26440,"articleLive":2,"columnArticles":420,"formTitle":"[1418]点菜展示表","frequency":2.6568607087,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","questionId":"1533","status":"ac","submitted":36144,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.42122465655482355,"acs":8248,"articleLive":2,"columnArticles":159,"formTitle":"[1419]数青蛙","frequency":1.1154414835,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","submitted":19581,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.6031220435193945,"acs":2550,"articleLive":2,"columnArticles":47,"formTitle":"[1420]生成数组","frequency":0.865557335,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","questionId":"1535","status":"","submitted":4228,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.7414027149321267,"acs":3277,"articleLive":2,"columnArticles":41,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":1,"nodeType":"def","questionId":"1551","status":"","submitted":4420,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.5412320888975534,"acs":11105,"articleLive":2,"columnArticles":203,"formTitle":"[1422]分割字符串的最大得分","frequency":1.0847265383,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","submitted":20518,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.554209726443769,"acs":36467,"articleLive":2,"columnArticles":533,"formTitle":"[1423]可获得的最大点数","frequency":0.0,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"ac","submitted":65800,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.40180574248541945,"acs":7165,"articleLive":2,"columnArticles":157,"formTitle":"[1424]对角线遍历 II","frequency":1.055182292,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","submitted":17832,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.4443584784010316,"acs":3446,"articleLive":2,"columnArticles":76,"formTitle":"[1425]带限制的子序列和","frequency":0.5792230415,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","submitted":7755,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.6996957844415471,"acs":1610,"articleLive":2,"columnArticles":55,"formTitle":"[1426]数元素","frequency":1.4629331154,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"","submitted":2301,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6440758293838863,"acs":1359,"articleLive":2,"columnArticles":52,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"","submitted":2110,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5961058412381428,"acs":1194,"articleLive":2,"columnArticles":23,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","questionId":"1374","status":"","submitted":2003,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.5005615874204418,"acs":1337,"articleLive":2,"columnArticles":51,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"","submitted":2671,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.5720369056068133,"acs":806,"articleLive":2,"columnArticles":31,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","questionId":"1432","status":"","submitted":1409,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.8459420826936312,"acs":79895,"articleLive":2,"columnArticles":1050,"formTitle":"[1431]拥有最多糖果的孩子","frequency":0.0,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","submitted":94445,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.3968280467445743,"acs":4754,"articleLive":2,"columnArticles":103,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","questionId":"1529","status":"","submitted":11980,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6407905460472698,"acs":6290,"articleLive":2,"columnArticles":113,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","questionId":"1530","status":"","submitted":9816,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.46893858714944975,"acs":2642,"articleLive":2,"columnArticles":46,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","questionId":"1531","status":"","submitted":5634,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6219713656387665,"acs":4518,"articleLive":2,"columnArticles":51,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"","submitted":7264,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.8224899455457878,"acs":46219,"articleLive":2,"columnArticles":658,"formTitle":"[1436]旅行终点站","frequency":1.055182292,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"ac","submitted":56194,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5830218068535825,"acs":11229,"articleLive":2,"columnArticles":191,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":0.0,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","questionId":"1548","status":"","submitted":19260,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.48239416718476236,"acs":34140,"articleLive":2,"columnArticles":481,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":1.4470622855,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","questionId":"1549","status":"","submitted":70772,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.542306882761524,"acs":5153,"articleLive":2,"columnArticles":71,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":1.1474135162,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","questionId":"1550","status":"","submitted":9502,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.6998567335243553,"acs":2931,"articleLive":2,"columnArticles":42,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"","submitted":4188,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.6489878265627137,"acs":18979,"articleLive":2,"columnArticles":383,"formTitle":"[1441]用栈操作构建数组","frequency":0.0,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"ac","submitted":29244,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7914959708278936,"acs":35163,"articleLive":2,"columnArticles":378,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":0.0,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","questionId":"1553","status":"ac","submitted":44426,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.4119334079462787,"acs":5889,"articleLive":2,"columnArticles":146,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","questionId":"1554","status":"","submitted":14296,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5292319449751623,"acs":2770,"articleLive":2,"columnArticles":64,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","submitted":5234,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8562524347487339,"acs":4396,"articleLive":2,"columnArticles":56,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"","submitted":5134,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.6108945636467402,"acs":50309,"articleLive":2,"columnArticles":684,"formTitle":"[1446]连续字符","frequency":0.6213827236,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","submitted":82353,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.6128039988464866,"acs":6375,"articleLive":2,"columnArticles":84,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","submitted":10403,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7136524253132027,"acs":11108,"articleLive":2,"columnArticles":181,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":1.0847265383,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","submitted":15565,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6274685816876122,"acs":16776,"articleLive":2,"columnArticles":207,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":0.0,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","questionId":"1545","status":"ac","submitted":26736,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.8027636974138767,"acs":24864,"articleLive":2,"columnArticles":352,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":0.0,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","questionId":"1560","status":"ac","submitted":30973,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.5255949155047543,"acs":10668,"articleLive":2,"columnArticles":162,"formTitle":"[1451]重新排列句子中的单词","frequency":0.5233893954,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","submitted":20297,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.5010189940490748,"acs":6146,"articleLive":2,"columnArticles":92,"formTitle":"[1452]收藏清单","frequency":0.0,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","questionId":"1562","status":"","submitted":12267,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.36754684838160134,"acs":1726,"articleLive":2,"columnArticles":36,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":0.865557335,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","questionId":"1563","status":"","submitted":4696,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.3944940905159989,"acs":5474,"articleLive":2,"columnArticles":87,"formTitle":"[1454]活跃用户","frequency":0.5792230415,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"","submitted":13876,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6278044673369323,"acs":12676,"articleLive":2,"columnArticles":224,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","questionId":"1566","status":"","submitted":20191,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.5250200229829021,"acs":15077,"articleLive":2,"columnArticles":226,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.4972098898,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","questionId":"1567","status":"","submitted":28717,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.629565868263473,"acs":8411,"articleLive":2,"columnArticles":147,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","submitted":13360,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.4434409918873412,"acs":5794,"articleLive":2,"columnArticles":92,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","submitted":13066,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.5993424142790043,"acs":2552,"articleLive":2,"columnArticles":51,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"","submitted":4258,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7421903711870635,"acs":16156,"articleLive":2,"columnArticles":329,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","questionId":"1556","status":"ac","submitted":21768,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.5068713332797556,"acs":6307,"articleLive":2,"columnArticles":91,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","questionId":"1557","status":"","submitted":12443,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.4363439175754654,"acs":7242,"articleLive":2,"columnArticles":141,"formTitle":"[1462]课程表 IV","frequency":0.0,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","submitted":16597,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.5947546531302876,"acs":2812,"articleLive":2,"columnArticles":68,"formTitle":"[1463]摘樱桃 II","frequency":0.0,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","submitted":4728,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7672110587016386,"acs":28139,"articleLive":2,"columnArticles":400,"formTitle":"[1464]数组中两元素的最大乘积","frequency":1.0847265383,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","questionId":"1574","status":"","submitted":36677,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.3130666417422189,"acs":6699,"articleLive":2,"columnArticles":85,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.4972098898,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","questionId":"1575","status":"","submitted":21398,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.4840261325292555,"acs":6742,"articleLive":2,"columnArticles":127,"formTitle":"[1466]重新规划路线","frequency":0.5506985748,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","questionId":"1576","status":"","submitted":13929,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6172927002126152,"acs":1742,"articleLive":2,"columnArticles":50,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","questionId":"1577","status":"","submitted":2822,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.7007034747388616,"acs":3287,"articleLive":2,"columnArticles":56,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"","submitted":4691,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.7989047763918466,"acs":2626,"articleLive":2,"columnArticles":98,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"","submitted":3287,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8422724923226611,"acs":55403,"articleLive":2,"columnArticles":748,"formTitle":"[1470]重新排列数组","frequency":0.5233893954,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","submitted":65778,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.5467436226307539,"acs":7673,"articleLive":2,"columnArticles":110,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.6731005563,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","submitted":14034,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6202556668423828,"acs":9413,"articleLive":2,"columnArticles":151,"formTitle":"[1472]设计浏览器历史记录","frequency":1.3864315356,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","submitted":15176,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.6734492380339129,"acs":15688,"articleLive":2,"columnArticles":168,"formTitle":"[1473]粉刷房子 III","frequency":0.0,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","submitted":23295,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7151064548834065,"acs":2116,"articleLive":2,"columnArticles":72,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","questionId":"1618","status":"","submitted":2959,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7208475971746761,"acs":16635,"articleLive":2,"columnArticles":256,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","questionId":"1570","status":"","submitted":23077,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8643742132114225,"acs":13046,"articleLive":2,"columnArticles":123,"formTitle":"[1476]子矩形查询","frequency":0.0,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","submitted":15093,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.28997741692655127,"acs":5393,"articleLive":2,"columnArticles":105,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":1.0847265383,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","questionId":"1573","status":"","submitted":18598,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5850655903128154,"acs":2899,"articleLive":2,"columnArticles":62,"formTitle":"[1478]安排邮筒","frequency":0.6403107335,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","submitted":4955,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5677285677285677,"acs":2192,"articleLive":2,"columnArticles":44,"formTitle":"[1479]周内每天的销售情况","frequency":0.5792230415,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"","submitted":3861,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8690339095700927,"acs":132061,"articleLive":2,"columnArticles":1345,"formTitle":"[1480]一维数组的动态和","frequency":1.9219929666,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"ac","submitted":151963,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5158259864142217,"acs":10707,"articleLive":2,"columnArticles":153,"formTitle":"[1481]不同整数的最少数目","frequency":1.4470622855,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","questionId":"1604","status":"","submitted":20757,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5875590001652923,"acs":31992,"articleLive":2,"columnArticles":418,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":0.0,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","questionId":"1605","status":"ac","submitted":54449,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.3021331058020478,"acs":3541,"articleLive":2,"columnArticles":76,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","submitted":11720,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8123300090661831,"acs":896,"articleLive":2,"columnArticles":27,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"","submitted":1103,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.6566766044249176,"acs":4185,"articleLive":2,"columnArticles":48,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"","submitted":6373,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.8586886650953504,"acs":72135,"articleLive":2,"columnArticles":704,"formTitle":"[1486]数组异或操作","frequency":0.4479388408,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"ac","submitted":84006,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.31332710571384087,"acs":8050,"articleLive":2,"columnArticles":108,"formTitle":"[1487]保证文件名唯一","frequency":1.180738826,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","submitted":25692,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.24369594347667195,"acs":8002,"articleLive":2,"columnArticles":120,"formTitle":"[1488]避免洪水泛滥","frequency":3.2157615477,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","submitted":32836,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6892311295895064,"acs":11770,"articleLive":2,"columnArticles":129,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.6403107335,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","questionId":"1613","status":"","submitted":17077,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8527851458885941,"acs":1286,"articleLive":2,"columnArticles":32,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"","submitted":1508,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.6716191337489099,"acs":20794,"articleLive":2,"columnArticles":309,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","questionId":"1584","status":"","submitted":30961,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.652027027027027,"acs":7720,"articleLive":2,"columnArticles":89,"formTitle":"[1492]n 的第 k 个因子","frequency":1.4161956376,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","submitted":11840,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.5742827197694222,"acs":8767,"articleLive":2,"columnArticles":166,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":1.055182292,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","questionId":"1586","status":"","submitted":15266,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.37513513513513513,"acs":2429,"articleLive":2,"columnArticles":39,"formTitle":"[1494]并行课程 II","frequency":1.3719406285,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","submitted":6475,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.541702921068987,"acs":4358,"articleLive":2,"columnArticles":42,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"","submitted":8045,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5355513570803189,"acs":11622,"articleLive":2,"columnArticles":176,"formTitle":"[1496]判断路径是否相交","frequency":0.0,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","submitted":21701,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.3944429672959319,"acs":8901,"articleLive":2,"columnArticles":119,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":1.0847265383,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","questionId":"1620","status":"","submitted":22566,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.33539206781713593,"acs":5539,"articleLive":2,"columnArticles":74,"formTitle":"[1498]满足条件的子序列数目","frequency":0.0,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","questionId":"1621","status":"","submitted":16515,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.3766844647851513,"acs":2963,"articleLive":2,"columnArticles":65,"formTitle":"[1499]满足不等式的最大值","frequency":0.60905819,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","submitted":7866,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.3025776215582894,"acs":1033,"articleLive":2,"columnArticles":32,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"","submitted":3414,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.5953872816957739,"acs":4466,"articleLive":2,"columnArticles":65,"formTitle":"[1501]可以放心投资的国家","frequency":0.5506985748,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"","submitted":7501,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7164356542649483,"acs":26516,"articleLive":2,"columnArticles":313,"formTitle":"[1502]判断能否形成等差数列","frequency":1.7124614537,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","submitted":37011,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.515790084755602,"acs":8885,"articleLive":2,"columnArticles":91,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":0.5233893954,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","questionId":"1627","status":"","submitted":17226,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.5995438996579248,"acs":7887,"articleLive":2,"columnArticles":138,"formTitle":"[1504]统计全 1 子矩形","frequency":1.0847265383,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","submitted":13155,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.3634047972829548,"acs":3424,"articleLive":2,"columnArticles":74,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":0.0,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","questionId":"1629","status":"","submitted":9422,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.8370273794002607,"acs":642,"articleLive":2,"columnArticles":18,"formTitle":"[1506]找到 N 叉树的根节点","frequency":0.0,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"","submitted":767,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5871426173557881,"acs":10494,"articleLive":2,"columnArticles":135,"formTitle":"[1507]转变日期格式","frequency":0.5233893954,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","submitted":17873,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.5535575343650039,"acs":6403,"articleLive":2,"columnArticles":58,"formTitle":"[1508]子数组和排序后的区间和","frequency":0.0,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","submitted":11567,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5517545579298176,"acs":5629,"articleLive":2,"columnArticles":83,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.5792230415,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","questionId":"1616","status":"","submitted":10202,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.5799978538469793,"acs":5405,"articleLive":2,"columnArticles":67,"formTitle":"[1510]石子游戏 IV","frequency":1.1154414835,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","submitted":9319,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6810723703486669,"acs":4649,"articleLive":2,"columnArticles":65,"formTitle":"[1511]消费者下单频率","frequency":0.5506985748,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"","submitted":6826,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.8482492448819778,"acs":60660,"articleLive":2,"columnArticles":776,"formTitle":"[1512]好数对的数目","frequency":1.479109463,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","submitted":71512,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.38262606090863704,"acs":11496,"articleLive":2,"columnArticles":162,"formTitle":"[1513]仅含 1 的子串数","frequency":0.0,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","submitted":30045,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.33742858209791254,"acs":9036,"articleLive":2,"columnArticles":158,"formTitle":"[1514]概率最大的路径","frequency":1.0847265383,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","submitted":26779,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.34401401195137027,"acs":3339,"articleLive":2,"columnArticles":61,"formTitle":"[1515]服务中心的最佳位置","frequency":0.0,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","submitted":9706,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5848623853211009,"acs":255,"articleLive":2,"columnArticles":14,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","questionId":"1655","status":"","submitted":436,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.6613728604199753,"acs":3748,"articleLive":2,"columnArticles":38,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"","submitted":5667,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.7029349168396437,"acs":53506,"articleLive":2,"columnArticles":802,"formTitle":"[1518]换酒问题","frequency":0.2356309992,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","submitted":76118,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.30124223602484473,"acs":5723,"articleLive":2,"columnArticles":125,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.5506985748,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","questionId":"1643","status":"","submitted":18998,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.3357363542739444,"acs":2608,"articleLive":2,"columnArticles":73,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","submitted":7768,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.3936806148590948,"acs":2766,"articleLive":2,"columnArticles":54,"formTitle":"[1521]找到最接近目标值的函数值","frequency":0.0,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","questionId":"1645","status":"","submitted":7026,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.7089605734767025,"acs":989,"articleLive":2,"columnArticles":32,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"","submitted":1395,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5748927038626609,"acs":10716,"articleLive":2,"columnArticles":181,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","submitted":18640,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.43441664718260464,"acs":5574,"articleLive":2,"columnArticles":110,"formTitle":"[1524]和为奇数的子数组数目","frequency":0.4972098898,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","submitted":12831,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.65788876276958,"acs":5796,"articleLive":2,"columnArticles":115,"formTitle":"[1525]字符串的好分割数目","frequency":0.0,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","questionId":"1632","status":"","submitted":8810,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.6209944751381216,"acs":3372,"articleLive":2,"columnArticles":54,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","questionId":"1633","status":"","submitted":5430,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.49223119950279676,"acs":3960,"articleLive":2,"columnArticles":42,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"","submitted":8045,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.7852553604273225,"acs":31166,"articleLive":2,"columnArticles":382,"formTitle":"[1528]重新排列字符串","frequency":1.4470622855,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","submitted":39689,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.6933972869669489,"acs":9252,"articleLive":2,"columnArticles":138,"formTitle":"[1529]最少的后缀翻转次数","frequency":0.5792230415,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","submitted":13343,"title":"最少的后缀翻转次数","titleSlug":"minimum-suffix-flips"},{"acceptance":0.5708718335533346,"acs":9082,"articleLive":2,"columnArticles":151,"formTitle":"[1530]好叶子节点对的数量","frequency":1.180738826,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","submitted":15909,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.3436414751116256,"acs":2078,"articleLive":2,"columnArticles":36,"formTitle":"[1531]压缩字符串 II","frequency":2.3385286839,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","submitted":6047,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6175598180739569,"acs":3123,"articleLive":2,"columnArticles":52,"formTitle":"[1532]最近的三笔订单","frequency":1.5832497222,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"","submitted":5057,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6048109965635738,"acs":352,"articleLive":2,"columnArticles":19,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","questionId":"1672","status":"","submitted":582,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.7862047983310153,"acs":18089,"articleLive":2,"columnArticles":167,"formTitle":"[1534]统计好三元组","frequency":1.1154414835,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","submitted":23008,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.45450301757193823,"acs":13631,"articleLive":2,"columnArticles":185,"formTitle":"[1535]找出数组游戏的赢家","frequency":0.5233893954,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","submitted":29991,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.4439555834904672,"acs":4238,"articleLive":2,"columnArticles":82,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.8226322903,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","submitted":9546,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.36879041160700204,"acs":4677,"articleLive":2,"columnArticles":96,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","submitted":12682,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.6051502145922747,"acs":141,"articleLive":2,"columnArticles":7,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","questionId":"1681","status":"","submitted":233,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5395404356908385,"acs":18080,"articleLive":2,"columnArticles":265,"formTitle":"[1539]第 k 个缺失的正整数","frequency":1.1154414835,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","submitted":33510,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.3190091001011122,"acs":5048,"articleLive":2,"columnArticles":90,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","submitted":15824,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.4660404135973508,"acs":6896,"articleLive":2,"columnArticles":104,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"ac","submitted":14797,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.38812114084092914,"acs":2640,"articleLive":2,"columnArticles":51,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","submitted":6802,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5545150501672241,"acs":3316,"articleLive":2,"columnArticles":46,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"","submitted":5980,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.5504009612621791,"acs":21071,"articleLive":2,"columnArticles":335,"formTitle":"[1544]整理字符串","frequency":1.479109463,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"ac","submitted":38283,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5552472429740306,"acs":7804,"articleLive":2,"columnArticles":104,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":1.1154414835,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","submitted":14055,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.4181243738922709,"acs":5426,"articleLive":2,"columnArticles":82,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","questionId":"1649","status":"","submitted":12977,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.538550501156515,"acs":4191,"articleLive":2,"columnArticles":73,"formTitle":"[1547]切棍子的最小成本","frequency":0.6731005563,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","submitted":7782,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.711645101663586,"acs":385,"articleLive":2,"columnArticles":16,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","questionId":"1687","status":"","submitted":541,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.666504025372042,"acs":2732,"articleLive":2,"columnArticles":53,"formTitle":"[1549]每件商品的最新订单","frequency":0.0,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","questionId":"1688","status":"","submitted":4099,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6560963401348526,"acs":22283,"articleLive":2,"columnArticles":301,"formTitle":"[1550]存在连续三个奇数的数组","frequency":0.0,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","submitted":33963,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8180231746474941,"acs":11719,"articleLive":2,"columnArticles":163,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":0.0,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","submitted":14326,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.513582208101668,"acs":9699,"articleLive":2,"columnArticles":130,"formTitle":"[1552]两球之间的磁力","frequency":1.0847265383,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","submitted":18885,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.297899190854428,"acs":8026,"articleLive":2,"columnArticles":126,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":1.1474135162,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","questionId":"1676","status":"","submitted":26942,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.7081447963800905,"acs":626,"articleLive":2,"columnArticles":22,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"","submitted":884,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.43864864864864866,"acs":3246,"articleLive":2,"columnArticles":62,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"","submitted":7400,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.5750891050958482,"acs":11940,"articleLive":2,"columnArticles":184,"formTitle":"[1556]千位分隔数","frequency":2.3712246899,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","submitted":20762,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7758428412112893,"acs":9044,"articleLive":2,"columnArticles":129,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":1.4161956376,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","questionId":"1661","status":"","submitted":11657,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6238385983541279,"acs":4700,"articleLive":2,"columnArticles":77,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":0.60905819,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","questionId":"1662","status":"","submitted":7534,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.37643704589349763,"acs":4093,"articleLive":2,"columnArticles":72,"formTitle":"[1559]二维网格图中探测环","frequency":0.0,"frontendQuestionId":"1559","leaf":true,"level":2,"nodeType":"def","questionId":"1663","status":"","submitted":10873,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.571908261530664,"acs":9027,"articleLive":2,"columnArticles":93,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":0.0,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","submitted":15784,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7785732228083396,"acs":12398,"articleLive":2,"columnArticles":183,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":1.0847265383,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","submitted":15924,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.3105780182232346,"acs":4363,"articleLive":2,"columnArticles":89,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":0.0,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","submitted":14048,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.38209887888255833,"acs":4158,"articleLive":2,"columnArticles":67,"formTitle":"[1563]石子游戏 V","frequency":0.0,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","submitted":10882,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5634328358208955,"acs":755,"articleLive":2,"columnArticles":28,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"","submitted":1340,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.7301147605856747,"acs":3690,"articleLive":2,"columnArticles":46,"formTitle":"[1565]按月统计订单数与顾客数","frequency":0.0,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"","submitted":5054,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.44525857491770204,"acs":8386,"articleLive":2,"columnArticles":126,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":0.5233893954,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","questionId":"1689","status":"","submitted":18834,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.4090021411260911,"acs":17383,"articleLive":2,"columnArticles":264,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":1.6209900502,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","submitted":42501,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.45970603142422706,"acs":2721,"articleLive":2,"columnArticles":49,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","submitted":5919,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.47286148501953973,"acs":2178,"articleLive":2,"columnArticles":47,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","questionId":"1692","status":"","submitted":4606,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.895074088906688,"acs":2235,"articleLive":2,"columnArticles":40,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.5233893954,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"","submitted":2497,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.7602113391587075,"acs":3741,"articleLive":2,"columnArticles":46,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"","submitted":4921,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.8010771850619778,"acs":20228,"articleLive":2,"columnArticles":336,"formTitle":"[1572]矩阵对角线元素的和","frequency":1.1154414835,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","submitted":25251,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.29799390553580496,"acs":4694,"articleLive":2,"columnArticles":67,"formTitle":"[1573]分割字符串的方案数","frequency":0.0,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","submitted":15752,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.3311843208045903,"acs":5137,"articleLive":2,"columnArticles":90,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":0.5792230415,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","questionId":"1679","status":"","submitted":15511,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.5953493947021455,"acs":4967,"articleLive":2,"columnArticles":71,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","submitted":8343,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.47678343134748147,"acs":18647,"articleLive":2,"columnArticles":267,"formTitle":"[1576]替换所有的问号","frequency":0.0,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","questionId":"1698","status":"","submitted":39110,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.3282092605219116,"acs":5295,"articleLive":2,"columnArticles":85,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":0.8226322903,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","questionId":"1699","status":"","submitted":16133,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5853018372703412,"acs":11373,"articleLive":2,"columnArticles":212,"formTitle":"[1578]使绳子变成彩色的最短时间","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","submitted":19431,"title":"使绳子变成彩色的最短时间","titleSlug":"minimum-time-to-make-rope-colorful"},{"acceptance":0.6197135061391542,"acs":16353,"articleLive":2,"columnArticles":298,"formTitle":"[1579]保证图可完全遍历","frequency":0.0,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","questionId":"1701","status":"","submitted":26388,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.626984126984127,"acs":316,"articleLive":2,"columnArticles":23,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"","submitted":504,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8059763436397593,"acs":3884,"articleLive":2,"columnArticles":55,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","questionId":"1724","status":"","submitted":4819,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.669265250438511,"acs":10302,"articleLive":2,"columnArticles":122,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":0.5506985748,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","submitted":15393,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6851409113960734,"acs":18914,"articleLive":2,"columnArticles":246,"formTitle":"[1583]统计不开心的朋友","frequency":2.6800920989,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","submitted":27606,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6635777788230867,"acs":28214,"articleLive":2,"columnArticles":358,"formTitle":"[1584]连接所有点的最小费用","frequency":1.7124614537,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","submitted":42518,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.4311377245508982,"acs":2448,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","questionId":"1707","status":"","submitted":5678,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6278409090909091,"acs":442,"articleLive":2,"columnArticles":24,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"","submitted":704,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.8310255300735613,"acs":3841,"articleLive":2,"columnArticles":44,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"","submitted":4622,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8393049019971099,"acs":45304,"articleLive":2,"columnArticles":722,"formTitle":"[1588]所有奇数长度子数组的和","frequency":2.2101475172,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"ac","submitted":53978,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.2967570288343999,"acs":4127,"articleLive":2,"columnArticles":60,"formTitle":"[1589]所有排列中的最大和","frequency":0.7075629605,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","submitted":13907,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.2714150176199512,"acs":4005,"articleLive":2,"columnArticles":60,"formTitle":"[1590]使数组和能被 P 整除","frequency":0.60905819,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","submitted":14756,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.585377358490566,"acs":1241,"articleLive":2,"columnArticles":37,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","submitted":2120,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.44529344821980166,"acs":8217,"articleLive":2,"columnArticles":130,"formTitle":"[1592]重新排列单词间的空格","frequency":0.5506985748,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","submitted":18453,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.540424739195231,"acs":5802,"articleLive":2,"columnArticles":95,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":1.0847265383,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","questionId":"1715","status":"","submitted":10736,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.3144636083876047,"acs":4394,"articleLive":2,"columnArticles":103,"formTitle":"[1594]矩阵的最大非负积","frequency":0.60905819,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","submitted":13973,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.4686616399622997,"acs":1989,"articleLive":2,"columnArticles":40,"formTitle":"[1595]连通两组点的最小成本","frequency":0.8226322903,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","questionId":"1717","status":"","submitted":4244,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7545582047685835,"acs":2690,"articleLive":2,"columnArticles":47,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","questionId":"1735","status":"","submitted":3565,"title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.6625514403292181,"acs":322,"articleLive":2,"columnArticles":21,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","questionId":"1736","status":"","submitted":486,"title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6727667848564566,"acs":11764,"articleLive":2,"columnArticles":157,"formTitle":"[1598]文件夹操作日志搜集器","frequency":0.0,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"ac","submitted":17486,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.420919175911252,"acs":3984,"articleLive":2,"columnArticles":71,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","submitted":9465,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.6759607843137255,"acs":17237,"articleLive":2,"columnArticles":209,"formTitle":"[1600]皇位继承顺序","frequency":0.0,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","submitted":25500,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.4899502917657229,"acs":2267,"articleLive":2,"columnArticles":41,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","submitted":4627,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7470389170896785,"acs":883,"articleLive":2,"columnArticles":36,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","questionId":"1745","status":"","submitted":1182,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8438467714187406,"acs":58860,"articleLive":2,"columnArticles":470,"formTitle":"[1603]设计停车系统","frequency":1.0847265383,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"ac","submitted":69752,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.41492809398420094,"acs":4097,"articleLive":2,"columnArticles":69,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":1.1154414835,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","questionId":"1709","status":"","submitted":9874,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7398310080565926,"acs":3765,"articleLive":2,"columnArticles":75,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","questionId":"1711","status":"ac","submitted":5089,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.3501776549545993,"acs":1774,"articleLive":2,"columnArticles":38,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","questionId":"1710","status":"","submitted":5066,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5404541631623213,"acs":3213,"articleLive":2,"columnArticles":44,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"","submitted":5945,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6396298966594569,"acs":10646,"articleLive":2,"columnArticles":177,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","questionId":"1730","status":"","submitted":16644,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.5929266052885634,"acs":25181,"articleLive":2,"columnArticles":417,"formTitle":"[1609]奇偶树","frequency":0.1759230684,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"ac","submitted":42469,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.44573278724817356,"acs":16107,"articleLive":2,"columnArticles":154,"formTitle":"[1610]可见点的最大数目","frequency":0.8995087684,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","submitted":36136,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6107438016528925,"acs":2217,"articleLive":2,"columnArticles":58,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","questionId":"1732","status":"","submitted":3630,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.7319884726224783,"acs":508,"articleLive":2,"columnArticles":23,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","questionId":"1750","status":"","submitted":694,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.7329051756705705,"acs":1940,"articleLive":2,"columnArticles":38,"formTitle":"[1613]找到遗失的ID","frequency":0.6403107335,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"","submitted":2647,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.8209882098820989,"acs":18244,"articleLive":2,"columnArticles":302,"formTitle":"[1614]括号的最大嵌套深度","frequency":0.5506985748,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","submitted":22222,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.5025085819910219,"acs":5709,"articleLive":2,"columnArticles":68,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","submitted":11361,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.27718945250450067,"acs":5235,"articleLive":2,"columnArticles":97,"formTitle":"[1616]分割两个字符串得到回文串","frequency":1.814643173,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","submitted":18886,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.626314004747372,"acs":1847,"articleLive":2,"columnArticles":35,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","submitted":2949,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5781990521327014,"acs":366,"articleLive":2,"columnArticles":18,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","questionId":"1384","status":"","submitted":633,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6715024178756045,"acs":8054,"articleLive":2,"columnArticles":138,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","submitted":11994,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.3737014373132204,"acs":2626,"articleLive":2,"columnArticles":44,"formTitle":"[1620]网络信号最好的坐标","frequency":0.0,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","submitted":7027,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.44205607476635517,"acs":1892,"articleLive":2,"columnArticles":37,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","questionId":"1725","status":"","submitted":4280,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.15489562215768998,"acs":2827,"articleLive":2,"columnArticles":60,"formTitle":"[1622]奇妙序列","frequency":1.9551921383,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","submitted":18251,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.7843096234309623,"acs":3749,"articleLive":2,"columnArticles":48,"formTitle":"[1623]三人国家代表队","frequency":0.0,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","questionId":"1763","status":"","submitted":4780,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6212266411116435,"acs":12965,"articleLive":2,"columnArticles":225,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":1.0847265383,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","submitted":20870,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5478694954537351,"acs":3073,"articleLive":2,"columnArticles":69,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","submitted":5609,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.3908294887487054,"acs":4151,"articleLive":2,"columnArticles":87,"formTitle":"[1626]无矛盾的最佳球队","frequency":0.5506985748,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","submitted":10621,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.3849624060150376,"acs":2560,"articleLive":2,"columnArticles":40,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","submitted":6650,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8362989323843416,"acs":470,"articleLive":2,"columnArticles":21,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","questionId":"1768","status":"","submitted":562,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.524233146554214,"acs":9075,"articleLive":2,"columnArticles":105,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","submitted":17311,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.7621759622937941,"acs":7762,"articleLive":2,"columnArticles":123,"formTitle":"[1630]等差子数组","frequency":1.479109463,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","submitted":10184,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.49337052601072307,"acs":27238,"articleLive":2,"columnArticles":313,"formTitle":"[1631]最小体力消耗路径","frequency":1.5471012081,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"ac","submitted":55208,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.32538860103626943,"acs":1570,"articleLive":2,"columnArticles":29,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","submitted":4825,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6560069144338807,"acs":3036,"articleLive":2,"columnArticles":31,"formTitle":"[1633]各赛事的用户注册率","frequency":0.0,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"","submitted":4628,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5459662288930581,"acs":582,"articleLive":2,"columnArticles":29,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","questionId":"1774","status":"","submitted":1066,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5457816873250699,"acs":1365,"articleLive":2,"columnArticles":38,"formTitle":"[1635]Hopper 公司查询 I","frequency":0.0,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"","submitted":2501,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.706677040599802,"acs":9991,"articleLive":2,"columnArticles":197,"formTitle":"[1636]按照频率将数组升序排序","frequency":1.4470622855,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","submitted":14138,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8088794926004228,"acs":5739,"articleLive":2,"columnArticles":80,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","questionId":"1742","status":"","submitted":7095,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7147495361781077,"acs":3082,"articleLive":2,"columnArticles":52,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":0.6731005563,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","submitted":4312,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.39988358556461,"acs":1374,"articleLive":2,"columnArticles":33,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","questionId":"1744","status":"","submitted":3436,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.6547636760402717,"acs":13202,"articleLive":2,"columnArticles":226,"formTitle":"[1640]能否连接形成数组","frequency":0.0,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","submitted":20163,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.7732461282162029,"acs":12532,"articleLive":2,"columnArticles":290,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":1.1154414835,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","submitted":16207,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.4519211887150619,"acs":6904,"articleLive":2,"columnArticles":111,"formTitle":"[1642]可以到达的最远建筑","frequency":0.0,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","submitted":15277,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.4565799540933435,"acs":2387,"articleLive":2,"columnArticles":49,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","submitted":5228,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.5589802130898022,"acs":1469,"articleLive":2,"columnArticles":29,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":0.0,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","questionId":"1780","status":"","submitted":2628,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.40377027619465145,"acs":921,"articleLive":2,"columnArticles":26,"formTitle":"[1645]Hopper Company Queries II","frequency":0.0,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1785","status":"","submitted":2281,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5341753343239227,"acs":36669,"articleLive":2,"columnArticles":366,"formTitle":"[1646]获取生成数组中的最大值","frequency":2.5225976443,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"ac","submitted":68646,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5184480042016807,"acs":7897,"articleLive":2,"columnArticles":119,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":1.1154414835,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","submitted":15232,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.28113614395122316,"acs":3781,"articleLive":2,"columnArticles":94,"formTitle":"[1648]销售价值减少的颜色球","frequency":1.180738826,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","submitted":13449,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.47427965352660423,"acs":2683,"articleLive":2,"columnArticles":68,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","submitted":5657,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.7984790874524715,"acs":1890,"articleLive":2,"columnArticles":36,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":0.5233893954,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","questionId":"1790","status":"","submitted":2367,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.6583143507972665,"acs":867,"articleLive":2,"columnArticles":25,"formTitle":"[1651]Hopper Company Queries III","frequency":0.7438514124,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1795","status":"","submitted":1317,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6508389261744967,"acs":7758,"articleLive":2,"columnArticles":191,"formTitle":"[1652]拆炸弹","frequency":1.0847265383,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","submitted":11920,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.5155951623169955,"acs":4050,"articleLive":2,"columnArticles":93,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":0.0,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","submitted":7855,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.28145787139689576,"acs":4062,"articleLive":2,"columnArticles":54,"formTitle":"[1654]到家的最少跳跃次数","frequency":1.479109463,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","submitted":14432,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.3793914943688015,"acs":2257,"articleLive":2,"columnArticles":34,"formTitle":"[1655]分配重复整数","frequency":0.7438514124,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","submitted":5949,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.7824748040313549,"acs":8385,"articleLive":2,"columnArticles":98,"formTitle":"[1656]设计有序流","frequency":0.0,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","submitted":10716,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.46540169559951555,"acs":5764,"articleLive":2,"columnArticles":82,"formTitle":"[1657]确定两个字符串是否接近","frequency":0.5233893954,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","submitted":12385,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.3063074210412349,"acs":9902,"articleLive":2,"columnArticles":160,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":1.1474135162,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","submitted":32327,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.41347851677457326,"acs":1405,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":1.180738826,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","submitted":3398,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7417503586800573,"acs":517,"articleLive":2,"columnArticles":25,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"","submitted":697,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.7338593974175036,"acs":3069,"articleLive":2,"columnArticles":60,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":1.1154414835,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"","submitted":4182,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8128387596327569,"acs":22045,"articleLive":2,"columnArticles":313,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":0.0,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","submitted":27121,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5730873343781165,"acs":8045,"articleLive":2,"columnArticles":135,"formTitle":"[1663]具有给定数值的最小字符串","frequency":0.5506985748,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","submitted":14038,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.549864446165763,"acs":5679,"articleLive":2,"columnArticles":109,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","submitted":10328,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.6588620647822395,"acs":5431,"articleLive":2,"columnArticles":87,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":0.60905819,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","submitted":8243,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.7105882352941176,"acs":302,"articleLive":2,"columnArticles":14,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","questionId":"1810","status":"","submitted":425,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.6046792088760251,"acs":2507,"articleLive":2,"columnArticles":35,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"","submitted":4146,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.44473901260751736,"acs":7549,"articleLive":2,"columnArticles":140,"formTitle":"[1668]最大重复子字符串","frequency":0.5233893954,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","submitted":16974,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.7540879839645532,"acs":14296,"articleLive":2,"columnArticles":265,"formTitle":"[1669]合并两个链表","frequency":0.0,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"ac","submitted":18958,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5272373540856031,"acs":4878,"articleLive":2,"columnArticles":86,"formTitle":"[1670]设计前中后队列","frequency":0.5506985748,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"ac","submitted":9252,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.4676975217115018,"acs":2208,"articleLive":2,"columnArticles":46,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":0.6403107335,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","questionId":"1766","status":"","submitted":4721,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.8490327741174984,"acs":40335,"articleLive":2,"columnArticles":463,"formTitle":"[1672]最富有客户的资产总量","frequency":0.4479388408,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","submitted":47507,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.3608343711083437,"acs":8113,"articleLive":2,"columnArticles":178,"formTitle":"[1673]找出最具竞争力的子序列","frequency":0.5233893954,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"ac","submitted":22484,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.37019432405983504,"acs":2648,"articleLive":2,"columnArticles":55,"formTitle":"[1674]使数组互补的最少操作次数","frequency":0.6731005563,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","submitted":7153,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.4336718990458603,"acs":2818,"articleLive":2,"columnArticles":47,"formTitle":"[1675]数组的最小偏移量","frequency":0.7438514124,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","submitted":6498,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7662527392257122,"acs":1049,"articleLive":2,"columnArticles":27,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":0.0,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","questionId":"1816","status":"","submitted":1369,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.37773811455460005,"acs":2328,"articleLive":2,"columnArticles":38,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"","submitted":6163,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.8282289074869938,"acs":18308,"articleLive":2,"columnArticles":301,"formTitle":"[1678]设计 Goal 解析器","frequency":0.5233893954,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","submitted":22105,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.49784714747039827,"acs":7400,"articleLive":2,"columnArticles":120,"formTitle":"[1679]K 和数对的最大数目","frequency":0.4972098898,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","submitted":14864,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.4709197843489626,"acs":5765,"articleLive":2,"columnArticles":74,"formTitle":"[1680]连接连续二进制数字","frequency":0.0,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","submitted":12242,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.3863778054862843,"acs":2479,"articleLive":2,"columnArticles":50,"formTitle":"[1681]最小不兼容性","frequency":0.0,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","submitted":6416,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5304709141274239,"acs":383,"articleLive":2,"columnArticles":17,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"","submitted":722,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8977325312355391,"acs":3880,"articleLive":2,"columnArticles":42,"formTitle":"[1683]无效的推文","frequency":0.5233893954,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"","submitted":4322,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.8270915266356811,"acs":18507,"articleLive":2,"columnArticles":380,"formTitle":"[1684]统计一致字符串的数目","frequency":0.0,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","submitted":22376,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.6107599588416875,"acs":4155,"articleLive":2,"columnArticles":92,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","questionId":"1787","status":"","submitted":6803,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.4762678803641092,"acs":2930,"articleLive":2,"columnArticles":51,"formTitle":"[1686]石子游戏 VI","frequency":0.0,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","submitted":6152,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.3993199848885531,"acs":1057,"articleLive":2,"columnArticles":26,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","submitted":2647,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.8068460594909537,"acs":21049,"articleLive":2,"columnArticles":280,"formTitle":"[1688]比赛中的配对次数","frequency":1.0847265383,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","submitted":26088,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8651579181494662,"acs":15559,"articleLive":2,"columnArticles":206,"formTitle":"[1689]十-二进制数的最少数目","frequency":0.0,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","questionId":"1807","status":"","submitted":17984,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5224503610108303,"acs":4631,"articleLive":2,"columnArticles":109,"formTitle":"[1690]石子游戏 VII","frequency":0.7075629605,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","submitted":8864,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.49289281598155976,"acs":2566,"articleLive":2,"columnArticles":63,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","submitted":5206,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.657051282051282,"acs":205,"articleLive":2,"columnArticles":13,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"","submitted":312,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.8053649407361197,"acs":2582,"articleLive":2,"columnArticles":36,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"","submitted":3206,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6372541457770922,"acs":8262,"articleLive":2,"columnArticles":143,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","submitted":12965,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.47219076800106574,"acs":7089,"articleLive":2,"columnArticles":144,"formTitle":"[1695]删除子数组的最大得分","frequency":0.4972098898,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","submitted":15013,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.3955056179775281,"acs":6864,"articleLive":2,"columnArticles":121,"formTitle":"[1696]跳跃游戏 VI","frequency":0.6403107335,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","submitted":17355,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.531127957730301,"acs":2312,"articleLive":2,"columnArticles":46,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","submitted":4353,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5152354570637119,"acs":558,"articleLive":2,"columnArticles":17,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.865557335,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","questionId":"1838","status":"","submitted":1083,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.8019504876219055,"acs":2138,"articleLive":2,"columnArticles":45,"formTitle":"[1699]两人之间的通话次数","frequency":0.60905819,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"","submitted":2666,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7040428858610677,"acs":9456,"articleLive":2,"columnArticles":195,"formTitle":"[1700]无法吃午餐的学生数量","frequency":0.4972098898,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","submitted":13431,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6144422023637937,"acs":4263,"articleLive":2,"columnArticles":85,"formTitle":"[1701]平均等待时间","frequency":0.5506985748,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","submitted":6938,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.4792926239419589,"acs":3171,"articleLive":2,"columnArticles":68,"formTitle":"[1702]修改后的最大二进制字符串","frequency":0.0,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","submitted":6616,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.38910081743869207,"acs":1428,"articleLive":2,"columnArticles":25,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.865557335,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","submitted":3670,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.7806272951658539,"acs":12967,"articleLive":2,"columnArticles":201,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","submitted":16611,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.4516287506613257,"acs":23902,"articleLive":2,"columnArticles":328,"formTitle":"[1705]吃苹果的最大数目","frequency":0.7513432065,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"ac","submitted":52924,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5928355196770938,"acs":4700,"articleLive":2,"columnArticles":118,"formTitle":"[1706]球会落何处","frequency":0.0,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","submitted":7928,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5032037888285277,"acs":14450,"articleLive":2,"columnArticles":152,"formTitle":"[1707]与数组中元素的最大异或值","frequency":0.0,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","submitted":28716,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.705456936226167,"acs":1073,"articleLive":2,"columnArticles":27,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"","submitted":1521,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.7175188600167645,"acs":1712,"articleLive":2,"columnArticles":43,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.60905819,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"","submitted":2386,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.6958624395486298,"acs":12950,"articleLive":2,"columnArticles":203,"formTitle":"[1710]卡车上的最大单元数","frequency":0.4972098898,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"ac","submitted":18610,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.35884007484906616,"acs":30491,"articleLive":2,"columnArticles":363,"formTitle":"[1711]大餐计数","frequency":2.6568607087,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"ac","submitted":84971,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.2644028279181709,"acs":7031,"articleLive":2,"columnArticles":107,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.5506985748,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","submitted":26592,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.49434161163302637,"acs":15944,"articleLive":2,"columnArticles":173,"formTitle":"[1713]得到子序列的最少操作次数","frequency":2.753803135,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"ac","submitted":32253,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.6067415730337079,"acs":270,"articleLive":2,"columnArticles":10,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","questionId":"1809","status":"","submitted":445,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.7244715155858116,"acs":2022,"articleLive":2,"columnArticles":39,"formTitle":"[1715]苹果和橘子的个数","frequency":0.0,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"","submitted":2791,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6682446926547821,"acs":9034,"articleLive":2,"columnArticles":200,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","submitted":13519,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.44015444015444016,"acs":2394,"articleLive":2,"columnArticles":53,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.7075629605,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","submitted":5439,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.49851496458761707,"acs":2182,"articleLive":2,"columnArticles":51,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.6403107335,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","submitted":4377,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.37641083521444696,"acs":667,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","questionId":"1820","status":"","submitted":1772,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.8687315904059716,"acs":47484,"articleLive":2,"columnArticles":500,"formTitle":"[1720]解码异或后的数组","frequency":0.4972098898,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"ac","submitted":54659,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6443013250277148,"acs":12205,"articleLive":2,"columnArticles":188,"formTitle":"[1721]交换链表中的节点","frequency":1.0847265383,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"ac","submitted":18943,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5166140904311252,"acs":4913,"articleLive":2,"columnArticles":119,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","submitted":9510,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5054673646880014,"acs":23945,"articleLive":2,"columnArticles":179,"formTitle":"[1723]完成所有工作的最短时间","frequency":1.5124236696,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"ac","submitted":47372,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5579399141630901,"acs":390,"articleLive":2,"columnArticles":14,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","questionId":"1865","status":"","submitted":699,"title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.7889743056998407,"acs":11392,"articleLive":2,"columnArticles":155,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":0.0,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","questionId":"1843","status":"","submitted":14439,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.4887342611000663,"acs":5900,"articleLive":2,"columnArticles":115,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","submitted":12072,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.5779786890539231,"acs":3580,"articleLive":2,"columnArticles":84,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":0.6403107335,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","submitted":6194,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.3648399014778325,"acs":1185,"articleLive":2,"columnArticles":26,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","submitted":3248,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.622938715235048,"acs":2531,"articleLive":2,"columnArticles":25,"formTitle":"[1729]求关注者的数量","frequency":0.0,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"","submitted":4063,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.524349566377585,"acs":786,"articleLive":2,"columnArticles":25,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"","submitted":1499,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.46229648671808055,"acs":2158,"articleLive":2,"columnArticles":33,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","questionId":"1882","status":"","submitted":4668,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.7888029955308612,"acs":13061,"articleLive":2,"columnArticles":220,"formTitle":"[1732]找到最高海拔","frequency":0.5233893954,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","submitted":16558,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.4662080129502226,"acs":2304,"articleLive":2,"columnArticles":56,"formTitle":"[1733]需要教语言的最少人数","frequency":0.0,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","submitted":4942,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7233349575564845,"acs":28205,"articleLive":2,"columnArticles":370,"formTitle":"[1734]解码异或后的排列","frequency":0.5506985748,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"ac","submitted":38993,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.4899817850637523,"acs":1076,"articleLive":2,"columnArticles":26,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","submitted":2196,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.448612349018041,"acs":29193,"articleLive":2,"columnArticles":358,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":1.9551921383,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"ac","submitted":65074,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.31897756225856827,"acs":3881,"articleLive":2,"columnArticles":106,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":0.0,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","questionId":"1859","status":"","submitted":12167,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6536743532186019,"acs":28829,"articleLive":2,"columnArticles":391,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":0.0,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"ac","submitted":44103,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.4752972701390052,"acs":2838,"articleLive":2,"columnArticles":62,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","submitted":5971,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.6536585365853659,"acs":804,"articleLive":2,"columnArticles":26,"formTitle":"[1740]找到二叉树中的距离","frequency":0.8226322903,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"","submitted":1230,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8395665851101014,"acs":2402,"articleLive":2,"columnArticles":33,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","questionId":"1892","status":"","submitted":2861,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7104852551100016,"acs":9107,"articleLive":2,"columnArticles":135,"formTitle":"[1742]盒子中小球的最大数量","frequency":0.0,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","submitted":12818,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6966471364152275,"acs":22710,"articleLive":2,"columnArticles":332,"formTitle":"[1743]从相邻元素对还原数组","frequency":2.5148079262,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"ac","submitted":32599,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.36284995681113763,"acs":28565,"articleLive":2,"columnArticles":369,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗?","frequency":0.0,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","questionId":"1872","status":"ac","submitted":78724,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗?","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.4849624060150376,"acs":3612,"articleLive":2,"columnArticles":75,"formTitle":"[1745]回文串分割 IV","frequency":0.6731005563,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","submitted":7448,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.5735498839907193,"acs":1236,"articleLive":2,"columnArticles":47,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":1.1474135162,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"","submitted":2155,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.6941596076683014,"acs":1557,"articleLive":2,"columnArticles":37,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"","submitted":2243,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.7432261040009224,"acs":12892,"articleLive":2,"columnArticles":250,"formTitle":"[1748]唯一元素的和","frequency":0.0,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","submitted":17346,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5364500792393027,"acs":4062,"articleLive":2,"columnArticles":94,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":0.0,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","submitted":7572,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.4537191140699014,"acs":3544,"articleLive":2,"columnArticles":81,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","questionId":"1850","status":"","submitted":7811,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.4786508091245857,"acs":2455,"articleLive":2,"columnArticles":36,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":0.7821409289,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","questionId":"1851","status":"","submitted":5129,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.669730926659062,"acs":9981,"articleLive":2,"columnArticles":119,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":0.5233893954,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","submitted":14903,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6299380325329202,"acs":6506,"articleLive":2,"columnArticles":136,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","submitted":10328,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.4239047619047619,"acs":4451,"articleLive":2,"columnArticles":93,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":0.60905819,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","submitted":10500,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.4185703758290346,"acs":3408,"articleLive":2,"columnArticles":58,"formTitle":"[1755]最接近目标值的子序列和","frequency":1.3719406285,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","submitted":8142,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.8117469879518072,"acs":539,"articleLive":2,"columnArticles":17,"formTitle":"[1756]设计最近使用(MRU)队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"","submitted":664,"title":"设计最近使用(MRU)队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9228934817170111,"acs":3483,"articleLive":2,"columnArticles":37,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"","submitted":3774,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6433630530789101,"acs":7721,"articleLive":2,"columnArticles":117,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","submitted":12001,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.43490992989617533,"acs":4901,"articleLive":2,"columnArticles":101,"formTitle":"[1759]统计同构子字符串的数目","frequency":0.0,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","submitted":11269,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5463792685880359,"acs":4512,"articleLive":2,"columnArticles":80,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","submitted":8258,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.43921259842519683,"acs":2789,"articleLive":2,"columnArticles":43,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":0.9111856876,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","questionId":"1887","status":"","submitted":6350,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.7269417475728155,"acs":1198,"articleLive":2,"columnArticles":25,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"","submitted":1648,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.5878237387995581,"acs":4789,"articleLive":2,"columnArticles":90,"formTitle":"[1763]最长的美好子字符串","frequency":0.5506985748,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","submitted":8147,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.4745890799168713,"acs":2512,"articleLive":2,"columnArticles":62,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.6403107335,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","questionId":"1874","status":"","submitted":5293,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5468967436682438,"acs":3930,"articleLive":2,"columnArticles":90,"formTitle":"[1765]地图中的最高点","frequency":1.1154414835,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","submitted":7186,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.3797341359418109,"acs":1514,"articleLive":2,"columnArticles":29,"formTitle":"[1766]互质树","frequency":1.4161956376,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","submitted":3987,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7941640378548895,"acs":1007,"articleLive":2,"columnArticles":25,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","questionId":"1914","status":"","submitted":1268,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7601692354185554,"acs":12577,"articleLive":2,"columnArticles":224,"formTitle":"[1768]交替合并字符串","frequency":0.4972098898,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","submitted":16545,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8545019920318725,"acs":10724,"articleLive":2,"columnArticles":187,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":0.0,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","questionId":"1895","status":"","submitted":12550,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.3727054383256133,"acs":4345,"articleLive":2,"columnArticles":110,"formTitle":"[1770]执行乘法运算的最大分数","frequency":0.0,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","submitted":11658,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.36787722230664033,"acs":2421,"articleLive":2,"columnArticles":48,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","submitted":6581,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.5040650406504065,"acs":434,"articleLive":2,"columnArticles":13,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"","submitted":861,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8430956143816674,"acs":17071,"articleLive":2,"columnArticles":213,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":0.0,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","submitted":20248,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5457910139438802,"acs":6341,"articleLive":2,"columnArticles":93,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":0.0,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","submitted":11618,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.4764624986776685,"acs":4504,"articleLive":2,"columnArticles":98,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":0.0,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","questionId":"1901","status":"","submitted":9453,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.4616122840690979,"acs":1924,"articleLive":2,"columnArticles":45,"formTitle":"[1776]车队 II","frequency":0.8226322903,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","submitted":4168,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.7866086727296692,"acs":5968,"articleLive":2,"columnArticles":65,"formTitle":"[1777]每家商店的产品价格","frequency":1.0847265383,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"","submitted":7587,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5035294117647059,"acs":214,"articleLive":2,"columnArticles":10,"formTitle":"[1778]未知网格中的最短路径","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","questionId":"1931","status":"","submitted":425,"title":"未知网格中的最短路径","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.6470650786899191,"acs":6085,"articleLive":2,"columnArticles":76,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":0.5233893954,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","questionId":"1888","status":"","submitted":9404,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.6691952506596306,"acs":6087,"articleLive":2,"columnArticles":118,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","questionId":"1889","status":"","submitted":9096,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.52587890625,"acs":4308,"articleLive":2,"columnArticles":62,"formTitle":"[1781]所有子字符串美丽值之和","frequency":0.7438514124,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","submitted":8192,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.2971830985915493,"acs":1266,"articleLive":2,"columnArticles":36,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","submitted":4260,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7949422759758109,"acs":1446,"articleLive":2,"columnArticles":34,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"","submitted":1819,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.4232663203072058,"acs":9369,"articleLive":2,"columnArticles":111,"formTitle":"[1784]检查二进制字符串字段","frequency":0.0,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","questionId":"1910","status":"","submitted":22135,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.35349305629174177,"acs":6669,"articleLive":2,"columnArticles":68,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","questionId":"1911","status":"","submitted":18866,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.34305187429004164,"acs":3624,"articleLive":2,"columnArticles":94,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.5506985748,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","questionId":"1912","status":"","submitted":10564,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.6527143721467467,"acs":11867,"articleLive":2,"columnArticles":61,"formTitle":"[1787]使所有区间的异或结果为零","frequency":1.1154414835,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","questionId":"1913","status":"ac","submitted":18181,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.6517647058823529,"acs":277,"articleLive":2,"columnArticles":19,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"","submitted":425,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7134394668641244,"acs":1927,"articleLive":2,"columnArticles":35,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"","submitted":2701,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6351203000640381,"acs":13885,"articleLive":2,"columnArticles":160,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":0.0,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","questionId":"1915","status":"","submitted":21862,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8092527203286013,"acs":11230,"articleLive":2,"columnArticles":154,"formTitle":"[1791]找出星型图的中心节点","frequency":0.0,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","questionId":"1916","status":"","submitted":13877,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5123137959428101,"acs":6844,"articleLive":2,"columnArticles":110,"formTitle":"[1792]最大平均通过率","frequency":1.8899799896,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","submitted":13359,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.41927269023123154,"acs":4116,"articleLive":2,"columnArticles":100,"formTitle":"[1793]好子数组的最大分数","frequency":0.0,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","submitted":9817,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.5833333333333334,"acs":217,"articleLive":2,"columnArticles":9,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","questionId":"1943","status":"","submitted":372,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.78534213268496,"acs":2261,"articleLive":2,"columnArticles":32,"formTitle":"[1795]每个产品在不同商店的价格","frequency":0.5506985748,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"","submitted":2879,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.4919250645994832,"acs":7615,"articleLive":2,"columnArticles":139,"formTitle":"[1796]字符串中第二大的数字","frequency":0.0,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"ac","submitted":15480,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.5693095163480623,"acs":5450,"articleLive":2,"columnArticles":84,"formTitle":"[1797]设计一个验证系统","frequency":1.0847265383,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"ac","submitted":9573,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.526458832933653,"acs":3293,"articleLive":2,"columnArticles":52,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":1.180738826,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","questionId":"1930","status":"","submitted":6255,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.516035588661287,"acs":2494,"articleLive":2,"columnArticles":34,"formTitle":"[1799]N 次操作后的最大分数和","frequency":1.4161956376,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","submitted":4833,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6801036941023979,"acs":10494,"articleLive":2,"columnArticles":175,"formTitle":"[1800]最大升序子数组和","frequency":0.0,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"ac","submitted":15430,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.384011855984657,"acs":4405,"articleLive":2,"columnArticles":115,"formTitle":"[1801]积压订单中的订单总数","frequency":0.6731005563,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"notac","submitted":11471,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.26432643264326433,"acs":4405,"articleLive":2,"columnArticles":110,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","questionId":"1929","status":"","submitted":16665,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.40764094955489616,"acs":2198,"articleLive":2,"columnArticles":55,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":0.0,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"ac","submitted":5392,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5768518518518518,"acs":623,"articleLive":2,"columnArticles":37,"formTitle":"[1804]实现 Trie (前缀树) II","frequency":0.7075629605,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"","submitted":1080,"title":"实现 Trie (前缀树) II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.47717577642227804,"acs":11969,"articleLive":2,"columnArticles":162,"formTitle":"[1805]字符串中不同整数的数目","frequency":0.0,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","submitted":25083,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.6631289798976152,"acs":5311,"articleLive":2,"columnArticles":83,"formTitle":"[1806]还原排列的最少操作步数","frequency":0.0,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","questionId":"1935","status":"","submitted":8009,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5860496701590997,"acs":6041,"articleLive":2,"columnArticles":92,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","submitted":10308,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.26899035914821484,"acs":2539,"articleLive":2,"columnArticles":48,"formTitle":"[1808]好因子的最大数目","frequency":0.0,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","submitted":9439,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6249634609763227,"acs":2138,"articleLive":2,"columnArticles":36,"formTitle":"[1809]没有广告的剧集","frequency":0.4972098898,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"","submitted":3421,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.6164772727272727,"acs":217,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":0.0,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","questionId":"1959","status":"","submitted":352,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6603881278538812,"acs":1157,"articleLive":2,"columnArticles":33,"formTitle":"[1811]寻找面试候选人","frequency":0.6403107335,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"","submitted":1752,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7927269525402836,"acs":9003,"articleLive":2,"columnArticles":221,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.4972098898,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"ac","submitted":11357,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5013052479971195,"acs":5569,"articleLive":2,"columnArticles":85,"formTitle":"[1813]句子相似性 III","frequency":1.1474135162,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"ac","submitted":11109,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.35082116788321166,"acs":3845,"articleLive":2,"columnArticles":87,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":0.0,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"ac","submitted":10960,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.2945673389720234,"acs":1811,"articleLive":2,"columnArticles":40,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","submitted":6148,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.7348134108069477,"acs":47297,"articleLive":2,"columnArticles":642,"formTitle":"[1816]截断句子","frequency":0.9044904296,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"ac","submitted":64366,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6976106970626919,"acs":6365,"articleLive":2,"columnArticles":105,"formTitle":"[1817]查找用户活跃分钟数","frequency":0.5506985748,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"ac","submitted":9124,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.37182065371324985,"acs":26255,"articleLive":2,"columnArticles":341,"formTitle":"[1818]绝对差值和","frequency":2.6568607087,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"ac","submitted":70612,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.3807818561623396,"acs":2552,"articleLive":2,"columnArticles":35,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.7821409289,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","submitted":6702,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.48986486486486486,"acs":145,"articleLive":2,"columnArticles":9,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"","submitted":296,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.900909375979931,"acs":2873,"articleLive":2,"columnArticles":25,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":0.0,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","questionId":"1974","status":"","submitted":3189,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.80285855101035,"acs":21177,"articleLive":2,"columnArticles":211,"formTitle":"[1822]数组元素积的符号","frequency":0.0,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","submitted":26377,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7222619388046897,"acs":10103,"articleLive":2,"columnArticles":129,"formTitle":"[1823]找出游戏的获胜者","frequency":1.6808881918,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","submitted":13988,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6500284529713032,"acs":7996,"articleLive":2,"columnArticles":159,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","submitted":12301,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.28407669862442686,"acs":2726,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":0.0,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","submitted":9596,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.4263764404609475,"acs":333,"articleLive":2,"columnArticles":24,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"","submitted":781,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7917776657786738,"acs":10997,"articleLive":2,"columnArticles":155,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"ac","submitted":13889,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.866111336854937,"acs":8526,"articleLive":2,"columnArticles":108,"formTitle":"[1828]统计一个圆中点的数目","frequency":0.0,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","questionId":"1939","status":"ac","submitted":9844,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.6906882591093118,"acs":4265,"articleLive":2,"columnArticles":88,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"ac","submitted":6175,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.4912568306010929,"acs":899,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","questionId":"1941","status":"ac","submitted":1830,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.7416777629826897,"acs":1114,"articleLive":2,"columnArticles":29,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"","submitted":1502,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8235817575083426,"acs":14808,"articleLive":2,"columnArticles":233,"formTitle":"[1832]判断句子是否为全字母句","frequency":0.0,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"ac","submitted":17980,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6830165448249327,"acs":44379,"articleLive":2,"columnArticles":393,"formTitle":"[1833]雪糕的最大数量","frequency":1.479109463,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"ac","submitted":64975,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.3557893606742176,"acs":6628,"articleLive":2,"columnArticles":137,"formTitle":"[1834]单线程 CPU","frequency":0.6403107335,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","submitted":18629,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5152305159165752,"acs":3755,"articleLive":2,"columnArticles":63,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":0.865557335,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","questionId":"1963","status":"","submitted":7288,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.734955185659411,"acs":574,"articleLive":2,"columnArticles":33,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":0.60905819,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","questionId":"1982","status":"","submitted":781,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7952265973254086,"acs":8563,"articleLive":2,"columnArticles":103,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":0.5233893954,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"ac","submitted":10768,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.4288802668690137,"acs":29956,"articleLive":2,"columnArticles":314,"formTitle":"[1838]最高频元素的频数","frequency":3.2861831672,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"ac","submitted":69847,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5656186198448346,"acs":6926,"articleLive":2,"columnArticles":134,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"ac","submitted":12245,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.38995125609298836,"acs":2080,"articleLive":2,"columnArticles":47,"formTitle":"[1840]最高建筑高度","frequency":0.0,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"ac","submitted":5334,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5266608391608392,"acs":1205,"articleLive":2,"columnArticles":39,"formTitle":"[1841]联赛信息统计","frequency":0.0,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"","submitted":2288,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.6462264150943396,"acs":137,"articleLive":2,"columnArticles":15,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"","submitted":212,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.5031806615776081,"acs":791,"articleLive":2,"columnArticles":27,"formTitle":"[1843]可疑银行账户","frequency":0.0,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","questionId":"1998","status":"","submitted":1572,"title":"可疑银行账户","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.7995460641700196,"acs":7750,"articleLive":2,"columnArticles":129,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","questionId":"1954","status":"","submitted":9693,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.5077188100443915,"acs":7663,"articleLive":2,"columnArticles":74,"formTitle":"[1845]座位预约管理系统","frequency":0.5506985748,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","questionId":"1955","status":"","submitted":15093,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.6329964045858489,"acs":27993,"articleLive":2,"columnArticles":379,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":2.2101475172,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","questionId":"1956","status":"ac","submitted":44223,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.3628808864265928,"acs":2489,"articleLive":2,"columnArticles":48,"formTitle":"[1847]最近的房间","frequency":0.865557335,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1957","status":"","submitted":6859,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6811921063229964,"acs":8457,"articleLive":2,"columnArticles":108,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","questionId":"1975","status":"","submitted":12415,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.32853139013452914,"acs":5861,"articleLive":2,"columnArticles":113,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":0.6403107335,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","questionId":"1976","status":"","submitted":17840,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6108968177434908,"acs":2534,"articleLive":2,"columnArticles":51,"formTitle":"[1850]邻位交换的最小次数","frequency":0.7075629605,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","questionId":"1978","status":"","submitted":4148,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.4042314173375772,"acs":2159,"articleLive":2,"columnArticles":52,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.9598334118,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","questionId":"1977","status":"","submitted":5341,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.5702592087312415,"acs":418,"articleLive":2,"columnArticles":13,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","questionId":"2003","status":"","submitted":733,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6385150812064965,"acs":1376,"articleLive":2,"columnArticles":21,"formTitle":"[1853]转换日期格式","frequency":0.0,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","questionId":"2004","status":"","submitted":2155,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7744860567666605,"acs":12470,"articleLive":2,"columnArticles":133,"formTitle":"[1854]人口最多的年份","frequency":1.4470622855,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","questionId":"1983","status":"ac","submitted":16101,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.6684063599951451,"acs":11014,"articleLive":2,"columnArticles":108,"formTitle":"[1855]下标对中的最大距离","frequency":0.0,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","questionId":"1984","status":"notac","submitted":16478,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.35569194797603393,"acs":4868,"articleLive":2,"columnArticles":85,"formTitle":"[1856]子数组最小乘积的最大值","frequency":0.5233893954,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","questionId":"1985","status":"ac","submitted":13686,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.45714285714285713,"acs":2384,"articleLive":2,"columnArticles":35,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","questionId":"1986","status":"","submitted":5215,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.6413690476190477,"acs":431,"articleLive":2,"columnArticles":25,"formTitle":"[1858]包含所有前缀的最长单词","frequency":0.0,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","questionId":"2009","status":"","submitted":672,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7658025050975823,"acs":7887,"articleLive":2,"columnArticles":159,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","questionId":"1970","status":"ac","submitted":10299,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.7692578882425525,"acs":4364,"articleLive":2,"columnArticles":79,"formTitle":"[1860]增长的内存泄露","frequency":0.0,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","questionId":"1971","status":"ac","submitted":5673,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6213078367765067,"acs":3639,"articleLive":2,"columnArticles":73,"formTitle":"[1861]旋转盒子","frequency":0.0,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","questionId":"1972","status":"notac","submitted":5857,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.31627538907939856,"acs":2398,"articleLive":2,"columnArticles":45,"formTitle":"[1862]向下取整数对和","frequency":0.7075629605,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","questionId":"1326","status":"notac","submitted":7582,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.8876823031757055,"acs":14060,"articleLive":2,"columnArticles":164,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":1.0267308708,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","questionId":"1993","status":"","submitted":15839,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.3909563144000681,"acs":4591,"articleLive":2,"columnArticles":111,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":0.6731005563,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","questionId":"1994","status":"ac","submitted":11743,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.5103677080453415,"acs":5538,"articleLive":2,"columnArticles":67,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.7075629605,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","questionId":"1995","status":"ac","submitted":10851,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.6049101493292838,"acs":2390,"articleLive":2,"columnArticles":51,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":1.8899799896,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","questionId":"1996","status":"","submitted":3951,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7457044673539519,"acs":651,"articleLive":2,"columnArticles":18,"formTitle":"[1867]最大数量高于平均水平的订单","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","questionId":"2014","status":"","submitted":873,"title":"最大数量高于平均水平的订单","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5250266240681576,"acs":493,"articleLive":2,"columnArticles":22,"formTitle":"[1868]两个行程编码数组的积","frequency":0.0,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","questionId":"2019","status":"","submitted":939,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.773412675486741,"acs":13387,"articleLive":2,"columnArticles":155,"formTitle":"[1869]哪种连续子字符串更长","frequency":0.5233893954,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","questionId":"1999","status":"ac","submitted":17309,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.45020651675080314,"acs":7848,"articleLive":2,"columnArticles":76,"formTitle":"[1870]准时到达的列车最小时速","frequency":0.5506985748,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","questionId":"2000","status":"notac","submitted":17432,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.27585456128891794,"acs":6335,"articleLive":2,"columnArticles":132,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","questionId":"2001","status":"notac","submitted":22965,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.615980094000553,"acs":2228,"articleLive":2,"columnArticles":32,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","questionId":"2002","status":"","submitted":3617,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.818408736349454,"acs":2623,"articleLive":2,"columnArticles":37,"formTitle":"[1873]计算特殊奖金","frequency":0.0,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","questionId":"2024","status":"","submitted":3205,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.8771593090211133,"acs":457,"articleLive":2,"columnArticles":24,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","questionId":"2029","status":"","submitted":521,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.7257072570725708,"acs":590,"articleLive":2,"columnArticles":24,"formTitle":"[1875]将工资相同的雇员分组","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","questionId":"2030","status":"","submitted":813,"title":"将工资相同的雇员分组","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7255902360944377,"acs":7253,"articleLive":2,"columnArticles":120,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","questionId":"1987","status":"ac","submitted":9996,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8181030528515366,"acs":32104,"articleLive":2,"columnArticles":412,"formTitle":"[1877]数组中最大数对和的最小值","frequency":2.9157347127,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","questionId":"1988","status":"ac","submitted":39242,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.43335886633473764,"acs":2263,"articleLive":2,"columnArticles":58,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","questionId":"1990","status":"ac","submitted":5222,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.4167360532889259,"acs":2002,"articleLive":2,"columnArticles":40,"formTitle":"[1879]两个数组最小的异或值之和","frequency":0.0,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","questionId":"1989","status":"","submitted":4804,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.770764119601329,"acs":8120,"articleLive":2,"columnArticles":112,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":0.0,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","questionId":"2010","status":"ac","submitted":10535,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.35703563684883527,"acs":6422,"articleLive":2,"columnArticles":66,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","questionId":"2011","status":"ac","submitted":17987,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.2818916791872362,"acs":3940,"articleLive":2,"columnArticles":118,"formTitle":"[1882]使用服务器处理任务","frequency":0.7075629605,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","questionId":"2012","status":"notac","submitted":13977,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.3827571845064556,"acs":1838,"articleLive":2,"columnArticles":31,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":1.055182292,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","questionId":"2013","status":"","submitted":4802,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.6937853107344633,"acs":2456,"articleLive":2,"columnArticles":44,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":2.2763969028,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","questionId":"2031","status":"","submitted":3540,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.527086383601757,"acs":360,"articleLive":2,"columnArticles":18,"formTitle":"[1885]统计数对","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","questionId":"2036","status":"","submitted":683,"title":"统计数对","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.5715547703180212,"acs":5823,"articleLive":2,"columnArticles":87,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":0.4720829397,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","questionId":"2015","status":"","submitted":10188,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.6472748815165876,"acs":5463,"articleLive":2,"columnArticles":72,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":0.5792230415,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","questionId":"2016","status":"","submitted":8440,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.3238221632382216,"acs":2928,"articleLive":2,"columnArticles":69,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":0.0,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","questionId":"2017","status":"","submitted":9042,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.27264083670073685,"acs":2294,"articleLive":2,"columnArticles":44,"formTitle":"[1889]装包裹的最小浪费空间","frequency":0.7821409289,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","questionId":"2018","status":"","submitted":8414,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.7326677759290072,"acs":1321,"articleLive":2,"columnArticles":23,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","questionId":"2041","status":"","submitted":1803,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.34490652422739415,"acs":1808,"articleLive":2,"columnArticles":25,"formTitle":"[1891]割绳子","frequency":0.5506985748,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"2045","status":"","submitted":5242,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.3570398846708313,"acs":743,"articleLive":2,"columnArticles":18,"formTitle":"[1892]页面推荐Ⅱ","frequency":0.0,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","questionId":"2046","status":"","submitted":2081,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5907117580533362,"acs":32384,"articleLive":2,"columnArticles":425,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":2.2101475172,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","questionId":"2005","status":"ac","submitted":54822,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.45756212846514654,"acs":37947,"articleLive":2,"columnArticles":522,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":2.0951357915,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","questionId":"2006","status":"ac","submitted":82933,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5381773399014779,"acs":2185,"articleLive":2,"columnArticles":42,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","questionId":"1311","status":"notac","submitted":4060,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5074285714285715,"acs":888,"articleLive":2,"columnArticles":31,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","questionId":"2008","status":"","submitted":1750,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.5365986606447594,"acs":6891,"articleLive":2,"columnArticles":89,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":0.4972098898,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","questionId":"2025","status":"ac","submitted":12842,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.313506723806709,"acs":4243,"articleLive":2,"columnArticles":63,"formTitle":"[1898]可移除字符的最大数目","frequency":0.8226322903,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","questionId":"2027","status":"notac","submitted":13534,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6352598348712968,"acs":3924,"articleLive":2,"columnArticles":45,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","questionId":"2026","status":"","submitted":6177,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.4437479379742659,"acs":1345,"articleLive":2,"columnArticles":37,"formTitle":"[1900]最佳运动员的比拼回合","frequency":1.1154414835,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","questionId":"2028","status":"","submitted":3031,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6197404640188754,"acs":1576,"articleLive":2,"columnArticles":48,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","questionId":"2047","status":"","submitted":2543,"title":"找出顶峰元素 II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.48,"acs":120,"articleLive":2,"columnArticles":5,"formTitle":"[1902]给定二叉搜索树的插入顺序求深度","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","questionId":"2052","status":"","submitted":250,"title":"给定二叉搜索树的插入顺序求深度","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6382493563810224,"acs":8677,"articleLive":2,"columnArticles":112,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","questionId":"2032","status":"","submitted":13595,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.2873348757369953,"acs":3850,"articleLive":2,"columnArticles":75,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","questionId":"2033","status":"","submitted":13399,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.5953806672369547,"acs":6264,"articleLive":2,"columnArticles":136,"formTitle":"[1905]统计子岛屿","frequency":1.4470622855,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","questionId":"2035","status":"","submitted":10521,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.4239961759082218,"acs":2661,"articleLive":2,"columnArticles":57,"formTitle":"[1906]查询差绝对值的最小值","frequency":0.6731005563,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","questionId":"2034","status":"","submitted":6276,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.5867346938775511,"acs":690,"articleLive":2,"columnArticles":25,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","questionId":"2057","status":"","submitted":1176,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.6597014925373135,"acs":221,"articleLive":2,"columnArticles":11,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","questionId":"2062","status":"","submitted":335,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.31986754966887415,"acs":5313,"articleLive":2,"columnArticles":81,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":0.5233893954,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","questionId":"2020","status":"ac","submitted":16610,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.6720421260490373,"acs":4084,"articleLive":2,"columnArticles":67,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.5506985748,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","questionId":"2021","status":"ac","submitted":6077,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.5666368515205724,"acs":3801,"articleLive":2,"columnArticles":79,"formTitle":"[1911]最大子序列交替和","frequency":1.4470622855,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","questionId":"2022","status":"notac","submitted":6708,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.2490588949605343,"acs":2051,"articleLive":2,"columnArticles":47,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","questionId":"2023","status":"","submitted":8235,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.8322354350243819,"acs":9728,"articleLive":2,"columnArticles":115,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":1.055182292,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","questionId":"2042","status":"ac","submitted":11689,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.44508746547415495,"acs":3384,"articleLive":2,"columnArticles":74,"formTitle":"[1914]循环轮转矩阵","frequency":1.4629331154,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","questionId":"2043","status":"","submitted":7603,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.39585775693630326,"acs":3039,"articleLive":2,"columnArticles":61,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","questionId":"2044","status":"notac","submitted":7677,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5496948561464691,"acs":1261,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":0.0,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","questionId":"1313","status":"","submitted":2294,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.28408327736736066,"acs":423,"articleLive":2,"columnArticles":11,"formTitle":"[1917]Leetcodify 好友推荐","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","questionId":"2063","status":"","submitted":1489,"title":"Leetcodify 好友推荐","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.5065420560747663,"acs":271,"articleLive":2,"columnArticles":6,"formTitle":"[1918]第 K 小的子数组和·","frequency":1.180738826,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","questionId":"2069","status":"","submitted":535,"title":"第 K 小的子数组和·","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.3966887417218543,"acs":599,"articleLive":2,"columnArticles":20,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","questionId":"2064","status":"","submitted":1510,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.8929855000619655,"acs":14411,"articleLive":2,"columnArticles":125,"formTitle":"[1920]基于排列构建数组","frequency":2.2101475172,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","questionId":"2048","status":"ac","submitted":16138,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.3478157644824311,"acs":5860,"articleLive":2,"columnArticles":95,"formTitle":"[1921]消灭怪物的最大数量","frequency":1.1474135162,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","questionId":"2049","status":"ac","submitted":16848,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.3624136410407173,"acs":4931,"articleLive":2,"columnArticles":81,"formTitle":"[1922]统计好数字的数目","frequency":0.5792230415,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","questionId":"2050","status":"","submitted":13606,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.24047227619189956,"acs":1609,"articleLive":2,"columnArticles":34,"formTitle":"[1923]最长公共子路径","frequency":1.9439887946,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","questionId":"2051","status":"","submitted":6691,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.4,"acs":74,"articleLive":2,"columnArticles":6,"formTitle":"[1924]安装栅栏 II","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","questionId":"2074","status":"","submitted":185,"title":"安装栅栏 II","titleSlug":"erect-the-fence-ii"},{"acceptance":0.69330900243309,"acs":5699,"articleLive":2,"columnArticles":74,"formTitle":"[1925]统计平方和三元组的数目","frequency":1.7124614537,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","questionId":"2037","status":"ac","submitted":8220,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.34785568413886997,"acs":4088,"articleLive":2,"columnArticles":69,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","questionId":"2038","status":"notac","submitted":11752,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.41599661447312736,"acs":1966,"articleLive":2,"columnArticles":38,"formTitle":"[1927]求和游戏","frequency":0.5792230415,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","questionId":"2039","status":"notac","submitted":4726,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.4094426022422233,"acs":2593,"articleLive":2,"columnArticles":46,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":2.3601980041,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","questionId":"2040","status":"notac","submitted":6333,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.8917214472770029,"acs":16685,"articleLive":2,"columnArticles":145,"formTitle":"[1929]数组串联","frequency":1.4161956376,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","questionId":"2058","status":"","submitted":18711,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.48412367697308106,"acs":5809,"articleLive":2,"columnArticles":106,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":1.1474135162,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","questionId":"2059","status":"","submitted":11999,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5651717807500656,"acs":2155,"articleLive":2,"columnArticles":65,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":0.7821409289,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","questionId":"2061","status":"","submitted":3813,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.3319848975188781,"acs":1231,"articleLive":2,"columnArticles":36,"formTitle":"[1932]合并多棵二叉搜索树","frequency":1.7452190502,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","questionId":"2060","status":"","submitted":3708,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5063063063063064,"acs":562,"articleLive":2,"columnArticles":28,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.9111856876,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","questionId":"2070","status":"","submitted":1110,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7604166666666666,"acs":438,"articleLive":2,"columnArticles":17,"formTitle":"[1934]Confirmation Rate","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","questionId":"2087","status":"","submitted":576,"title":"Confirmation Rate","titleSlug":"confirmation-rate"},{"acceptance":0.7330125120307989,"acs":7616,"articleLive":2,"columnArticles":108,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","questionId":"1264","status":"","submitted":10390,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.45086617747182084,"acs":5960,"articleLive":2,"columnArticles":69,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","questionId":"2066","status":"","submitted":13219,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.24965204014357922,"acs":3408,"articleLive":2,"columnArticles":65,"formTitle":"[1937]扣分后的最大得分","frequency":1.5124236696,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","questionId":"2067","status":"","submitted":13651,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.35498839907192575,"acs":1224,"articleLive":2,"columnArticles":43,"formTitle":"[1938]查询最大基因差","frequency":1.6808881918,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","questionId":"2068","status":"","submitted":3448,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6342637151106834,"acs":659,"articleLive":2,"columnArticles":17,"formTitle":"[1939]主动请求确认消息的用户","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","questionId":"2092","status":"","submitted":1039,"title":"主动请求确认消息的用户","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.7870216306156406,"acs":473,"articleLive":2,"columnArticles":29,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","questionId":"2071","status":"","submitted":601,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.7646982980917999,"acs":5931,"articleLive":2,"columnArticles":104,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":1.0847265383,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","questionId":"2053","status":"ac","submitted":7756,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.3992405063291139,"acs":3154,"articleLive":2,"columnArticles":74,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","questionId":"2054","status":"ac","submitted":7900,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.411491935483871,"acs":2041,"articleLive":2,"columnArticles":57,"formTitle":"[1943]描述绘画结果","frequency":0.7438514124,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","questionId":"2055","status":"notac","submitted":4960,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.5835211620335587,"acs":2330,"articleLive":2,"columnArticles":66,"formTitle":"[1944]队列中可以看到的人数","frequency":1.0847265383,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","questionId":"1305","status":"","submitted":3993,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.660067205521751,"acs":7268,"articleLive":2,"columnArticles":90,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":0.5506985748,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","questionId":"2076","status":"ac","submitted":11011,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.30668620427656573,"acs":5651,"articleLive":2,"columnArticles":84,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":1.0847265383,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","questionId":"2077","status":"ac","submitted":18426,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5454661232806928,"acs":4283,"articleLive":2,"columnArticles":93,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","questionId":"2078","status":"ac","submitted":7852,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.5172586293146574,"acs":1034,"articleLive":2,"columnArticles":20,"formTitle":"[1948]删除系统中的重复文件夹","frequency":1.055182292,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","questionId":"2079","status":"","submitted":1999,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.5255376344086021,"acs":391,"articleLive":2,"columnArticles":16,"formTitle":"[1949]坚定的友谊","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","questionId":"2097","status":"","submitted":744,"title":"坚定的友谊","titleSlug":"strong-friendship"},{"acceptance":0.5240793201133145,"acs":185,"articleLive":2,"columnArticles":8,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","questionId":"2072","status":"","submitted":353,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.7026647966339411,"acs":501,"articleLive":2,"columnArticles":17,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","questionId":"2098","status":"","submitted":713,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5432886619868114,"acs":7662,"articleLive":2,"columnArticles":86,"formTitle":"[1952]三除数","frequency":0.5233893954,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","questionId":"2083","status":"ac","submitted":14103,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.33245479171242404,"acs":4541,"articleLive":2,"columnArticles":87,"formTitle":"[1953]你可以工作的最大周数","frequency":0.60905819,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","questionId":"2084","status":"ac","submitted":13659,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.4795563288386255,"acs":4410,"articleLive":2,"columnArticles":73,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":0.60905819,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","questionId":"1295","status":"ac","submitted":9196,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.49744152046783624,"acs":2722,"articleLive":2,"columnArticles":44,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.9598334118,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","questionId":"2086","status":"","submitted":5472,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.4046511627906977,"acs":174,"articleLive":2,"columnArticles":13,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":1.8899799896,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","questionId":"2073","status":"","submitted":430,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6090395480225989,"acs":5390,"articleLive":2,"columnArticles":64,"formTitle":"[1957]删除字符使字符串变好","frequency":0.4972098898,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","questionId":"1302","status":"","submitted":8850,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.4261501210653753,"acs":2640,"articleLive":2,"columnArticles":48,"formTitle":"[1958]检查操作是否合法","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","questionId":"2080","status":"","submitted":6195,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.42248677248677247,"acs":1597,"articleLive":2,"columnArticles":32,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","questionId":"2081","status":"","submitted":3780,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.28594905505341,"acs":696,"articleLive":2,"columnArticles":20,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":1.6808881918,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","questionId":"1336","status":"","submitted":2434,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5351207931853094,"acs":7664,"articleLive":2,"columnArticles":73,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":0.5506985748,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","questionId":"2093","status":"","submitted":14322,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.43803403198714674,"acs":5998,"articleLive":2,"columnArticles":82,"formTitle":"[1962]移除石子使总数最小","frequency":1.5124236696,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","questionId":"2094","status":"","submitted":13693,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6195467050962924,"acs":4729,"articleLive":2,"columnArticles":61,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":0.5233893954,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","questionId":"2095","status":"","submitted":7633,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.39052210724365005,"acs":3321,"articleLive":2,"columnArticles":50,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","questionId":"2096","status":"","submitted":8504,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.7639821029082774,"acs":683,"articleLive":2,"columnArticles":17,"formTitle":"[1965]丢失信息的雇员","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","questionId":"2110","status":"","submitted":894,"title":"丢失信息的雇员","titleSlug":"employees-with-missing-information"},{"acceptance":0.7263157894736842,"acs":69,"articleLive":2,"columnArticles":8,"formTitle":"[1966]未排序数组中的可被二分搜索的数","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","questionId":"2111","status":"","submitted":95,"title":"未排序数组中的可被二分搜索的数","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.7824007119813104,"acs":7033,"articleLive":2,"columnArticles":86,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","questionId":"2099","status":"","submitted":8989,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.3632459647564046,"acs":4906,"articleLive":2,"columnArticles":72,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","questionId":"2085","status":"","submitted":13506,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.28294139604329976,"acs":3032,"articleLive":2,"columnArticles":44,"formTitle":"[1969]数组元素的最小非零乘积","frequency":2.1423876129,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","questionId":"2100","status":"","submitted":10716,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.4775938635446104,"acs":2366,"articleLive":2,"columnArticles":53,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":1.790889087,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","questionId":"2101","status":"","submitted":4954,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.49429502852485735,"acs":1213,"articleLive":2,"columnArticles":31,"formTitle":"[1971]寻找图中是否存在路径","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","questionId":"2121","status":"","submitted":2454,"title":"寻找图中是否存在路径","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.4333821376281113,"acs":296,"articleLive":2,"columnArticles":12,"formTitle":"[1972]同一天的第一个电话和最后一个电话","frequency":0.7821409289,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","questionId":"2120","status":"","submitted":683,"title":"同一天的第一个电话和最后一个电话","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.6035502958579881,"acs":102,"articleLive":2,"columnArticles":11,"formTitle":"[1973]值等于子节点值之和的节点数量","frequency":0.0,"frontendQuestionId":"1973","leaf":true,"level":2,"nodeType":"def","questionId":"2126","status":"","submitted":169,"title":"值等于子节点值之和的节点数量","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.7337007874015748,"acs":4659,"articleLive":2,"columnArticles":67,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":1.055182292,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","questionId":"2088","status":"ac","submitted":6350,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.38835763805880946,"acs":3249,"articleLive":2,"columnArticles":48,"formTitle":"[1975]最大方阵和","frequency":1.5124236696,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","questionId":"2089","status":"ac","submitted":8366,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.3025210084033613,"acs":2412,"articleLive":2,"columnArticles":55,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","questionId":"2090","status":"notac","submitted":7973,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.2558850504432895,"acs":837,"articleLive":2,"columnArticles":17,"formTitle":"[1977]划分数字的方案数","frequency":1.4629331154,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","questionId":"2091","status":"","submitted":3271,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.5384615384615384,"acs":525,"articleLive":2,"columnArticles":15,"formTitle":"[1978]上级经理已离职的公司员工","frequency":0.5506985748,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","questionId":"2127","status":"","submitted":975,"title":"上级经理已离职的公司员工","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.7917056174046061,"acs":9316,"articleLive":2,"columnArticles":118,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","questionId":"2106","status":"ac","submitted":11767,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.5855349447255013,"acs":6250,"articleLive":2,"columnArticles":112,"formTitle":"[1980]找出不同的二进制字符串","frequency":1.0847265383,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","questionId":"2107","status":"ac","submitted":10674,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.30426295573326617,"acs":4832,"articleLive":2,"columnArticles":86,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":1.8899799896,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","questionId":"2108","status":"","submitted":15881,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.46818416968442833,"acs":905,"articleLive":2,"columnArticles":19,"formTitle":"[1982]从子集的和还原数组","frequency":1.5124236696,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","questionId":"2109","status":"","submitted":1933,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.5370370370370371,"acs":87,"articleLive":2,"columnArticles":4,"formTitle":"[1983]Widest Pair of Indices With Equal Range Sum","frequency":0.0,"frontendQuestionId":"1983","leaf":true,"level":2,"nodeType":"def","questionId":"519","status":"","submitted":162,"title":"Widest Pair of Indices With Equal Range Sum","titleSlug":"widest-pair-of-indices-with-equal-range-sum"},{"acceptance":0.5766468114926419,"acs":6583,"articleLive":2,"columnArticles":73,"formTitle":"[1984]学生分数的最小差值","frequency":0.0,"frontendQuestionId":"1984","leaf":true,"level":1,"nodeType":"def","questionId":"2112","status":"ac","submitted":11416,"title":"学生分数的最小差值","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores"},{"acceptance":0.4146153846153846,"acs":6468,"articleLive":2,"columnArticles":93,"formTitle":"[1985]找出数组中的第 K 大整数","frequency":0.0,"frontendQuestionId":"1985","leaf":true,"level":2,"nodeType":"def","questionId":"2113","status":"ac","submitted":15600,"title":"找出数组中的第 K 大整数","titleSlug":"find-the-kth-largest-integer-in-the-array"},{"acceptance":0.2859701920321009,"acs":3991,"articleLive":2,"columnArticles":80,"formTitle":"[1986]完成任务的最少工作时间段","frequency":0.5792230415,"frontendQuestionId":"1986","leaf":true,"level":2,"nodeType":"def","questionId":"2114","status":"notac","submitted":13956,"title":"完成任务的最少工作时间段","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks"},{"acceptance":0.4732170186715641,"acs":1546,"articleLive":2,"columnArticles":27,"formTitle":"[1987]不同的好子序列数目","frequency":0.9111856876,"frontendQuestionId":"1987","leaf":true,"level":3,"nodeType":"def","questionId":"2115","status":"","submitted":3267,"title":"不同的好子序列数目","titleSlug":"number-of-unique-good-subsequences"},{"acceptance":0.67008547008547,"acs":392,"articleLive":2,"columnArticles":10,"formTitle":"[1988]找出每所学校的最低分数要求","frequency":1.3299352933,"frontendQuestionId":"1988","leaf":true,"level":2,"nodeType":"def","questionId":"2136","status":"","submitted":585,"title":"找出每所学校的最低分数要求","titleSlug":"find-cutoff-score-for-each-school"},{"acceptance":0.5949367088607594,"acs":94,"articleLive":2,"columnArticles":3,"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":"","submitted":158,"title":"Maximum Number of People That Can Be Caught in Tag","titleSlug":"maximum-number-of-people-that-can-be-caught-in-tag"},{"acceptance":0.5458768873403019,"acs":470,"articleLive":2,"columnArticles":12,"formTitle":"[1990]统计实验的数量","frequency":0.5506985748,"frontendQuestionId":"1990","leaf":true,"level":1,"nodeType":"def","questionId":"2143","status":"","submitted":861,"title":"统计实验的数量","titleSlug":"count-the-number-of-experiments"},{"acceptance":0.6574837310195227,"acs":6062,"articleLive":2,"columnArticles":85,"formTitle":"[1991]找到数组的中间位置","frequency":0.4972098898,"frontendQuestionId":"1991","leaf":true,"level":1,"nodeType":"def","questionId":"2102","status":"ac","submitted":9220,"title":"找到数组的中间位置","titleSlug":"find-the-middle-index-in-array"},{"acceptance":0.5939971243709562,"acs":3305,"articleLive":2,"columnArticles":68,"formTitle":"[1992]找到所有的农场组","frequency":0.0,"frontendQuestionId":"1992","leaf":true,"level":2,"nodeType":"def","questionId":"2103","status":"ac","submitted":5564,"title":"找到所有的农场组","titleSlug":"find-all-groups-of-farmland"},{"acceptance":0.3860796000769083,"acs":2008,"articleLive":2,"columnArticles":46,"formTitle":"[1993]树上的操作","frequency":0.0,"frontendQuestionId":"1993","leaf":true,"level":2,"nodeType":"def","questionId":"2104","status":"","submitted":5201,"title":"树上的操作","titleSlug":"operations-on-tree"},{"acceptance":0.37298946200776484,"acs":1345,"articleLive":2,"columnArticles":38,"formTitle":"[1994]好子集的数目","frequency":0.0,"frontendQuestionId":"1994","leaf":true,"level":3,"nodeType":"def","questionId":"2105","status":"notac","submitted":3606,"title":"好子集的数目","titleSlug":"the-number-of-good-subsets"},{"acceptance":0.565825586542718,"acs":6391,"articleLive":2,"columnArticles":50,"formTitle":"[1995]统计特殊四元组","frequency":0.0,"frontendQuestionId":"1995","leaf":true,"level":1,"nodeType":"def","questionId":"2122","status":"ac","submitted":11295,"title":"统计特殊四元组","titleSlug":"count-special-quadruplets"},{"acceptance":0.25569560047562423,"acs":5376,"articleLive":2,"columnArticles":101,"formTitle":"[1996]游戏中弱角色的数量","frequency":0.0,"frontendQuestionId":"1996","leaf":true,"level":2,"nodeType":"def","questionId":"2123","status":"ac","submitted":21025,"title":"游戏中弱角色的数量","titleSlug":"the-number-of-weak-characters-in-the-game"},{"acceptance":0.340771390571893,"acs":2306,"articleLive":2,"columnArticles":38,"formTitle":"[1997]访问完所有房间的第一天","frequency":1.3299352933,"frontendQuestionId":"1997","leaf":true,"level":2,"nodeType":"def","questionId":"2124","status":"notac","submitted":6767,"title":"访问完所有房间的第一天","titleSlug":"first-day-where-you-have-been-in-all-the-rooms"},{"acceptance":0.4227720393946673,"acs":1760,"articleLive":2,"columnArticles":34,"formTitle":"[1998]数组的最大公因数排序","frequency":0.8226322903,"frontendQuestionId":"1998","leaf":true,"level":3,"nodeType":"def","questionId":"2125","status":"","submitted":4163,"title":"数组的最大公因数排序","titleSlug":"gcd-sort-of-an-array"},{"acceptance":0.6126760563380281,"acs":87,"articleLive":2,"columnArticles":9,"formTitle":"[1999]最小的仅由两个数组成的倍数","frequency":0.0,"frontendQuestionId":"1999","leaf":true,"level":2,"nodeType":"def","questionId":"2141","status":"","submitted":142,"title":"最小的仅由两个数组成的倍数","titleSlug":"smallest-greater-multiple-made-of-two-digits"},{"acceptance":0.7703471826977804,"acs":8121,"articleLive":2,"columnArticles":121,"formTitle":"[2000]反转单词前缀","frequency":0.4972098898,"frontendQuestionId":"2000","leaf":true,"level":1,"nodeType":"def","questionId":"2128","status":"ac","submitted":10542,"title":"反转单词前缀","titleSlug":"reverse-prefix-of-word"},{"acceptance":0.3626973762317464,"acs":6110,"articleLive":2,"columnArticles":133,"formTitle":"[2001]可互换矩形的组数","frequency":0.6731005563,"frontendQuestionId":"2001","leaf":true,"level":2,"nodeType":"def","questionId":"2129","status":"ac","submitted":16846,"title":"可互换矩形的组数","titleSlug":"number-of-pairs-of-interchangeable-rectangles"},{"acceptance":0.5817992874109263,"acs":3919,"articleLive":2,"columnArticles":90,"formTitle":"[2002]两个回文子序列长度的最大乘积","frequency":0.0,"frontendQuestionId":"2002","leaf":true,"level":2,"nodeType":"def","questionId":"2130","status":"","submitted":6736,"title":"两个回文子序列长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences"},{"acceptance":0.3952987267384917,"acs":2018,"articleLive":2,"columnArticles":43,"formTitle":"[2003]每棵子树内缺失的最小基因值","frequency":0.0,"frontendQuestionId":"2003","leaf":true,"level":3,"nodeType":"def","questionId":"2131","status":"","submitted":5105,"title":"每棵子树内缺失的最小基因值","titleSlug":"smallest-missing-genetic-value-in-each-subtree"},{"acceptance":0.40524193548387094,"acs":201,"articleLive":2,"columnArticles":8,"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":"","submitted":496,"title":"The Number of Seniors and Juniors to Join the Company","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company"},{"acceptance":0.6181818181818182,"acs":34,"articleLive":2,"columnArticles":3,"formTitle":"[2005]斐波那契树的移除子树游戏","frequency":0.0,"frontendQuestionId":"2005","leaf":true,"level":3,"nodeType":"def","questionId":"2153","status":"","submitted":55,"title":"斐波那契树的移除子树游戏","titleSlug":"subtree-removal-game-with-fibonacci-tree"},{"acceptance":0.8486463133640553,"acs":5893,"articleLive":2,"columnArticles":80,"formTitle":"[2006]差的绝对值为 K 的数对数目","frequency":0.0,"frontendQuestionId":"2006","leaf":true,"level":1,"nodeType":"def","questionId":"2116","status":"","submitted":6944,"title":"差的绝对值为 K 的数对数目","titleSlug":"count-number-of-pairs-with-absolute-difference-k"},{"acceptance":0.32004359277086547,"acs":3524,"articleLive":2,"columnArticles":68,"formTitle":"[2007]从双倍数组中还原原数组","frequency":0.5233893954,"frontendQuestionId":"2007","leaf":true,"level":2,"nodeType":"def","questionId":"2117","status":"","submitted":11011,"title":"从双倍数组中还原原数组","titleSlug":"find-original-array-from-doubled-array"},{"acceptance":0.42709510737929923,"acs":2645,"articleLive":2,"columnArticles":47,"formTitle":"[2008]出租车的最大盈利","frequency":1.7452190502,"frontendQuestionId":"2008","leaf":true,"level":2,"nodeType":"def","questionId":"2118","status":"","submitted":6193,"title":"出租车的最大盈利","titleSlug":"maximum-earnings-from-taxi"},{"acceptance":0.41495715398597766,"acs":1598,"articleLive":2,"columnArticles":44,"formTitle":"[2009]使数组连续的最少操作数","frequency":0.0,"frontendQuestionId":"2009","leaf":true,"level":3,"nodeType":"def","questionId":"2119","status":"","submitted":3851,"title":"使数组连续的最少操作数","titleSlug":"minimum-number-of-operations-to-make-array-continuous"},{"acceptance":0.6389891696750902,"acs":177,"articleLive":2,"columnArticles":9,"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":"","submitted":277,"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.8773692191053829,"acs":9258,"articleLive":2,"columnArticles":96,"formTitle":"[2011]执行操作后的变量值","frequency":1.4161956376,"frontendQuestionId":"2011","leaf":true,"level":1,"nodeType":"def","questionId":"2137","status":"ac","submitted":10552,"title":"执行操作后的变量值","titleSlug":"final-value-of-variable-after-performing-operations"},{"acceptance":0.3646735172748604,"acs":4507,"articleLive":2,"columnArticles":81,"formTitle":"[2012]数组美丽值求和","frequency":0.0,"frontendQuestionId":"2012","leaf":true,"level":2,"nodeType":"def","questionId":"2138","status":"ac","submitted":12359,"title":"数组美丽值求和","titleSlug":"sum-of-beauty-in-the-array"},{"acceptance":0.3436422293914785,"acs":3089,"articleLive":2,"columnArticles":56,"formTitle":"[2013]检测正方形","frequency":0.5792230415,"frontendQuestionId":"2013","leaf":true,"level":2,"nodeType":"def","questionId":"2139","status":"ac","submitted":8989,"title":"检测正方形","titleSlug":"detect-squares"},{"acceptance":0.5321500334896182,"acs":1589,"articleLive":2,"columnArticles":26,"formTitle":"[2014]重复 K 次的最长子序列","frequency":0.0,"frontendQuestionId":"2014","leaf":true,"level":3,"nodeType":"def","questionId":"2140","status":"","submitted":2986,"title":"重复 K 次的最长子序列","titleSlug":"longest-subsequence-repeated-k-times"},{"acceptance":0.6842105263157895,"acs":78,"articleLive":2,"columnArticles":5,"formTitle":"[2015]Average Height of Buildings in Each Segment","frequency":0.0,"frontendQuestionId":"2015","leaf":true,"level":2,"nodeType":"def","questionId":"2142","status":"","submitted":114,"title":"Average Height of Buildings in Each Segment","titleSlug":"average-height-of-buildings-in-each-segment"},{"acceptance":0.5565618591934381,"acs":6514,"articleLive":2,"columnArticles":87,"formTitle":"[2016]增量元素之间的最大差值","frequency":0.5233893954,"frontendQuestionId":"2016","leaf":true,"level":1,"nodeType":"def","questionId":"2144","status":"ac","submitted":11704,"title":"增量元素之间的最大差值","titleSlug":"maximum-difference-between-increasing-elements"},{"acceptance":0.35643922277451423,"acs":3944,"articleLive":2,"columnArticles":99,"formTitle":"[2017]网格游戏","frequency":0.0,"frontendQuestionId":"2017","leaf":true,"level":2,"nodeType":"def","questionId":"2145","status":"ac","submitted":11065,"title":"网格游戏","titleSlug":"grid-game"},{"acceptance":0.4108408350890634,"acs":2145,"articleLive":2,"columnArticles":53,"formTitle":"[2018]判断单词是否能放入填字游戏内","frequency":0.6403107335,"frontendQuestionId":"2018","leaf":true,"level":2,"nodeType":"def","questionId":"2146","status":"","submitted":5221,"title":"判断单词是否能放入填字游戏内","titleSlug":"check-if-word-can-be-placed-in-crossword"},{"acceptance":0.35857850276725894,"acs":1231,"articleLive":2,"columnArticles":35,"formTitle":"[2019]解出数学表达式的学生分数","frequency":0.6403107335,"frontendQuestionId":"2019","leaf":true,"level":3,"nodeType":"def","questionId":"2147","status":"","submitted":3433,"title":"解出数学表达式的学生分数","titleSlug":"the-score-of-students-solving-math-expression"},{"acceptance":0.762402088772846,"acs":292,"articleLive":2,"columnArticles":9,"formTitle":"[2020]Number of Accounts That Did Not Stream","frequency":0.0,"frontendQuestionId":"2020","leaf":true,"level":2,"nodeType":"def","questionId":"2167","status":"","submitted":383,"title":"Number of Accounts That Did Not Stream","titleSlug":"number-of-accounts-that-did-not-stream"},{"acceptance":0.6633663366336634,"acs":134,"articleLive":2,"columnArticles":9,"formTitle":"[2021]街上最亮的位置","frequency":0.0,"frontendQuestionId":"2021","leaf":true,"level":2,"nodeType":"def","questionId":"2075","status":"","submitted":202,"title":"街上最亮的位置","titleSlug":"brightest-position-on-street"},{"acceptance":0.6519251584969847,"acs":4216,"articleLive":2,"columnArticles":55,"formTitle":"[2022]将一维数组转变成二维数组","frequency":0.0,"frontendQuestionId":"2022","leaf":true,"level":1,"nodeType":"def","questionId":"2132","status":"ac","submitted":6467,"title":"将一维数组转变成二维数组","titleSlug":"convert-1d-array-into-2d-array"},{"acceptance":0.7520794824399261,"acs":3255,"articleLive":2,"columnArticles":55,"formTitle":"[2023]连接后等于目标字符串的字符串对","frequency":0.0,"frontendQuestionId":"2023","leaf":true,"level":2,"nodeType":"def","questionId":"2133","status":"ac","submitted":4328,"title":"连接后等于目标字符串的字符串对","titleSlug":"number-of-pairs-of-strings-with-concatenation-equal-to-target"},{"acceptance":0.49207731150966394,"acs":2826,"articleLive":2,"columnArticles":71,"formTitle":"[2024]考试的最大困扰度","frequency":0.5233893954,"frontendQuestionId":"2024","leaf":true,"level":2,"nodeType":"def","questionId":"2134","status":"","submitted":5743,"title":"考试的最大困扰度","titleSlug":"maximize-the-confusion-of-an-exam"},{"acceptance":0.26430622009569377,"acs":1381,"articleLive":2,"columnArticles":45,"formTitle":"[2025]分割数组的最多方案数","frequency":0.7438514124,"frontendQuestionId":"2025","leaf":true,"level":3,"nodeType":"def","questionId":"2135","status":"","submitted":5225,"title":"分割数组的最多方案数","titleSlug":"maximum-number-of-ways-to-partition-an-array"},{"acceptance":0.8602825745682888,"acs":548,"articleLive":2,"columnArticles":15,"formTitle":"[2026]低质量的问题","frequency":1.4470622855,"frontendQuestionId":"2026","leaf":true,"level":1,"nodeType":"def","questionId":"2172","status":"","submitted":637,"title":"低质量的问题","titleSlug":"low-quality-problems"},{"acceptance":0.5621314697532213,"acs":5148,"articleLive":2,"columnArticles":59,"formTitle":"[2027]转换字符串的最少操作次数","frequency":0.0,"frontendQuestionId":"2027","leaf":true,"level":1,"nodeType":"def","questionId":"2154","status":"ac","submitted":9158,"title":"转换字符串的最少操作次数","titleSlug":"minimum-moves-to-convert-string"},{"acceptance":0.4289190833502332,"acs":4230,"articleLive":2,"columnArticles":63,"formTitle":"[2028]找出缺失的观测数据","frequency":0.0,"frontendQuestionId":"2028","leaf":true,"level":2,"nodeType":"def","questionId":"2155","status":"ac","submitted":9862,"title":"找出缺失的观测数据","titleSlug":"find-missing-observations"},{"acceptance":0.23661626481405804,"acs":2316,"articleLive":2,"columnArticles":68,"formTitle":"[2029]石子游戏 IX","frequency":0.6731005563,"frontendQuestionId":"2029","leaf":true,"level":2,"nodeType":"def","questionId":"2156","status":"notac","submitted":9788,"title":"石子游戏 IX","titleSlug":"stone-game-ix"},{"acceptance":0.35133703997881915,"acs":1327,"articleLive":2,"columnArticles":41,"formTitle":"[2030]含特定字母的最小子序列","frequency":0.6731005563,"frontendQuestionId":"2030","leaf":true,"level":3,"nodeType":"def","questionId":"2157","status":"","submitted":3777,"title":"含特定字母的最小子序列","titleSlug":"smallest-k-length-subsequence-with-occurrences-of-a-letter"},{"acceptance":0.547486033519553,"acs":98,"articleLive":2,"columnArticles":5,"formTitle":"[2031]1 比 0 多的子数组个数","frequency":2.128636021,"frontendQuestionId":"2031","leaf":true,"level":2,"nodeType":"def","questionId":"510","status":"","submitted":179,"title":"1 比 0 多的子数组个数","titleSlug":"count-subarrays-with-more-ones-than-zeros"},{"acceptance":0.6632322637621431,"acs":6759,"articleLive":2,"columnArticles":116,"formTitle":"[2032]至少在两个数组中出现的值","frequency":0.0,"frontendQuestionId":"2032","leaf":true,"level":1,"nodeType":"def","questionId":"2159","status":"ac","submitted":10191,"title":"至少在两个数组中出现的值","titleSlug":"two-out-of-three"},{"acceptance":0.3972286374133949,"acs":4472,"articleLive":2,"columnArticles":92,"formTitle":"[2033]获取单值网格的最小操作数","frequency":1.0847265383,"frontendQuestionId":"2033","leaf":true,"level":2,"nodeType":"def","questionId":"2160","status":"ac","submitted":11258,"title":"获取单值网格的最小操作数","titleSlug":"minimum-operations-to-make-a-uni-value-grid"},{"acceptance":0.3051324940575755,"acs":3466,"articleLive":2,"columnArticles":71,"formTitle":"[2034]股票价格波动","frequency":0.0,"frontendQuestionId":"2034","leaf":true,"level":2,"nodeType":"def","questionId":"2161","status":"ac","submitted":11359,"title":"股票价格波动","titleSlug":"stock-price-fluctuation"},{"acceptance":0.3204208512673362,"acs":2010,"articleLive":2,"columnArticles":47,"formTitle":"[2035]将数组分成两个数组并最小化数组和的差","frequency":0.6403107335,"frontendQuestionId":"2035","leaf":true,"level":3,"nodeType":"def","questionId":"2162","status":"","submitted":6273,"title":"将数组分成两个数组并最小化数组和的差","titleSlug":"partition-array-into-two-arrays-to-minimize-sum-difference"},{"acceptance":0.4152046783625731,"acs":71,"articleLive":2,"columnArticles":7,"formTitle":"[2036]最大交替子数组和","frequency":0.0,"frontendQuestionId":"2036","leaf":true,"level":2,"nodeType":"def","questionId":"512","status":"","submitted":171,"title":"最大交替子数组和","titleSlug":"maximum-alternating-subarray-sum"},{"acceptance":0.83109243697479,"acs":3956,"articleLive":2,"columnArticles":56,"formTitle":"[2037]使每位学生都有座位的最少移动次数","frequency":0.0,"frontendQuestionId":"2037","leaf":true,"level":1,"nodeType":"def","questionId":"2148","status":"ac","submitted":4760,"title":"使每位学生都有座位的最少移动次数","titleSlug":"minimum-number-of-moves-to-seat-everyone"},{"acceptance":0.5084937712344281,"acs":3143,"articleLive":2,"columnArticles":66,"formTitle":"[2038]如果相邻两个颜色均相同则删除当前颜色","frequency":0.0,"frontendQuestionId":"2038","leaf":true,"level":2,"nodeType":"def","questionId":"2149","status":"ac","submitted":6181,"title":"如果相邻两个颜色均相同则删除当前颜色","titleSlug":"remove-colored-pieces-if-both-neighbors-are-the-same-color"},{"acceptance":0.36475639350382677,"acs":1954,"articleLive":2,"columnArticles":45,"formTitle":"[2039]网络空闲的时刻","frequency":0.60905819,"frontendQuestionId":"2039","leaf":true,"level":2,"nodeType":"def","questionId":"2151","status":"ac","submitted":5357,"title":"网络空闲的时刻","titleSlug":"the-time-when-the-network-becomes-idle"},{"acceptance":0.32393186260821,"acs":1160,"articleLive":2,"columnArticles":21,"formTitle":"[2040]两个有序数组的第 K 小乘积","frequency":0.0,"frontendQuestionId":"2040","leaf":true,"level":3,"nodeType":"def","questionId":"2150","status":"","submitted":3581,"title":"两个有序数组的第 K 小乘积","titleSlug":"kth-smallest-product-of-two-sorted-arrays"},{"acceptance":0.6355353075170843,"acs":279,"articleLive":2,"columnArticles":13,"formTitle":"[2041]面试中被录取的候选人","frequency":0.0,"frontendQuestionId":"2041","leaf":true,"level":2,"nodeType":"def","questionId":"2185","status":"","submitted":439,"title":"面试中被录取的候选人","titleSlug":"accepted-candidates-from-the-interviews"},{"acceptance":0.668242640499554,"acs":7491,"articleLive":2,"columnArticles":120,"formTitle":"[2042]检查句子中的数字是否递增","frequency":1.4161956376,"frontendQuestionId":"2042","leaf":true,"level":1,"nodeType":"def","questionId":"2168","status":"ac","submitted":11210,"title":"检查句子中的数字是否递增","titleSlug":"check-if-numbers-are-ascending-in-a-sentence"},{"acceptance":0.5925603864734299,"acs":6133,"articleLive":2,"columnArticles":72,"formTitle":"[2043]简易银行系统","frequency":0.5506985748,"frontendQuestionId":"2043","leaf":true,"level":2,"nodeType":"def","questionId":"2169","status":"ac","submitted":10350,"title":"简易银行系统","titleSlug":"simple-bank-system"},{"acceptance":0.7417151162790697,"acs":5103,"articleLive":2,"columnArticles":98,"formTitle":"[2044]统计按位或能得到最大值的子集数目","frequency":0.4972098898,"frontendQuestionId":"2044","leaf":true,"level":2,"nodeType":"def","questionId":"2170","status":"ac","submitted":6880,"title":"统计按位或能得到最大值的子集数目","titleSlug":"count-number-of-maximum-bitwise-or-subsets"},{"acceptance":0.33228346456692914,"acs":2321,"articleLive":2,"columnArticles":61,"formTitle":"[2045]到达目的地的第二短时间","frequency":0.60905819,"frontendQuestionId":"2045","leaf":true,"level":3,"nodeType":"def","questionId":"2171","status":"ac","submitted":6985,"title":"到达目的地的第二短时间","titleSlug":"second-minimum-time-to-reach-destination"},{"acceptance":0.7136929460580913,"acs":172,"articleLive":2,"columnArticles":18,"formTitle":"[2046]给按照绝对值排序的链表排序","frequency":0.0,"frontendQuestionId":"2046","leaf":true,"level":2,"nodeType":"def","questionId":"1992","status":"","submitted":241,"title":"给按照绝对值排序的链表排序","titleSlug":"sort-linked-list-already-sorted-using-absolute-values"},{"acceptance":0.28717504332755633,"acs":4971,"articleLive":2,"columnArticles":106,"formTitle":"[2047]句子中的有效单词数","frequency":0.5233893954,"frontendQuestionId":"2047","leaf":true,"level":1,"nodeType":"def","questionId":"2173","status":"ac","submitted":17310,"title":"句子中的有效单词数","titleSlug":"number-of-valid-words-in-a-sentence"},{"acceptance":0.4152542372881356,"acs":4067,"articleLive":2,"columnArticles":93,"formTitle":"[2048]下一个更大的数值平衡数","frequency":0.0,"frontendQuestionId":"2048","leaf":true,"level":2,"nodeType":"def","questionId":"2174","status":"ac","submitted":9794,"title":"下一个更大的数值平衡数","titleSlug":"next-greater-numerically-balanced-number"},{"acceptance":0.3960546282245827,"acs":2871,"articleLive":2,"columnArticles":95,"formTitle":"[2049]统计最高分的节点数目","frequency":0.0,"frontendQuestionId":"2049","leaf":true,"level":2,"nodeType":"def","questionId":"2175","status":"","submitted":7249,"title":"统计最高分的节点数目","titleSlug":"count-nodes-with-the-highest-score"},{"acceptance":0.5603517186250999,"acs":2103,"articleLive":2,"columnArticles":70,"formTitle":"[2050]并行课程 III","frequency":0.5233893954,"frontendQuestionId":"2050","leaf":true,"level":3,"nodeType":"def","questionId":"2176","status":"","submitted":3753,"title":"并行课程 III","titleSlug":"parallel-courses-iii"},{"acceptance":0.6709677419354839,"acs":208,"articleLive":2,"columnArticles":8,"formTitle":"[2051]The Category of Each Member in the Store","frequency":0.0,"frontendQuestionId":"2051","leaf":true,"level":2,"nodeType":"def","questionId":"2194","status":"","submitted":310,"title":"The Category of Each Member in the Store","titleSlug":"the-category-of-each-member-in-the-store"},{"acceptance":0.5176470588235295,"acs":44,"articleLive":2,"columnArticles":6,"formTitle":"[2052]将句子分隔成行的最低成本","frequency":0.0,"frontendQuestionId":"2052","leaf":true,"level":2,"nodeType":"def","questionId":"2082","status":"","submitted":85,"title":"将句子分隔成行的最低成本","titleSlug":"minimum-cost-to-separate-sentence-into-rows"},{"acceptance":0.7505274261603375,"acs":4269,"articleLive":2,"columnArticles":66,"formTitle":"[2053]数组中第 K 个独一无二的字符串","frequency":0.0,"frontendQuestionId":"2053","leaf":true,"level":1,"nodeType":"def","questionId":"2163","status":"","submitted":5688,"title":"数组中第 K 个独一无二的字符串","titleSlug":"kth-distinct-string-in-an-array"},{"acceptance":0.3328615542974781,"acs":2587,"articleLive":2,"columnArticles":60,"formTitle":"[2054]两个最好的不重叠活动","frequency":0.0,"frontendQuestionId":"2054","leaf":true,"level":2,"nodeType":"def","questionId":"2164","status":"","submitted":7772,"title":"两个最好的不重叠活动","titleSlug":"two-best-non-overlapping-events"},{"acceptance":0.38302020560085076,"acs":2161,"articleLive":2,"columnArticles":69,"formTitle":"[2055]蜡烛之间的盘子","frequency":1.055182292,"frontendQuestionId":"2055","leaf":true,"level":2,"nodeType":"def","questionId":"2165","status":"","submitted":5642,"title":"蜡烛之间的盘子","titleSlug":"plates-between-candles"},{"acceptance":0.6124401913875598,"acs":640,"articleLive":2,"columnArticles":14,"formTitle":"[2056]棋盘上有效移动组合的数目","frequency":0.0,"frontendQuestionId":"2056","leaf":true,"level":3,"nodeType":"def","questionId":"2166","status":"","submitted":1045,"title":"棋盘上有效移动组合的数目","titleSlug":"number-of-valid-move-combinations-on-chessboard"},{"acceptance":0.7740544536158679,"acs":6283,"articleLive":2,"columnArticles":42,"formTitle":"[2057]值相等的最小索引","frequency":0.0,"frontendQuestionId":"2057","leaf":true,"level":1,"nodeType":"def","questionId":"2181","status":"","submitted":8117,"title":"值相等的最小索引","titleSlug":"smallest-index-with-equal-value"},{"acceptance":0.5717909131010146,"acs":5185,"articleLive":2,"columnArticles":74,"formTitle":"[2058]找出临界点之间的最小和最大距离","frequency":0.0,"frontendQuestionId":"2058","leaf":true,"level":2,"nodeType":"def","questionId":"2182","status":"","submitted":9068,"title":"找出临界点之间的最小和最大距离","titleSlug":"find-the-minimum-and-maximum-number-of-nodes-between-critical-points"},{"acceptance":0.42623473181094,"acs":4013,"articleLive":2,"columnArticles":93,"formTitle":"[2059]转化数字的最小运算数","frequency":0.0,"frontendQuestionId":"2059","leaf":true,"level":2,"nodeType":"def","questionId":"2183","status":"","submitted":9415,"title":"转化数字的最小运算数","titleSlug":"minimum-operations-to-convert-number"},{"acceptance":0.3632683106367317,"acs":987,"articleLive":2,"columnArticles":21,"formTitle":"[2060]同源字符串检测","frequency":0.0,"frontendQuestionId":"2060","leaf":true,"level":3,"nodeType":"def","questionId":"2184","status":"","submitted":2717,"title":"同源字符串检测","titleSlug":"check-if-an-original-string-exists-given-two-encoded-strings"},{"acceptance":0.5238095238095238,"acs":55,"articleLive":2,"columnArticles":5,"formTitle":"[2061]扫地机器人清扫过的空间个数","frequency":0.0,"frontendQuestionId":"2061","leaf":true,"level":2,"nodeType":"def","questionId":"2203","status":"","submitted":105,"title":"扫地机器人清扫过的空间个数","titleSlug":"number-of-spaces-cleaning-robot-cleaned"},{"acceptance":0.6064493758668515,"acs":5247,"articleLive":2,"columnArticles":94,"formTitle":"[2062]统计字符串中的元音子字符串","frequency":0.5233893954,"frontendQuestionId":"2062","leaf":true,"level":1,"nodeType":"def","questionId":"2186","status":"ac","submitted":8652,"title":"统计字符串中的元音子字符串","titleSlug":"count-vowel-substrings-of-a-string"},{"acceptance":0.48505826698973115,"acs":4204,"articleLive":2,"columnArticles":100,"formTitle":"[2063]所有子字符串中的元音","frequency":0.5233893954,"frontendQuestionId":"2063","leaf":true,"level":2,"nodeType":"def","questionId":"2187","status":"ac","submitted":8667,"title":"所有子字符串中的元音","titleSlug":"vowels-of-all-substrings"},{"acceptance":0.4138820638820639,"acs":3369,"articleLive":2,"columnArticles":72,"formTitle":"[2064]分配给商店的最多商品的最小值","frequency":0.0,"frontendQuestionId":"2064","leaf":true,"level":2,"nodeType":"def","questionId":"2188","status":"notac","submitted":8140,"title":"分配给商店的最多商品的最小值","titleSlug":"minimized-maximum-of-products-distributed-to-any-store"},{"acceptance":0.5344551282051282,"acs":2001,"articleLive":2,"columnArticles":57,"formTitle":"[2065]最大化一张图中的路径价值","frequency":0.0,"frontendQuestionId":"2065","leaf":true,"level":3,"nodeType":"def","questionId":"2189","status":"ac","submitted":3744,"title":"最大化一张图中的路径价值","titleSlug":"maximum-path-quality-of-a-graph"},{"acceptance":0.8281938325991189,"acs":188,"articleLive":2,"columnArticles":10,"formTitle":"[2066]账户余额","frequency":0.0,"frontendQuestionId":"2066","leaf":true,"level":2,"nodeType":"def","questionId":"2208","status":"","submitted":227,"title":"账户余额","titleSlug":"account-balance"},{"acceptance":0.4158415841584158,"acs":42,"articleLive":2,"columnArticles":4,"formTitle":"[2067]Number of Equal Count Substrings","frequency":0.0,"frontendQuestionId":"2067","leaf":true,"level":2,"nodeType":"def","questionId":"2209","status":"","submitted":101,"title":"Number of Equal Count Substrings","titleSlug":"number-of-equal-count-substrings"},{"acceptance":0.7390956382553021,"acs":3694,"articleLive":2,"columnArticles":67,"formTitle":"[2068]检查两个字符串是否几乎相等","frequency":0.0,"frontendQuestionId":"2068","leaf":true,"level":1,"nodeType":"def","questionId":"2177","status":"ac","submitted":4998,"title":"检查两个字符串是否几乎相等","titleSlug":"check-whether-two-strings-are-almost-equivalent"},{"acceptance":0.1905100268435181,"acs":2413,"articleLive":2,"columnArticles":76,"formTitle":"[2069]模拟行走机器人 II","frequency":0.0,"frontendQuestionId":"2069","leaf":true,"level":2,"nodeType":"def","questionId":"2178","status":"notac","submitted":12666,"title":"模拟行走机器人 II","titleSlug":"walking-robot-simulation-ii"},{"acceptance":0.4264089002370965,"acs":2338,"articleLive":2,"columnArticles":79,"formTitle":"[2070]每一个查询的最大美丽值","frequency":0.0,"frontendQuestionId":"2070","leaf":true,"level":2,"nodeType":"def","questionId":"2179","status":"","submitted":5483,"title":"每一个查询的最大美丽值","titleSlug":"most-beautiful-item-for-each-query"},{"acceptance":0.3625201938610662,"acs":1122,"articleLive":2,"columnArticles":28,"formTitle":"[2071]你可以安排的最多任务数目","frequency":0.5233893954,"frontendQuestionId":"2071","leaf":true,"level":3,"nodeType":"def","questionId":"2180","status":"","submitted":3095,"title":"你可以安排的最多任务数目","titleSlug":"maximum-number-of-tasks-you-can-assign"},{"acceptance":0.6985915492957746,"acs":248,"articleLive":2,"columnArticles":6,"formTitle":"[2072]赢得比赛的大学","frequency":0.0,"frontendQuestionId":"2072","leaf":true,"level":1,"nodeType":"def","questionId":"2214","status":"","submitted":355,"title":"赢得比赛的大学","titleSlug":"the-winner-university"},{"acceptance":0.6167858192145725,"acs":6298,"articleLive":2,"columnArticles":94,"formTitle":"[2073]买票需要的时间","frequency":0.0,"frontendQuestionId":"2073","leaf":true,"level":1,"nodeType":"def","questionId":"2195","status":"","submitted":10211,"title":"买票需要的时间","titleSlug":"time-needed-to-buy-tickets"},{"acceptance":0.41595942868971225,"acs":4019,"articleLive":2,"columnArticles":115,"formTitle":"[2074]反转偶数长度组的节点","frequency":1.055182292,"frontendQuestionId":"2074","leaf":true,"level":2,"nodeType":"def","questionId":"2196","status":"","submitted":9662,"title":"反转偶数长度组的节点","titleSlug":"reverse-nodes-in-even-length-groups"},{"acceptance":0.45872198245858276,"acs":3295,"articleLive":2,"columnArticles":65,"formTitle":"[2075]解码斜向换位密码","frequency":0.5506985748,"frontendQuestionId":"2075","leaf":true,"level":2,"nodeType":"def","questionId":"2197","status":"","submitted":7183,"title":"解码斜向换位密码","titleSlug":"decode-the-slanted-ciphertext"},{"acceptance":0.49411310557807375,"acs":2560,"articleLive":2,"columnArticles":68,"formTitle":"[2076]处理含限制条件的好友请求","frequency":0.0,"frontendQuestionId":"2076","leaf":true,"level":3,"nodeType":"def","questionId":"2198","status":"","submitted":5181,"title":"处理含限制条件的好友请求","titleSlug":"process-restricted-friend-requests"},{"acceptance":0.64,"acs":48,"articleLive":2,"columnArticles":4,"formTitle":"[2077]Paths in Maze That Lead to Same Room","frequency":0.0,"frontendQuestionId":"2077","leaf":true,"level":2,"nodeType":"def","questionId":"2218","status":"","submitted":75,"title":"Paths in Maze That Lead to Same Room","titleSlug":"paths-in-maze-that-lead-to-same-room"},{"acceptance":0.753045923149016,"acs":6428,"articleLive":2,"columnArticles":84,"formTitle":"[2078]两栋颜色不同且距离最远的房子","frequency":0.4247143878,"frontendQuestionId":"2078","leaf":true,"level":1,"nodeType":"def","questionId":"2199","status":"","submitted":8536,"title":"两栋颜色不同且距离最远的房子","titleSlug":"two-furthest-houses-with-different-colors"},{"acceptance":0.7718035563082134,"acs":5469,"articleLive":2,"columnArticles":102,"formTitle":"[2079]给植物浇水","frequency":0.0,"frontendQuestionId":"2079","leaf":true,"level":2,"nodeType":"def","questionId":"1310","status":"","submitted":7086,"title":"给植物浇水","titleSlug":"watering-plants"},{"acceptance":0.267684755931279,"acs":4908,"articleLive":2,"columnArticles":134,"formTitle":"[2080]区间内查询数字的频率","frequency":0.4720829397,"frontendQuestionId":"2080","leaf":true,"level":2,"nodeType":"def","questionId":"1294","status":"","submitted":18335,"title":"区间内查询数字的频率","titleSlug":"range-frequency-queries"},{"acceptance":0.40391296397878956,"acs":2209,"articleLive":2,"columnArticles":64,"formTitle":"[2081]k 镜像数字的和","frequency":0.0,"frontendQuestionId":"2081","leaf":true,"level":3,"nodeType":"def","questionId":"2202","status":"","submitted":5469,"title":"k 镜像数字的和","titleSlug":"sum-of-k-mirror-numbers"},{"acceptance":0.7587064676616916,"acs":305,"articleLive":2,"columnArticles":9,"formTitle":"[2082]富有客户的数量","frequency":0.0,"frontendQuestionId":"2082","leaf":true,"level":1,"nodeType":"def","questionId":"2223","status":"","submitted":402,"title":"富有客户的数量","titleSlug":"the-number-of-rich-customers"},{"acceptance":0.6642335766423357,"acs":91,"articleLive":2,"columnArticles":8,"formTitle":"[2083]求以相同字母开头和结尾的子串总数","frequency":0.0,"frontendQuestionId":"2083","leaf":true,"level":2,"nodeType":"def","questionId":"2225","status":"","submitted":137,"title":"求以相同字母开头和结尾的子串总数","titleSlug":"substrings-that-begin-and-end-with-the-same-letter"},{"acceptance":0.807909604519774,"acs":143,"articleLive":2,"columnArticles":8,"formTitle":"[2084]为订单类型为 0 的客户删除类型为 1 的订单","frequency":0.0,"frontendQuestionId":"2084","leaf":true,"level":2,"nodeType":"def","questionId":"2224","status":"","submitted":177,"title":"为订单类型为 0 的客户删除类型为 1 的订单","titleSlug":"drop-type-1-orders-for-customers-with-type-0-orders"},{"acceptance":0.7369912937841668,"acs":3640,"articleLive":2,"columnArticles":57,"formTitle":"[2085]统计出现过一次的公共字符串","frequency":0.0,"frontendQuestionId":"2085","leaf":true,"level":1,"nodeType":"def","questionId":"2190","status":"ac","submitted":4939,"title":"统计出现过一次的公共字符串","titleSlug":"count-common-words-with-one-occurrence"},{"acceptance":0.44763699167844245,"acs":2851,"articleLive":2,"columnArticles":67,"formTitle":"[2086]从房屋收集雨水需要的最少水桶数","frequency":0.0,"frontendQuestionId":"2086","leaf":true,"level":2,"nodeType":"def","questionId":"2191","status":"ac","submitted":6369,"title":"从房屋收集雨水需要的最少水桶数","titleSlug":"minimum-number-of-buckets-required-to-collect-rainwater-from-houses"},{"acceptance":0.4646236116824352,"acs":2259,"articleLive":2,"columnArticles":57,"formTitle":"[2087]网格图中机器人回家的最小代价","frequency":0.0,"frontendQuestionId":"2087","leaf":true,"level":2,"nodeType":"def","questionId":"2192","status":"ac","submitted":4862,"title":"网格图中机器人回家的最小代价","titleSlug":"minimum-cost-homecoming-of-a-robot-in-a-grid"},{"acceptance":0.6173774412116381,"acs":1549,"articleLive":2,"columnArticles":42,"formTitle":"[2088]统计农场中肥沃金字塔的数目","frequency":0.0,"frontendQuestionId":"2088","leaf":true,"level":3,"nodeType":"def","questionId":"2193","status":"","submitted":2509,"title":"统计农场中肥沃金字塔的数目","titleSlug":"count-fertile-pyramids-in-a-land"},{"acceptance":0.8441636582430806,"acs":7015,"articleLive":2,"columnArticles":78,"formTitle":"[2089]找出数组排序后的目标下标","frequency":0.4972098898,"frontendQuestionId":"2089","leaf":true,"level":1,"nodeType":"def","questionId":"2210","status":"","submitted":8310,"title":"找出数组排序后的目标下标","titleSlug":"find-target-indices-after-sorting-array"},{"acceptance":0.3462602096597852,"acs":5384,"articleLive":2,"columnArticles":89,"formTitle":"[2090]半径为 k 的子数组平均值","frequency":0.099909776,"frontendQuestionId":"2090","leaf":true,"level":2,"nodeType":"def","questionId":"2211","status":"","submitted":15549,"title":"半径为 k 的子数组平均值","titleSlug":"k-radius-subarray-averages"},{"acceptance":0.5710455764075067,"acs":5325,"articleLive":2,"columnArticles":108,"formTitle":"[2091]从数组中移除最大值和最小值","frequency":0.0,"frontendQuestionId":"2091","leaf":true,"level":2,"nodeType":"def","questionId":"2212","status":"","submitted":9325,"title":"从数组中移除最大值和最小值","titleSlug":"removing-minimum-and-maximum-from-array"},{"acceptance":0.26384077168670605,"acs":3884,"articleLive":2,"columnArticles":107,"formTitle":"[2092]找出知晓秘密的所有专家","frequency":0.2460499307,"frontendQuestionId":"2092","leaf":true,"level":3,"nodeType":"def","questionId":"2213","status":"","submitted":14721,"title":"找出知晓秘密的所有专家","titleSlug":"find-all-people-with-secret"},{"acceptance":0.6610169491525424,"acs":39,"articleLive":2,"columnArticles":3,"formTitle":"[2093]Minimum Cost to Reach City With Discounts","frequency":0.0,"frontendQuestionId":"2093","leaf":true,"level":2,"nodeType":"def","questionId":"2230","status":"","submitted":59,"title":"Minimum Cost to Reach City With Discounts","titleSlug":"minimum-cost-to-reach-city-with-discounts"},{"acceptance":0.5502503576537912,"acs":6154,"articleLive":2,"columnArticles":103,"formTitle":"[2094]找出 3 位偶数","frequency":0.1364546466,"frontendQuestionId":"2094","leaf":true,"level":1,"nodeType":"def","questionId":"2215","status":"","submitted":11184,"title":"找出 3 位偶数","titleSlug":"finding-3-digit-even-numbers"},{"acceptance":0.5974633537789791,"acs":5747,"articleLive":2,"columnArticles":88,"formTitle":"[2095]删除链表的中间节点","frequency":0.0,"frontendQuestionId":"2095","leaf":true,"level":2,"nodeType":"def","questionId":"2216","status":"","submitted":9619,"title":"删除链表的中间节点","titleSlug":"delete-the-middle-node-of-a-linked-list"},{"acceptance":0.40453390658589017,"acs":4140,"articleLive":2,"columnArticles":152,"formTitle":"[2096]从二叉树一个节点到另一个节点每一步的方向","frequency":0.2855183526,"frontendQuestionId":"2096","leaf":true,"level":2,"nodeType":"def","questionId":"2217","status":"","submitted":10234,"title":"从二叉树一个节点到另一个节点每一步的方向","titleSlug":"step-by-step-directions-from-a-binary-tree-node-to-another"},{"acceptance":0.33574733454033395,"acs":1669,"articleLive":2,"columnArticles":45,"formTitle":"[2097]合法重新排列数对","frequency":0.5792230415,"frontendQuestionId":"2097","leaf":true,"level":3,"nodeType":"def","questionId":"2201","status":"","submitted":4971,"title":"合法重新排列数对","titleSlug":"valid-arrangement-of-pairs"},{"acceptance":0.4024390243902439,"acs":33,"articleLive":2,"columnArticles":2,"formTitle":"[2098]Subsequence of Size K With the Largest Even Sum","frequency":1.3299352933,"frontendQuestionId":"2098","leaf":true,"level":2,"nodeType":"def","questionId":"2242","status":"","submitted":82,"title":"Subsequence of Size K With the Largest Even Sum","titleSlug":"subsequence-of-size-k-with-the-largest-even-sum"},{"acceptance":0.49029982363315694,"acs":3614,"articleLive":2,"columnArticles":84,"formTitle":"[2099]找到和最大的长度为 K 的子序列","frequency":0.5233893954,"frontendQuestionId":"2099","leaf":true,"level":1,"nodeType":"def","questionId":"2204","status":"ac","submitted":7371,"title":"找到和最大的长度为 K 的子序列","titleSlug":"find-subsequence-of-length-k-with-the-largest-sum"},{"acceptance":0.3527267629328473,"acs":2516,"articleLive":2,"columnArticles":54,"formTitle":"[2100]适合打劫银行的日子","frequency":0.0,"frontendQuestionId":"2100","leaf":true,"level":2,"nodeType":"def","questionId":"2205","status":"ac","submitted":7133,"title":"适合打劫银行的日子","titleSlug":"find-good-days-to-rob-the-bank"},{"acceptance":0.37091692919913777,"acs":2237,"articleLive":2,"columnArticles":58,"formTitle":"[2101]引爆最多的炸弹","frequency":0.0,"frontendQuestionId":"2101","leaf":true,"level":2,"nodeType":"def","questionId":"2206","status":"notac","submitted":6031,"title":"引爆最多的炸弹","titleSlug":"detonate-the-maximum-bombs"},{"acceptance":0.5245130960376091,"acs":1562,"articleLive":2,"columnArticles":54,"formTitle":"[2102]序列顺序查询","frequency":0.0,"frontendQuestionId":"2102","leaf":true,"level":3,"nodeType":"def","questionId":"2207","status":"","submitted":2978,"title":"序列顺序查询","titleSlug":"sequentially-ordinal-rank-tracker"},{"acceptance":0.8135546714226918,"acs":5930,"articleLive":2,"columnArticles":104,"formTitle":"[2103]环和杆","frequency":0.2153914903,"frontendQuestionId":"2103","leaf":true,"level":1,"nodeType":"def","questionId":"2226","status":"","submitted":7289,"title":"环和杆","titleSlug":"rings-and-rods"},{"acceptance":0.5563151406477642,"acs":4964,"articleLive":2,"columnArticles":87,"formTitle":"[2104]子数组范围和","frequency":0.0,"frontendQuestionId":"2104","leaf":true,"level":2,"nodeType":"def","questionId":"2227","status":"","submitted":8923,"title":"子数组范围和","titleSlug":"sum-of-subarray-ranges"},{"acceptance":0.547883064516129,"acs":4348,"articleLive":2,"columnArticles":74,"formTitle":"[2105]给植物浇水 II","frequency":0.3249867744,"frontendQuestionId":"2105","leaf":true,"level":2,"nodeType":"def","questionId":"2228","status":"","submitted":7936,"title":"给植物浇水 II","titleSlug":"watering-plants-ii"},{"acceptance":0.3141690229343387,"acs":3000,"articleLive":2,"columnArticles":72,"formTitle":"[2106]摘水果","frequency":1.4161956376,"frontendQuestionId":"2106","leaf":true,"level":3,"nodeType":"def","questionId":"2229","status":"","submitted":9549,"title":"摘水果","titleSlug":"maximum-fruits-harvested-after-at-most-k-steps"},{"acceptance":0.6,"acs":36,"articleLive":2,"columnArticles":5,"formTitle":"[2107]Number of Unique Flavors After Sharing K Candies","frequency":0.0,"frontendQuestionId":"2107","leaf":true,"level":2,"nodeType":"def","questionId":"2247","status":"","submitted":60,"title":"Number of Unique Flavors After Sharing K Candies","titleSlug":"number-of-unique-flavors-after-sharing-k-candies"},{"acceptance":0.8242214532871972,"acs":5955,"articleLive":2,"columnArticles":75,"formTitle":"[2108]找出数组中的第一个回文字符串","frequency":0.0,"frontendQuestionId":"2108","leaf":true,"level":1,"nodeType":"def","questionId":"2231","status":"ac","submitted":7225,"title":"找出数组中的第一个回文字符串","titleSlug":"find-first-palindromic-string-in-the-array"},{"acceptance":0.6068008178198644,"acs":5639,"articleLive":2,"columnArticles":71,"formTitle":"[2109]向字符串添加空格","frequency":0.0,"frontendQuestionId":"2109","leaf":true,"level":2,"nodeType":"def","questionId":"2232","status":"ac","submitted":9293,"title":"向字符串添加空格","titleSlug":"adding-spaces-to-a-string"},{"acceptance":0.494408582598418,"acs":5438,"articleLive":2,"columnArticles":99,"formTitle":"[2110]股票平滑下跌阶段的数目","frequency":0.0,"frontendQuestionId":"2110","leaf":true,"level":2,"nodeType":"def","questionId":"2233","status":"ac","submitted":10999,"title":"股票平滑下跌阶段的数目","titleSlug":"number-of-smooth-descent-periods-of-a-stock"},{"acceptance":0.3130215408499903,"acs":3226,"articleLive":2,"columnArticles":80,"formTitle":"[2111]使数组 K 递增的最少操作次数","frequency":0.0,"frontendQuestionId":"2111","leaf":true,"level":3,"nodeType":"def","questionId":"2234","status":"notac","submitted":10306,"title":"使数组 K 递增的最少操作次数","titleSlug":"minimum-operations-to-make-the-array-k-increasing"},{"acceptance":0.782608695652174,"acs":54,"articleLive":2,"columnArticles":4,"formTitle":"[2112]The Airport With the Most Traffic","frequency":0.0,"frontendQuestionId":"2112","leaf":true,"level":2,"nodeType":"def","questionId":"2252","status":"","submitted":69,"title":"The Airport With the Most Traffic","titleSlug":"the-airport-with-the-most-traffic"},{"acceptance":0.875,"acs":21,"articleLive":2,"columnArticles":3,"formTitle":"[2113]Elements in Array After Removing and Replacing Elements","frequency":0.0,"frontendQuestionId":"2113","leaf":true,"level":2,"nodeType":"def","questionId":"2258","status":"","submitted":24,"title":"Elements in Array After Removing and Replacing Elements","titleSlug":"elements-in-array-after-removing-and-replacing-elements"},{"acceptance":0.0,"acs":0,"articleLive":2,"columnArticles":0,"formTitle":"[2118]Build the Equation","frequency":0.0,"frontendQuestionId":"2118","leaf":true,"level":3,"nodeType":"def","questionId":"2253","status":"","submitted":0,"title":"Build the Equation","titleSlug":"build-the-equation"},{"acceptance":0.9184782608695652,"acs":2535,"articleLive":2,"columnArticles":24,"formTitle":"[5946]句子中的最多单词数","frequency":0.0,"frontendQuestionId":"5946","leaf":true,"level":1,"nodeType":"def","questionId":"2219","status":"ac","submitted":2760,"title":"句子中的最多单词数","titleSlug":"maximum-number-of-words-found-in-sentences"},{"acceptance":0.3010614345448697,"acs":1872,"articleLive":2,"columnArticles":43,"formTitle":"[5947]从给定原材料中找到所有可以做出的菜","frequency":0.0,"frontendQuestionId":"5947","leaf":true,"level":2,"nodeType":"def","questionId":"2220","status":"ac","submitted":6218,"title":"从给定原材料中找到所有可以做出的菜","titleSlug":"find-all-possible-recipes-from-given-supplies"},{"acceptance":0.21052631578947367,"acs":1104,"articleLive":2,"columnArticles":21,"formTitle":"[5948]判断一个括号字符串是否有效","frequency":0.0,"frontendQuestionId":"5948","leaf":true,"level":2,"nodeType":"def","questionId":"2221","status":"ac","submitted":5244,"title":"判断一个括号字符串是否有效","titleSlug":"check-if-a-parentheses-string-can-be-valid"},{"acceptance":0.28732747804265996,"acs":458,"articleLive":2,"columnArticles":8,"formTitle":"[5949]一个区间内所有数乘积的缩写","frequency":0.0,"frontendQuestionId":"5949","leaf":true,"level":3,"nodeType":"def","questionId":"2222","status":"","submitted":1594,"title":"一个区间内所有数乘积的缩写","titleSlug":"abbreviating-the-product-of-a-range"},{"acceptance":0.8260159281192567,"acs":4045,"articleLive":2,"columnArticles":15,"formTitle":"[5963]反转两次的数字","frequency":0.0,"frontendQuestionId":"5963","leaf":true,"level":1,"nodeType":"def","questionId":"2238","status":"ac","submitted":4897,"title":"反转两次的数字","titleSlug":"a-number-after-a-double-reversal"},{"acceptance":0.8216890143495648,"acs":3493,"articleLive":2,"columnArticles":29,"formTitle":"[5964]执行所有后缀指令","frequency":0.0,"frontendQuestionId":"5964","leaf":true,"level":2,"nodeType":"def","questionId":"2239","status":"ac","submitted":4251,"title":"执行所有后缀指令","titleSlug":"execution-of-all-suffix-instructions-staying-in-a-grid"},{"acceptance":0.2633412115934818,"acs":2117,"articleLive":2,"columnArticles":48,"formTitle":"[5965]相同元素的间隔之和","frequency":0.0,"frontendQuestionId":"5965","leaf":true,"level":2,"nodeType":"def","questionId":"2240","status":"ac","submitted":8039,"title":"相同元素的间隔之和","titleSlug":"intervals-between-identical-elements"},{"acceptance":0.3111111111111111,"acs":1092,"articleLive":2,"columnArticles":22,"formTitle":"[5966]还原原数组","frequency":0.0,"frontendQuestionId":"5966","leaf":true,"level":3,"nodeType":"def","questionId":"2241","status":"notac","submitted":3510,"title":"还原原数组","titleSlug":"recover-the-original-array"},{"acceptance":0.8450305740622434,"acs":83331,"articleLive":2,"columnArticles":640,"formTitle":"[LCP 01]猜数字","frequency":0.5233893954,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","submitted":98613,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.6912995115345553,"acs":14294,"articleLive":2,"columnArticles":246,"formTitle":"[LCP 02]分式化简","frequency":1.0847265383,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","submitted":20677,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.22137649075870905,"acs":11750,"articleLive":2,"columnArticles":188,"formTitle":"[LCP 03]机器人大冒险","frequency":1.180738826,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","submitted":53077,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.384478266831208,"acs":2804,"articleLive":2,"columnArticles":64,"formTitle":"[LCP 04]覆盖","frequency":0.0,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","submitted":7293,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.20221139430284857,"acs":2158,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","submitted":10672,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.8391337120585369,"acs":45643,"articleLive":2,"columnArticles":690,"formTitle":"[LCP 06]拿硬币","frequency":0.5506985748,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"1000056","status":"","submitted":54393,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7664781318250546,"acs":41061,"articleLive":2,"columnArticles":492,"formTitle":"[LCP 07]传递信息","frequency":3.5986831061,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"1000063","status":"ac","submitted":53571,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.29275537708344795,"acs":5322,"articleLive":2,"columnArticles":109,"formTitle":"[LCP 08]剧情触发时间","frequency":1.2518925863,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"1000057","status":"","submitted":18179,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.27994955863808324,"acs":6882,"articleLive":2,"columnArticles":112,"formTitle":"[LCP 09]最小跳跃次数","frequency":2.2763969028,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"1000090","status":"","submitted":24583,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5973546601045832,"acs":1942,"articleLive":2,"columnArticles":38,"formTitle":"[LCP 10]二叉树任务调度","frequency":1.9722632254,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"1000062","status":"","submitted":3251,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6937220158140421,"acs":7282,"articleLive":2,"columnArticles":74,"formTitle":"[LCP 11]期望个数统计","frequency":0.5233893954,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"1000086","status":"","submitted":10497,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.41545980094165325,"acs":6971,"articleLive":2,"columnArticles":115,"formTitle":"[LCP 12]小张刷题计划","frequency":0.5792230415,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"1000087","status":"","submitted":16779,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6115813774528664,"acs":9537,"articleLive":2,"columnArticles":85,"formTitle":"[LCP 13]寻宝","frequency":0.0,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"1000093","status":"","submitted":15594,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.2156803844998498,"acs":2872,"articleLive":2,"columnArticles":44,"formTitle":"[LCP 14]切分数组","frequency":1.5832497222,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"1000059","status":"","submitted":13316,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5809815950920245,"acs":947,"articleLive":2,"columnArticles":22,"formTitle":"[LCP 15]游乐园的迷宫","frequency":1.3299352933,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"1000088","status":"","submitted":1630,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.3136803316444035,"acs":681,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 16]游乐园的游览计划","frequency":1.055182292,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"1000085","status":"","submitted":2171,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7984516129032259,"acs":24752,"articleLive":2,"columnArticles":269,"formTitle":"[LCP 17]速算机器人","frequency":1.0847265383,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"1000139","status":"","submitted":31000,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.2899340810397076,"acs":18561,"articleLive":2,"columnArticles":246,"formTitle":"[LCP 18]早餐组合","frequency":1.7124614537,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"1000146","status":"ac","submitted":64018,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5171447839394097,"acs":19938,"articleLive":2,"columnArticles":206,"formTitle":"[LCP 19]秋叶收藏集","frequency":1.5124236696,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"1000130","status":"","submitted":38554,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.3185960175497806,"acs":1888,"articleLive":2,"columnArticles":34,"formTitle":"[LCP 20]快速公交","frequency":0.0,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"1000133","status":"","submitted":5926,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.3321529745042493,"acs":938,"articleLive":2,"columnArticles":27,"formTitle":"[LCP 21]追逐游戏","frequency":0.0,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"1000134","status":"","submitted":2824,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.3356351081228421,"acs":9235,"articleLive":2,"columnArticles":189,"formTitle":"[LCP 22]黑白方格画","frequency":0.0,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"1000140","status":"ac","submitted":27515,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.34099049030505124,"acs":2761,"articleLive":2,"columnArticles":56,"formTitle":"[LCP 23]魔术排列","frequency":0.0,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"1000058","status":"","submitted":8097,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.2867235796290845,"acs":974,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"1000131","status":"","submitted":3397,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.340506673930809,"acs":1250,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"1000138","status":"","submitted":3671,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.3453401943967982,"acs":604,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 26]导航装置","frequency":1.2518925863,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"1000132","status":"","submitted":1749,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.3283657489264966,"acs":1300,"articleLive":2,"columnArticles":26,"formTitle":"[LCP 27]黑盒光线反射","frequency":0.0,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"1000147","status":"","submitted":3959,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.28863766813905317,"acs":11566,"articleLive":2,"columnArticles":189,"formTitle":"[LCP 28]采购方案","frequency":0.5506985748,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"1000215","status":"ac","submitted":40071,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.19218872157449268,"acs":5654,"articleLive":2,"columnArticles":133,"formTitle":"[LCP 29]乐团站位","frequency":1.779247512,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"1000216","status":"ac","submitted":29419,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.35488913332947375,"acs":6130,"articleLive":2,"columnArticles":107,"formTitle":"[LCP 30]魔塔游戏","frequency":0.0,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"1000224","status":"ac","submitted":17273,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.2566383794141801,"acs":1875,"articleLive":2,"columnArticles":38,"formTitle":"[LCP 31]变换的迷宫","frequency":2.0164107607,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"1000218","status":"","submitted":7306,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.41469534050179213,"acs":1157,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 32]批量处理任务","frequency":1.6209900502,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"1000219","status":"","submitted":2790,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.22512090154842718,"acs":5074,"articleLive":2,"columnArticles":88,"formTitle":"[LCP 33]蓄水","frequency":1.0847265383,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"1000221","status":"","submitted":22539,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.4997230939634484,"acs":2707,"articleLive":2,"columnArticles":65,"formTitle":"[LCP 34]二叉树染色","frequency":2.0255050395,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"1000089","status":"","submitted":5417,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.4141955835962145,"acs":1313,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 35]电动车游城市","frequency":1.3299352933,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"1000220","status":"","submitted":3170,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.27142411966344654,"acs":871,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 36]最多牌组数","frequency":2.9023157452,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"1000222","status":"notac","submitted":3209,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.19935765083734802,"acs":869,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 37]最小矩形面积","frequency":0.7438514124,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"1000091","status":"","submitted":4359,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5689277899343544,"acs":520,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 38]守卫城堡","frequency":0.0,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"1000223","status":"","submitted":914,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5133229776556338,"acs":4296,"articleLive":2,"columnArticles":33,"formTitle":"[LCP 39]无人机方阵","frequency":0.4972098898,"frontendQuestionId":"LCP 39","leaf":true,"level":1,"nodeType":"def","questionId":"1000369","status":"ac","submitted":8369,"title":"无人机方阵","titleSlug":"0jQkd0"},{"acceptance":0.25306092878359776,"acs":3493,"articleLive":2,"columnArticles":73,"formTitle":"[LCP 40]心算挑战","frequency":0.0,"frontendQuestionId":"LCP 40","leaf":true,"level":1,"nodeType":"def","questionId":"1000368","status":"ac","submitted":13803,"title":"心算挑战","titleSlug":"uOAnQW"},{"acceptance":0.4331811263318113,"acs":1423,"articleLive":2,"columnArticles":30,"formTitle":"[LCP 41]黑白翻转棋","frequency":0.6731005563,"frontendQuestionId":"LCP 41","leaf":true,"level":2,"nodeType":"def","questionId":"1000370","status":"","submitted":3285,"title":"黑白翻转棋","titleSlug":"fHi6rV"},{"acceptance":0.20755408874220754,"acs":1132,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 42]玩具套圈","frequency":0.0,"frontendQuestionId":"LCP 42","leaf":true,"level":3,"nodeType":"def","questionId":"1000371","status":"notac","submitted":5454,"title":"玩具套圈","titleSlug":"vFjcfV"},{"acceptance":0.41690408357075026,"acs":439,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 43]十字路口的交通","frequency":0.0,"frontendQuestionId":"LCP 43","leaf":true,"level":3,"nodeType":"def","questionId":"1000367","status":"","submitted":1053,"title":"十字路口的交通","titleSlug":"Y1VbOX"},{"acceptance":0.8172177167810356,"acs":3930,"articleLive":2,"columnArticles":52,"formTitle":"[LCP 44]开幕式焰火","frequency":0.0,"frontendQuestionId":"LCP 44","leaf":true,"level":1,"nodeType":"def","questionId":"1000362","status":"ac","submitted":4809,"title":"开幕式焰火","titleSlug":"sZ59z6"},{"acceptance":0.20443473878716614,"acs":1217,"articleLive":2,"columnArticles":31,"formTitle":"[LCP 45]自行车炫技赛场","frequency":0.0,"frontendQuestionId":"LCP 45","leaf":true,"level":2,"nodeType":"def","questionId":"1000375","status":"notac","submitted":5953,"title":"自行车炫技赛场","titleSlug":"kplEvH"},{"acceptance":0.38950715421303655,"acs":980,"articleLive":2,"columnArticles":25,"formTitle":"[LCP 46]志愿者调配","frequency":0.0,"frontendQuestionId":"LCP 46","leaf":true,"level":2,"nodeType":"def","questionId":"1000373","status":"notac","submitted":2516,"title":"志愿者调配","titleSlug":"05ZEDJ"},{"acceptance":0.3633360858794385,"acs":880,"articleLive":2,"columnArticles":17,"formTitle":"[LCP 47]入场安检","frequency":0.0,"frontendQuestionId":"LCP 47","leaf":true,"level":3,"nodeType":"def","questionId":"1000361","status":"","submitted":2422,"title":"入场安检","titleSlug":"oPs9Bm"},{"acceptance":0.17251606524962926,"acs":349,"articleLive":2,"columnArticles":10,"formTitle":"[LCP 48]无限棋局","frequency":0.9993018336,"frontendQuestionId":"LCP 48","leaf":true,"level":3,"nodeType":"def","questionId":"1000374","status":"","submitted":2023,"title":"无限棋局","titleSlug":"fsa7oZ"},{"acceptance":0.24713467048710602,"acs":345,"articleLive":2,"columnArticles":10,"formTitle":"[LCP 49]环形闯关游戏","frequency":0.0,"frontendQuestionId":"LCP 49","leaf":true,"level":3,"nodeType":"def","questionId":"1000359","status":"","submitted":1396,"title":"环形闯关游戏","titleSlug":"K8GULz"},{"acceptance":0.5425370874962155,"acs":5376,"articleLive":2,"columnArticles":114,"formTitle":"[LCS 01]下载插件","frequency":1.9219929666,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","questionId":"1000225","status":"ac","submitted":9909,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.6741842610364683,"acs":4215,"articleLive":2,"columnArticles":81,"formTitle":"[LCS 02]完成一半题目","frequency":1.1474135162,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","questionId":"1000226","status":"","submitted":6252,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.40956468424279585,"acs":2004,"articleLive":2,"columnArticles":65,"formTitle":"[LCS 03]主题空间","frequency":1.1154414835,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","questionId":"1000227","status":"","submitted":4893,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.6785178019582843,"acs":443294,"articleLive":2,"columnArticles":3011,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":4.2064992442,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"100275","status":"","submitted":653327,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.40313653136531363,"acs":291479,"articleLive":2,"columnArticles":2301,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":3.5799035641,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"100276","status":"","submitted":723028,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.7601096609954731,"acs":329937,"articleLive":2,"columnArticles":2155,"formTitle":"[剑指 Offer 05]替换空格","frequency":3.4661667569,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"100280","status":"","submitted":434065,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7499427968733315,"acs":344142,"articleLive":2,"columnArticles":2324,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":3.717770119,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"100282","status":"ac","submitted":458891,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6994921195069029,"acs":205352,"articleLive":2,"columnArticles":1541,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":3.1749488103,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"100283","status":"","submitted":293573,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7132129235589293,"acs":306862,"articleLive":2,"columnArticles":1902,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":4.7274256616,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"100273","status":"ac","submitted":430253,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.3608834013790041,"acs":292579,"articleLive":2,"columnArticles":1990,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":3.7474134373,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"100274","status":"ac","submitted":810730,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.44687825713760193,"acs":218662,"articleLive":2,"columnArticles":1423,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":3.3246699857,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"100277","status":"","submitted":489310,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.49228743098079125,"acs":291189,"articleLive":2,"columnArticles":1771,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":3.9846354,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"100278","status":"","submitted":591502,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.4525492361932739,"acs":190101,"articleLive":2,"columnArticles":1244,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":2.8431865935,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"100279","status":"","submitted":420067,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5281314146252107,"acs":196054,"articleLive":2,"columnArticles":1846,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":3.6658912666,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"100281","status":"","submitted":371222,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.5704930445091638,"acs":171792,"articleLive":2,"columnArticles":1412,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":2.9857931162,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"100284","status":"","submitted":301129,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.3139504182763125,"acs":90370,"articleLive":2,"columnArticles":522,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":0.4247143878,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"100285","status":"","submitted":287848,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7480369571354386,"acs":214632,"articleLive":2,"columnArticles":1341,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":1.8292079513,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"100292","status":"ac","submitted":286927,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.34148663988713507,"acs":136274,"articleLive":2,"columnArticles":828,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":1.4470622855,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"100295","status":"","submitted":399061,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.77815688177882,"acs":161929,"articleLive":2,"columnArticles":1179,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":3.006194493,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"100296","status":"","submitted":208093,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.5976228376767939,"acs":209116,"articleLive":2,"columnArticles":1586,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":2.3926446821,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"100299","status":"ac","submitted":349913,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.37985666377626176,"acs":72719,"articleLive":2,"columnArticles":478,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":2.7142972866,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"100297","status":"","submitted":191438,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.24504489292077652,"acs":84169,"articleLive":2,"columnArticles":924,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":3.0134382769,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"100290","status":"","submitted":343484,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.6447018406078897,"acs":216184,"articleLive":2,"columnArticles":1791,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":2.7992379633,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"100291","status":"","submitted":335324,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7987317226266736,"acs":285037,"articleLive":2,"columnArticles":2605,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":3.9980945533,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"100294","status":"ac","submitted":356862,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7423573105309801,"acs":329208,"articleLive":2,"columnArticles":2006,"formTitle":"[剑指 Offer 24]反转链表","frequency":4.1519419993,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"100298","status":"ac","submitted":443463,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7273448330320951,"acs":207246,"articleLive":2,"columnArticles":1289,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":3.472647661,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"100286","status":"","submitted":284935,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.4663514734108615,"acs":165219,"articleLive":2,"columnArticles":1334,"formTitle":"[剑指 Offer 26]树的子结构","frequency":3.5784166413,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"100287","status":"","submitted":354280,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7927195322193576,"acs":213389,"articleLive":2,"columnArticles":1545,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":2.3926446821,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"100288","status":"","submitted":269186,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.579039882997971,"acs":168661,"articleLive":2,"columnArticles":1220,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":2.2295279688,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"100289","status":"","submitted":291277,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.4394187895433267,"acs":158073,"articleLive":2,"columnArticles":1578,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":3.6334208816,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"100293","status":"","submitted":359732,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.5608769103838447,"acs":171312,"articleLive":2,"columnArticles":1142,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":3.0864174491,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"100302","status":"ac","submitted":305436,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6164184363724794,"acs":124204,"articleLive":2,"columnArticles":1036,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":2.2426782668,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"100306","status":"","submitted":201493,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.6407889077764352,"acs":156439,"articleLive":2,"columnArticles":1099,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":2.3779038491,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100311","status":"","submitted":244135,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.6877600962883677,"acs":154854,"articleLive":2,"columnArticles":1218,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":2.3257652688,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100312","status":"","submitted":225157,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5883840006855625,"acs":137320,"articleLive":2,"columnArticles":1283,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":2.405109009,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"100314","status":"","submitted":233385,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.5547371263395999,"acs":125319,"articleLive":2,"columnArticles":1050,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":2.491818408,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"100315","status":"","submitted":225907,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5797753246500399,"acs":148895,"articleLive":2,"columnArticles":960,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":2.9501259975,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"100317","status":"","submitted":256815,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7180618962342674,"acs":142345,"articleLive":2,"columnArticles":987,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":2.6133269101,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"100300","status":"ac","submitted":198235,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6535990004016243,"acs":117172,"articleLive":2,"columnArticles":1013,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":3.2328940551,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"100305","status":"","submitted":179272,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.5629260583658109,"acs":84064,"articleLive":2,"columnArticles":596,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":3.0729796706,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"100307","status":"ac","submitted":149334,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5802447754300889,"acs":170867,"articleLive":2,"columnArticles":1185,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":4.0671219248,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"100308","status":"ac","submitted":294474,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6935563928434447,"acs":184443,"articleLive":2,"columnArticles":1099,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":1.9219929666,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"100310","status":"ac","submitted":265938,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.5715025644912706,"acs":271434,"articleLive":2,"columnArticles":1921,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":3.3589524533,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"100301","status":"","submitted":474948,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5820408825438027,"acs":71754,"articleLive":2,"columnArticles":526,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":2.1483449759,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"100303","status":"","submitted":123280,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.6061925255600615,"acs":244101,"articleLive":2,"columnArticles":1623,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":4.0170130139,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"100304","status":"ac","submitted":402679,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.49005429939085454,"acs":53338,"articleLive":2,"columnArticles":545,"formTitle":"[剑指 Offer 43]1~n 整数中 1 出现的次数","frequency":2.9501259975,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"100309","status":"","submitted":108841,"title":"1~n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.41945942981704515,"acs":61192,"articleLive":2,"columnArticles":514,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":2.491818408,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"100313","status":"","submitted":145883,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5584984946745132,"acs":122806,"articleLive":2,"columnArticles":905,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":3.3383657993,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"100323","status":"","submitted":219886,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.5308044090056285,"acs":135801,"articleLive":2,"columnArticles":1579,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":3.4653536826,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"100325","status":"","submitted":255840,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.6897785593064387,"acs":134940,"articleLive":2,"columnArticles":1113,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":2.491818408,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"100327","status":"","submitted":195628,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.46456419699792906,"acs":170037,"articleLive":2,"columnArticles":1156,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":3.4594324413,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"100332","status":"","submitted":366014,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.6513811071836497,"acs":96379,"articleLive":2,"columnArticles":563,"formTitle":"[剑指 Offer 49]丑数","frequency":3.0134382769,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"100334","status":"","submitted":147961,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.6171490126177209,"acs":175885,"articleLive":2,"columnArticles":1185,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":3.1909767702,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"100316","status":"","submitted":284996,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.4848714593929521,"acs":111919,"articleLive":2,"columnArticles":912,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":3.8374291925,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"100318","status":"","submitted":230822,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.6515564413351772,"acs":192230,"articleLive":2,"columnArticles":1124,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":2.9777520638,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"100326","status":"ac","submitted":295032,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5354270365988855,"acs":215889,"articleLive":2,"columnArticles":1751,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":2.9501259975,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100329","status":"ac","submitted":403209,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.4478240545864273,"acs":192563,"articleLive":2,"columnArticles":1643,"formTitle":"[剑指 Offer 53 - II]0~n-1中缺失的数字","frequency":2.9762781155,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100331","status":"","submitted":429997,"title":"0~n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.7583779977144206,"acs":179841,"articleLive":2,"columnArticles":1264,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":1.9722632254,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"100333","status":"","submitted":237139,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.7904049773109963,"acs":193865,"articleLive":2,"columnArticles":1371,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":2.2181732425,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100319","status":"","submitted":245273,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.5896587770895417,"acs":151172,"articleLive":2,"columnArticles":1015,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":1.2770828351,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100342","status":"","submitted":256372,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.6963987505756118,"acs":125521,"articleLive":2,"columnArticles":1105,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":3.1063030204,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100320","status":"","submitted":180243,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.802681314439208,"acs":99807,"articleLive":2,"columnArticles":755,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":1.9219929666,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100321","status":"","submitted":124342,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.6690519259416897,"acs":150906,"articleLive":2,"columnArticles":935,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":2.6596388741,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"100322","status":"","submitted":225552,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7090412706752104,"acs":151152,"articleLive":2,"columnArticles":1943,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":2.9157347127,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100324","status":"","submitted":213178,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.44257673328922853,"acs":145837,"articleLive":2,"columnArticles":1076,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":2.3069429551,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100328","status":"","submitted":329518,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.858458114490563,"acs":236834,"articleLive":2,"columnArticles":1981,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":2.1731273445,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100330","status":"","submitted":275883,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.4450280232170092,"acs":142688,"articleLive":2,"columnArticles":1271,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":3.0886212825,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"100336","status":"","submitted":320627,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.4760722493470054,"acs":103162,"articleLive":2,"columnArticles":1114,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":2.2181732425,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100337","status":"ac","submitted":216694,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.5651402760588694,"acs":71692,"articleLive":2,"columnArticles":635,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":2.7601628613,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"100339","status":"","submitted":126857,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.46039029266046744,"acs":116993,"articleLive":2,"columnArticles":1093,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":1.9600366396,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"100341","status":"","submitted":254117,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.6559938426015008,"acs":119322,"articleLive":2,"columnArticles":808,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":3.7574185232,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"100343","status":"","submitted":181895,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.6351003909897541,"acs":148952,"articleLive":2,"columnArticles":1060,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":3.0355020511,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"100344","status":"","submitted":234533,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.8567752463440658,"acs":150161,"articleLive":2,"columnArticles":1374,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":2.3712246899,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"100345","status":"","submitted":175263,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.5877242584691307,"acs":80031,"articleLive":2,"columnArticles":554,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":2.668958606,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"100335","status":"","submitted":136171,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.5987632560735584,"acs":81530,"articleLive":2,"columnArticles":598,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":2.7318724315,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"100338","status":"","submitted":136164,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.28830348450200377,"acs":76401,"articleLive":2,"columnArticles":613,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":1.5124236696,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"100340","status":"","submitted":265002,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.6950019656385138,"acs":130823,"articleLive":2,"columnArticles":761,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":1.8515137088,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100346","status":"","submitted":188234,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.7015181274619383,"acs":129294,"articleLive":2,"columnArticles":753,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":2.8504419398,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100347","status":"","submitted":184306,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.20796192473682087,"acs":15468,"articleLive":2,"columnArticles":176,"formTitle":"[剑指 Offer II 001]整数除法","frequency":2.9179895559,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","questionId":"1000228","status":"ac","submitted":74379,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5585134747118422,"acs":13616,"articleLive":2,"columnArticles":179,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":1.6209900502,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","questionId":"1000231","status":"ac","submitted":24379,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7860921112631098,"acs":17239,"articleLive":2,"columnArticles":218,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":1.2770828351,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","questionId":"1000230","status":"ac","submitted":21930,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.7019565537194136,"acs":14315,"articleLive":2,"columnArticles":157,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":1.3576994309,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","questionId":"1000233","status":"","submitted":20393,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7159407158112744,"acs":11062,"articleLive":2,"columnArticles":133,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":1.055182292,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","questionId":"1000236","status":"","submitted":15451,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6456700823789432,"acs":12854,"articleLive":2,"columnArticles":152,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":0.9993018336,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","questionId":"1000237","status":"","submitted":19908,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.4486942135738764,"acs":11391,"articleLive":2,"columnArticles":115,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":2.3898972766,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","questionId":"1000239","status":"","submitted":25387,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.49774675267296986,"acs":11266,"articleLive":2,"columnArticles":138,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","questionId":"1000242","status":"","submitted":22634,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.5529775715390565,"acs":9295,"articleLive":2,"columnArticles":121,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.9993018336,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","questionId":"1000244","status":"","submitted":16809,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.4409766361285232,"acs":10060,"articleLive":2,"columnArticles":107,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":1.8590751815,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","questionId":"1000246","status":"","submitted":22813,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5613380123945345,"acs":7518,"articleLive":2,"columnArticles":95,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":1.9439887946,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","questionId":"1000247","status":"","submitted":13393,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.670236013986014,"acs":9201,"articleLive":2,"columnArticles":120,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":0.3644551963,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","questionId":"1000248","status":"","submitted":13728,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.656792433219,"acs":6319,"articleLive":2,"columnArticles":94,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":1.055182292,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","questionId":"1000249","status":"","submitted":9621,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5085657370517929,"acs":7659,"articleLive":2,"columnArticles":110,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.5233893954,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","questionId":"1000250","status":"","submitted":15060,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.6291225886745488,"acs":6066,"articleLive":2,"columnArticles":90,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.4479388408,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","questionId":"1000251","status":"","submitted":9642,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.4870137046861185,"acs":8813,"articleLive":2,"columnArticles":131,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":1.7723356791,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","questionId":"1000252","status":"","submitted":18096,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.5124509803921569,"acs":5227,"articleLive":2,"columnArticles":81,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.4972098898,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","questionId":"1000253","status":"","submitted":10200,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.519463249516441,"acs":8594,"articleLive":2,"columnArticles":113,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","questionId":"1000254","status":"","submitted":16544,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.4678537360890302,"acs":7357,"articleLive":2,"columnArticles":107,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":1.3864315356,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","questionId":"1000255","status":"","submitted":15725,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.7158985938622601,"acs":6975,"articleLive":2,"columnArticles":95,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":1.2518925863,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","questionId":"1000256","status":"","submitted":9743,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5236558580128038,"acs":10061,"articleLive":2,"columnArticles":134,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":1.9219929666,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","questionId":"1000257","status":"","submitted":19213,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5446126776867157,"acs":11762,"articleLive":2,"columnArticles":108,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":1.5649843742,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","questionId":"1000258","status":"","submitted":21597,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.6970993818354732,"acs":8796,"articleLive":2,"columnArticles":85,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":1.055182292,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","questionId":"1000259","status":"","submitted":12618,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7371529828706438,"acs":22464,"articleLive":2,"columnArticles":188,"formTitle":"[剑指 Offer II 024]反转链表","frequency":1.9165773022,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","questionId":"1000260","status":"","submitted":30474,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6007529873956458,"acs":7340,"articleLive":2,"columnArticles":125,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":2.491818408,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","questionId":"1000261","status":"","submitted":12218,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.6610141721962808,"acs":8069,"articleLive":2,"columnArticles":121,"formTitle":"[剑指 Offer II 026]重排链表","frequency":1.9722632254,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","questionId":"1000262","status":"","submitted":12207,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6117217875486007,"acs":12744,"articleLive":2,"columnArticles":149,"formTitle":"[剑指 Offer II 027]回文链表","frequency":1.9439887946,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","questionId":"1000263","status":"","submitted":20833,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6280090625885019,"acs":4435,"articleLive":2,"columnArticles":89,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":1.055182292,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","questionId":"1000264","status":"","submitted":7062,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.30367067338761794,"acs":4699,"articleLive":2,"columnArticles":114,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.5233893954,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","questionId":"1000265","status":"","submitted":15474,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.5476036687766438,"acs":4239,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.4972098898,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","questionId":"1000267","status":"","submitted":7741,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.5444768093210844,"acs":4860,"articleLive":2,"columnArticles":68,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","questionId":"1000270","status":"","submitted":8926,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.5976224783861671,"acs":6636,"articleLive":2,"columnArticles":101,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","questionId":"1000273","status":"","submitted":11104,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.7692638212546549,"acs":5371,"articleLive":2,"columnArticles":84,"formTitle":"[剑指 Offer II 033]变位词组","frequency":1.0847265383,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","questionId":"1000275","status":"","submitted":6982,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.5730168644597127,"acs":4587,"articleLive":2,"columnArticles":87,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","questionId":"1000276","status":"","submitted":8005,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.6658549783549783,"acs":4922,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.4972098898,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","questionId":"1000278","status":"","submitted":7392,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.5676406926406926,"acs":5245,"articleLive":2,"columnArticles":88,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.4720829397,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","questionId":"1000279","status":"","submitted":9240,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.4427892234548336,"acs":5588,"articleLive":2,"columnArticles":104,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","questionId":"1000281","status":"","submitted":12620,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.7779186354730898,"acs":6750,"articleLive":2,"columnArticles":106,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.5233893954,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","questionId":"1000282","status":"","submitted":8677,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.5053726169844021,"acs":4374,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","questionId":"1000283","status":"","submitted":8655,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.5745045731707317,"acs":3015,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":1.479109463,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","questionId":"1000284","status":"","submitted":5248,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.778889316403745,"acs":6073,"articleLive":2,"columnArticles":93,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","questionId":"1000292","status":"","submitted":7797,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.8352844187963726,"acs":5066,"articleLive":2,"columnArticles":76,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.5233893954,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","questionId":"1000293","status":"","submitted":6065,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.6473569876900797,"acs":3576,"articleLive":2,"columnArticles":70,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.9993018336,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","questionId":"1000295","status":"","submitted":5524,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6367497485190566,"acs":5697,"articleLive":2,"columnArticles":106,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.4479388408,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","questionId":"1000297","status":"","submitted":8947,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.805681651779177,"acs":5502,"articleLive":2,"columnArticles":113,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","questionId":"1000298","status":"","submitted":6829,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7204586771080967,"acs":5152,"articleLive":2,"columnArticles":104,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.9993018336,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","questionId":"1000299","status":"","submitted":7151,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.6889565677966102,"acs":5203,"articleLive":2,"columnArticles":101,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":1.3576994309,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","questionId":"1000301","status":"","submitted":7552,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.6895129615082483,"acs":3511,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":0.5233893954,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","questionId":"1000304","status":"","submitted":5092,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7526896942242356,"acs":5317,"articleLive":2,"columnArticles":90,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":1.0847265383,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","questionId":"1000306","status":"","submitted":7064,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6036567808810827,"acs":4193,"articleLive":2,"columnArticles":70,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","questionId":"1000307","status":"","submitted":6946,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.41107275284490474,"acs":3215,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":1.4470622855,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","questionId":"1000309","status":"","submitted":7821,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.7468386444107233,"acs":5906,"articleLive":2,"columnArticles":84,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":1.0847265383,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","questionId":"1000311","status":"","submitted":7908,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6428652257553469,"acs":5681,"articleLive":2,"columnArticles":89,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":0.4972098898,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","questionId":"1000313","status":"","submitted":8837,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8541627157216006,"acs":4504,"articleLive":2,"columnArticles":88,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","questionId":"1000315","status":"","submitted":5273,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.8844164605351923,"acs":3933,"articleLive":2,"columnArticles":66,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","questionId":"1000316","status":"","submitted":4447,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7211799555665268,"acs":5843,"articleLive":2,"columnArticles":101,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":1.4161956376,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","questionId":"1000319","status":"","submitted":8102,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.35680987778757717,"acs":2832,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","questionId":"1000321","status":"","submitted":7937,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.6070143884892086,"acs":2700,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.5506985748,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","questionId":"1000322","status":"","submitted":4448,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.6319411856718286,"acs":4040,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","questionId":"1000323","status":"","submitted":6393,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.680230745244777,"acs":4363,"articleLive":2,"columnArticles":88,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.4972098898,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","questionId":"1000324","status":"","submitted":6414,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.5438227684346701,"acs":3363,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":0.4972098898,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","questionId":"1000326","status":"","submitted":6184,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.769622401357658,"acs":3628,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","questionId":"1000325","status":"","submitted":4714,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.7209870510627902,"acs":2951,"articleLive":2,"columnArticles":74,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.4247143878,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","questionId":"1000327","status":"","submitted":4093,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.6197785606441872,"acs":2463,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","questionId":"1000328","status":"","submitted":3974,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.6466532605573111,"acs":2251,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.4972098898,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","questionId":"1000329","status":"","submitted":3481,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6524822695035462,"acs":2392,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","questionId":"1000330","status":"","submitted":3666,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.6721261753108887,"acs":2216,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","questionId":"1000331","status":"","submitted":3297,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.5010114012504597,"acs":5449,"articleLive":2,"columnArticles":81,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","questionId":"1000332","status":"","submitted":10876,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7212210715220398,"acs":38581,"articleLive":2,"columnArticles":408,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":1.8292079513,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","questionId":"1000333","status":"ac","submitted":53494,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.6506544502617801,"acs":4971,"articleLive":2,"columnArticles":86,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.4720829397,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","questionId":"1000334","status":"","submitted":7640,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.5050657469282173,"acs":2343,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":1.1154414835,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","questionId":"1000335","status":"","submitted":4639,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.4197170864871572,"acs":6765,"articleLive":2,"columnArticles":81,"formTitle":"[剑指 Offer II 072]求平方根","frequency":1.3864315356,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","questionId":"1000336","status":"","submitted":16118,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.5254936634246979,"acs":3566,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.4972098898,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","questionId":"1000337","status":"","submitted":6786,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.570681931309109,"acs":4586,"articleLive":2,"columnArticles":72,"formTitle":"[剑指 Offer II 074]合并区间","frequency":1.3864315356,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","questionId":"1000338","status":"","submitted":8036,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.7147392290249434,"acs":4728,"articleLive":2,"columnArticles":91,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.4247143878,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","questionId":"1000339","status":"","submitted":6615,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.6833595525257822,"acs":7819,"articleLive":2,"columnArticles":91,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":1.6808881918,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","questionId":"1000340","status":"","submitted":11442,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.5847400405131667,"acs":6928,"articleLive":2,"columnArticles":119,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.4720829397,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","questionId":"1000341","status":"","submitted":11848,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6403952759701133,"acs":5314,"articleLive":2,"columnArticles":93,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":1.6209900502,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","questionId":"1000342","status":"","submitted":8298,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8522309291540061,"acs":5329,"articleLive":2,"columnArticles":100,"formTitle":"[剑指 Offer II 079]所有子集","frequency":1.3864315356,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","questionId":"1000343","status":"","submitted":6253,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.822111846946284,"acs":4469,"articleLive":2,"columnArticles":63,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","questionId":"1000344","status":"","submitted":5436,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.7866057086370938,"acs":6366,"articleLive":2,"columnArticles":87,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.5233893954,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","questionId":"1000229","status":"","submitted":8093,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.6490819756917507,"acs":5020,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":1.0847265383,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","questionId":"1000232","status":"","submitted":7734,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8605310262529833,"acs":5769,"articleLive":2,"columnArticles":93,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":0.9993018336,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","questionId":"1000234","status":"","submitted":6704,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6852733304485793,"acs":4751,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":1.3864315356,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","questionId":"1000235","status":"","submitted":6933,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8505053552572032,"acs":5638,"articleLive":2,"columnArticles":91,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":1.3864315356,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","questionId":"1000238","status":"","submitted":6629,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7494679822015864,"acs":3874,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":1.0267308708,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","questionId":"1000240","status":"","submitted":5169,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.632826261008807,"acs":3952,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":1.6504212504,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","questionId":"1000241","status":"","submitted":6245,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7401822180333019,"acs":7068,"articleLive":2,"columnArticles":86,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":1.055182292,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","questionId":"1000243","status":"","submitted":9549,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.6150948298259288,"acs":4735,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":1.055182292,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","questionId":"1000245","status":"","submitted":7698,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.500584404742027,"acs":2998,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":1.1154414835,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","questionId":"1000266","status":"","submitted":5989,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7814110186286167,"acs":3943,"articleLive":2,"columnArticles":97,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":0.5233893954,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","questionId":"1000268","status":"","submitted":5046,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6768728311900388,"acs":3316,"articleLive":2,"columnArticles":78,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.5792230415,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","questionId":"1000269","status":"","submitted":4899,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5729631130928253,"acs":2827,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.5506985748,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","questionId":"1000271","status":"","submitted":4934,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.6017282010997643,"acs":2298,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.5506985748,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","questionId":"1000272","status":"","submitted":3819,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.6513734869899254,"acs":8987,"articleLive":2,"columnArticles":72,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":2.6998952865,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","questionId":"1000274","status":"","submitted":13797,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.49060841159657004,"acs":2403,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":1.814643173,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","questionId":"1000277","status":"","submitted":4898,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5434900054024852,"acs":2012,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":1.1154414835,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","questionId":"1000280","status":"","submitted":3702,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.7530915950534479,"acs":3593,"articleLive":2,"columnArticles":70,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","questionId":"1000345","status":"","submitted":4771,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.71471235460547,"acs":4547,"articleLive":2,"columnArticles":66,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":2.0951357915,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","questionId":"1000285","status":"","submitted":6362,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7493649449618967,"acs":3540,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":1.0847265383,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","questionId":"1000286","status":"","submitted":4724,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.48875783265757466,"acs":3978,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 101]分割等和子集","frequency":1.180738826,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","questionId":"1000287","status":"","submitted":8139,"title":"分割等和子集","titleSlug":"NUPfPr"},{"acceptance":0.5939895118999596,"acs":2945,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","questionId":"1000288","status":"","submitted":4958,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.4980443285528031,"acs":4966,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":2.2426782668,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","questionId":"1000289","status":"","submitted":9971,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5911054637865312,"acs":2326,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.5506985748,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","questionId":"1000290","status":"","submitted":3935,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.6947118389798724,"acs":5557,"articleLive":2,"columnArticles":83,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":1.3864315356,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","questionId":"1000291","status":"","submitted":7999,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.5466061185468452,"acs":2287,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 106]二分图","frequency":1.055182292,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","questionId":"1000294","status":"","submitted":4184,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5414296314617858,"acs":2189,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","questionId":"1000296","status":"","submitted":4043,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.5921155347384855,"acs":1517,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","questionId":"1000300","status":"","submitted":2562,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.5923651895355045,"acs":2219,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":1.5124236696,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","questionId":"1000302","status":"","submitted":3746,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8191766545075561,"acs":3144,"articleLive":2,"columnArticles":75,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","questionId":"1000303","status":"","submitted":3838,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.6790626591951096,"acs":1333,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.4972098898,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","questionId":"1000305","status":"","submitted":1963,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.5669211195928753,"acs":2228,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":0.4972098898,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","questionId":"1000308","status":"","submitted":3930,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.5838587641866331,"acs":2315,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":1.180738826,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","questionId":"1000310","status":"","submitted":3965,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.41936607453848834,"acs":1204,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.4720829397,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","questionId":"1000312","status":"","submitted":2871,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.30849753694581283,"acs":1503,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 115]重建序列","frequency":0.4972098898,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","questionId":"1000314","status":"","submitted":4872,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6502330144714251,"acs":5302,"articleLive":2,"columnArticles":94,"formTitle":"[剑指 Offer II 116]省份数量","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","questionId":"1000346","status":"","submitted":8154,"title":"省份数量","titleSlug":"bLyHh0"},{"acceptance":0.6383526383526383,"acs":1488,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","questionId":"1000317","status":"","submitted":2331,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.6931137724550899,"acs":1852,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","questionId":"1000318","status":"","submitted":2672,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.48181020189212914,"acs":4940,"articleLive":2,"columnArticles":70,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":1.4470622855,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","questionId":"1000320","status":"","submitted":10253,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.716715901722026,"acs":99473,"articleLive":2,"columnArticles":1633,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":4.0240963822,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"100158","status":"","submitted":138790,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6424254674077817,"acs":63568,"articleLive":2,"columnArticles":1182,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":1.4161956376,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"100159","status":"","submitted":98950,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.5784417852675305,"acs":49016,"articleLive":2,"columnArticles":534,"formTitle":"[面试题 01.03]URL化","frequency":2.128636021,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"100160","status":"","submitted":84738,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5490059121410932,"acs":44016,"articleLive":2,"columnArticles":842,"formTitle":"[面试题 01.04]回文排列","frequency":1.8590751815,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"100184","status":"","submitted":80174,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.32883670427149087,"acs":35736,"articleLive":2,"columnArticles":612,"formTitle":"[面试题 01.05]一次编辑","frequency":1.3864315356,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000006","status":"","submitted":108674,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.4707845606087077,"acs":78146,"articleLive":2,"columnArticles":1220,"formTitle":"[面试题 01.06]字符串压缩","frequency":3.0657280072,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"100161","status":"","submitted":165991,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7496189552445615,"acs":70330,"articleLive":2,"columnArticles":1004,"formTitle":"[面试题 01.07]旋转矩阵","frequency":3.0969307049,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"100185","status":"","submitted":93821,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.622805548757712,"acs":48354,"articleLive":2,"columnArticles":539,"formTitle":"[面试题 01.08]零矩阵","frequency":1.055182292,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"100186","status":"","submitted":77639,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5487967509244105,"acs":36214,"articleLive":2,"columnArticles":455,"formTitle":"[面试题 01.09]字符串轮转","frequency":2.17872662,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"100162","status":"","submitted":65988,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.6785829275164004,"acs":67443,"articleLive":2,"columnArticles":722,"formTitle":"[面试题 02.01]移除重复节点","frequency":1.779247512,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"100163","status":"ac","submitted":99388,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7798430447503912,"acs":68765,"articleLive":2,"columnArticles":987,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":2.6800920989,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","questionId":"1000007","status":"ac","submitted":88178,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.8553001203921344,"acs":74595,"articleLive":2,"columnArticles":715,"formTitle":"[面试题 02.03]删除中间节点","frequency":1.7124614537,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"100187","status":"ac","submitted":87215,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6500886420044912,"acs":27502,"articleLive":2,"columnArticles":395,"formTitle":"[面试题 02.04]分割链表","frequency":1.0847265383,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"1000008","status":"ac","submitted":42305,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.46705439936467896,"acs":39992,"articleLive":2,"columnArticles":563,"formTitle":"[面试题 02.05]链表求和","frequency":2.8825327063,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"100188","status":"ac","submitted":85626,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.483969344489037,"acs":42689,"articleLive":2,"columnArticles":533,"formTitle":"[面试题 02.06]回文链表","frequency":0.5233893954,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"100164","status":"ac","submitted":88206,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6809164964668873,"acs":58010,"articleLive":2,"columnArticles":516,"formTitle":"[面试题 02.07]链表相交","frequency":0.9993018336,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","questionId":"100167","status":"ac","submitted":85194,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5346186448320017,"acs":29643,"articleLive":2,"columnArticles":308,"formTitle":"[面试题 02.08]环路检测","frequency":1.6504212504,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"100168","status":"ac","submitted":55447,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5332820315505964,"acs":12474,"articleLive":2,"columnArticles":202,"formTitle":"[面试题 03.01]三合一","frequency":1.0847265383,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"100172","status":"","submitted":23391,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6139830414664925,"acs":27733,"articleLive":2,"columnArticles":315,"formTitle":"[面试题 03.02]栈的最小值","frequency":1.9219929666,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"100169","status":"ac","submitted":45169,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.3878687162442875,"acs":9336,"articleLive":2,"columnArticles":147,"formTitle":"[面试题 03.03]堆盘子","frequency":1.0847265383,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"100195","status":"","submitted":24070,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7143506290647809,"acs":25153,"articleLive":2,"columnArticles":359,"formTitle":"[面试题 03.04]化栈为队","frequency":1.7452190502,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"100170","status":"ac","submitted":35211,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5404568460309004,"acs":16231,"articleLive":2,"columnArticles":223,"formTitle":"[面试题 03.05]栈排序","frequency":1.4161956376,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"100173","status":"","submitted":30032,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5890431333663857,"acs":11881,"articleLive":2,"columnArticles":193,"formTitle":"[面试题 03.06]动物收容所","frequency":1.0847265383,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"100228","status":"","submitted":20170,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5307112511991229,"acs":19363,"articleLive":2,"columnArticles":262,"formTitle":"[面试题 04.01]节点间通路","frequency":1.7124614537,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"100171","status":"","submitted":36485,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7887584397712123,"acs":36682,"articleLive":2,"columnArticles":446,"formTitle":"[面试题 04.02]最小高度树","frequency":2.2426782668,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"100174","status":"","submitted":46506,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8052732592895573,"acs":25594,"articleLive":2,"columnArticles":563,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":1.9219929666,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"100175","status":"","submitted":31783,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5871252856566743,"acs":34941,"articleLive":2,"columnArticles":399,"formTitle":"[面试题 04.04]检查平衡性","frequency":0.5233893954,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"100176","status":"","submitted":59512,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.35284265855889513,"acs":27388,"articleLive":2,"columnArticles":347,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":1.0847265383,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"100177","status":"","submitted":77621,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5931356751530776,"acs":22086,"articleLive":2,"columnArticles":267,"formTitle":"[面试题 04.06]后继者","frequency":0.0,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"100178","status":"","submitted":37236,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.716744112782547,"acs":18201,"articleLive":2,"columnArticles":194,"formTitle":"[面试题 04.08]首个共同祖先","frequency":1.479109463,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"100179","status":"","submitted":25394,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.4759928867812685,"acs":7227,"articleLive":2,"columnArticles":120,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":1.0847265383,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"1000010","status":"","submitted":15183,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7165675169097873,"acs":17586,"articleLive":2,"columnArticles":285,"formTitle":"[面试题 04.10]检查子树","frequency":1.4161956376,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"100229","status":"","submitted":24542,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.48651335916785643,"acs":19083,"articleLive":2,"columnArticles":279,"formTitle":"[面试题 04.12]求和路径","frequency":2.128636021,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"1000009","status":"","submitted":39224,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5053250984778486,"acs":10391,"articleLive":2,"columnArticles":212,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"100180","status":"","submitted":20563,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6966966966966966,"acs":8352,"articleLive":2,"columnArticles":141,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":0.4972098898,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"100203","status":"","submitted":11988,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.3840311462854225,"acs":12034,"articleLive":2,"columnArticles":253,"formTitle":"[面试题 05.03]翻转数位","frequency":1.6808881918,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"100230","status":"","submitted":31336,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.3785058977719528,"acs":5776,"articleLive":2,"columnArticles":147,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"100183","status":"","submitted":15260,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.5304737569639342,"acs":12664,"articleLive":2,"columnArticles":248,"formTitle":"[面试题 05.06]整数转换","frequency":1.0847265383,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"100181","status":"","submitted":23873,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7057553548093858,"acs":12422,"articleLive":2,"columnArticles":230,"formTitle":"[面试题 05.07]配对交换","frequency":1.055182292,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"100182","status":"","submitted":17601,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.556866048862679,"acs":3966,"articleLive":2,"columnArticles":80,"formTitle":"[面试题 05.08]绘制直线","frequency":1.0847265383,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"100196","status":"","submitted":7122,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.3633893537276338,"acs":45472,"articleLive":2,"columnArticles":496,"formTitle":"[面试题 08.01]三步问题","frequency":1.7452190502,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"100197","status":"","submitted":125133,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.3624694540669728,"acs":13498,"articleLive":2,"columnArticles":213,"formTitle":"[面试题 08.02]迷路的机器人","frequency":0.5506985748,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000011","status":"","submitted":37239,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6756417887764536,"acs":53348,"articleLive":2,"columnArticles":443,"formTitle":"[面试题 08.03]魔术索引","frequency":0.0,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"100240","status":"","submitted":78959,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.8212710103182995,"acs":22525,"articleLive":2,"columnArticles":350,"formTitle":"[面试题 08.04]幂集","frequency":2.128636021,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"100198","status":"","submitted":27427,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.6784308211473565,"acs":24125,"articleLive":2,"columnArticles":535,"formTitle":"[面试题 08.05]递归乘法","frequency":0.0,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"100199","status":"","submitted":35560,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6538128356805187,"acs":26416,"articleLive":2,"columnArticles":284,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":1.8590751815,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"1000015","status":"","submitted":40403,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.814038707841184,"acs":22881,"articleLive":2,"columnArticles":335,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":1.8899799896,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"100241","status":"","submitted":28108,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.71790176209661,"acs":17641,"articleLive":2,"columnArticles":257,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":0.5792230415,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"100348","status":"ac","submitted":24573,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8154722387225269,"acs":23338,"articleLive":2,"columnArticles":384,"formTitle":"[面试题 08.09]括号","frequency":2.6998952865,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"100200","status":"","submitted":28619,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5583933393339334,"acs":14889,"articleLive":2,"columnArticles":236,"formTitle":"[面试题 08.10]颜色填充","frequency":1.0847265383,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"100201","status":"","submitted":26664,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.49492068398645517,"acs":35224,"articleLive":2,"columnArticles":341,"formTitle":"[面试题 08.11]硬币","frequency":1.7452190502,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"100231","status":"","submitted":71171,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.7621848739495798,"acs":18140,"articleLive":2,"columnArticles":311,"formTitle":"[面试题 08.12]八皇后","frequency":1.9219929666,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"100233","status":"","submitted":23800,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5030098072370646,"acs":7437,"articleLive":2,"columnArticles":97,"formTitle":"[面试题 08.13]堆箱子","frequency":1.2155249421,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"100202","status":"","submitted":14785,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5351237246393807,"acs":4563,"articleLive":2,"columnArticles":81,"formTitle":"[面试题 08.14]布尔运算","frequency":1.4161956376,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000031","status":"ac","submitted":8527,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.5566265511239215,"acs":59480,"articleLive":2,"columnArticles":2401,"formTitle":"[面试题 10.01]合并排序的数组","frequency":3.3009012193,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000012","status":"","submitted":106858,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7396119594189723,"acs":35795,"articleLive":2,"columnArticles":437,"formTitle":"[面试题 10.02]变位词组","frequency":3.1291742289,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000040","status":"ac","submitted":48397,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.39354961005199307,"acs":14533,"articleLive":2,"columnArticles":220,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":2.8431865935,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"100232","status":"","submitted":36928,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.5562924448217318,"acs":20970,"articleLive":2,"columnArticles":274,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":0.4720829397,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"100242","status":"","submitted":37696,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.4535142203334423,"acs":13873,"articleLive":2,"columnArticles":188,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":1.479109463,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000016","status":"","submitted":30590,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.624341103432119,"acs":5330,"articleLive":2,"columnArticles":104,"formTitle":"[面试题 10.10]数字流的秩","frequency":0.0,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"1000041","status":"","submitted":8537,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6632661068822099,"acs":8452,"articleLive":2,"columnArticles":112,"formTitle":"[面试题 10.11]峰与谷","frequency":1.1154414835,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000013","status":"","submitted":12743,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8282219844060541,"acs":27087,"articleLive":2,"columnArticles":433,"formTitle":"[面试题 16.01]交换数字","frequency":1.0847265383,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"100258","status":"","submitted":32705,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7643705239351677,"acs":16223,"articleLive":2,"columnArticles":213,"formTitle":"[面试题 16.02]单词频率","frequency":0.0,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"100259","status":"","submitted":21224,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.4410970008105917,"acs":9795,"articleLive":2,"columnArticles":237,"formTitle":"[面试题 16.03]交点","frequency":0.0,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"100260","status":"","submitted":22206,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.4603294281405869,"acs":7937,"articleLive":2,"columnArticles":168,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"100261","status":"","submitted":17242,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.46018225039619653,"acs":11615,"articleLive":2,"columnArticles":136,"formTitle":"[面试题 16.05]阶乘尾数","frequency":1.0847265383,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"1000017","status":"","submitted":25240,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.4246984318455971,"acs":14083,"articleLive":2,"columnArticles":210,"formTitle":"[面试题 16.06]最小差","frequency":2.0951357915,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"100262","status":"","submitted":33160,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7329320064026724,"acs":21063,"articleLive":2,"columnArticles":316,"formTitle":"[面试题 16.07]最大数值","frequency":1.4470622855,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"100349","status":"","submitted":28738,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.3789281918931228,"acs":2496,"articleLive":2,"columnArticles":67,"formTitle":"[面试题 16.08]整数的英语表示","frequency":0.0,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"1000018","status":"","submitted":6587,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5444596443228454,"acs":2388,"articleLive":2,"columnArticles":42,"formTitle":"[面试题 16.09]运算","frequency":0.5506985748,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"100350","status":"","submitted":4386,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6801646389443738,"acs":11237,"articleLive":2,"columnArticles":213,"formTitle":"[面试题 16.10]生存人数","frequency":1.4470622855,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"100351","status":"","submitted":16521,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.4407754942458395,"acs":51859,"articleLive":2,"columnArticles":603,"formTitle":"[面试题 16.11]跳水板","frequency":1.6808881918,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"100352","status":"","submitted":117654,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.42750197005516155,"acs":2170,"articleLive":2,"columnArticles":60,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"100353","status":"","submitted":5076,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.552694864903098,"acs":3907,"articleLive":2,"columnArticles":67,"formTitle":"[面试题 16.14]最佳直线","frequency":1.479109463,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"100354","status":"","submitted":7069,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.5026689495417463,"acs":9982,"articleLive":2,"columnArticles":254,"formTitle":"[面试题 16.15]珠玑妙算","frequency":1.1154414835,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"100355","status":"","submitted":19858,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.4569345112887393,"acs":16292,"articleLive":2,"columnArticles":230,"formTitle":"[面试题 16.16]部分排序","frequency":1.6808881918,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"100356","status":"","submitted":35655,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.5969723778629706,"acs":36438,"articleLive":2,"columnArticles":395,"formTitle":"[面试题 16.17]连续数列","frequency":1.8590751815,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"1000003","status":"","submitted":61038,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.3436529761376741,"acs":15496,"articleLive":2,"columnArticles":319,"formTitle":"[面试题 16.18]模式匹配","frequency":0.5792230415,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000004","status":"","submitted":45092,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.6146462033683968,"acs":21386,"articleLive":2,"columnArticles":388,"formTitle":"[面试题 16.19]水域大小","frequency":1.9219929666,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"1000005","status":"","submitted":34794,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7203065134099617,"acs":9588,"articleLive":2,"columnArticles":188,"formTitle":"[面试题 16.20]T9键盘","frequency":1.0847265383,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"1000047","status":"","submitted":13311,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.46488294314381273,"acs":10286,"articleLive":2,"columnArticles":195,"formTitle":"[面试题 16.21]交换和","frequency":0.0,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"1000048","status":"","submitted":22126,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5855095228745337,"acs":2982,"articleLive":2,"columnArticles":63,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":0.0,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000050","status":"","submitted":5093,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.4725985844287159,"acs":11685,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 16.24]数对和","frequency":0.5233893954,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"1000042","status":"","submitted":24725,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5457024415617168,"acs":34621,"articleLive":2,"columnArticles":277,"formTitle":"[面试题 16.25]LRU 缓存","frequency":4.0132578461,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"1000026","status":"","submitted":63443,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.39052537933079623,"acs":15803,"articleLive":2,"columnArticles":221,"formTitle":"[面试题 16.26]计算器","frequency":2.5544170643,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"1000027","status":"","submitted":40466,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.5973049897714133,"acs":13431,"articleLive":2,"columnArticles":186,"formTitle":"[面试题 17.01]不用加号的加法","frequency":1.4470622855,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000025","status":"","submitted":22486,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6383936948770876,"acs":30618,"articleLive":2,"columnArticles":490,"formTitle":"[面试题 17.04]消失的数字","frequency":1.4161956376,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"1000032","status":"","submitted":47961,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.38944300518134717,"acs":6013,"articleLive":2,"columnArticles":104,"formTitle":"[面试题 17.05] 字母与数字","frequency":0.0,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000033","status":"","submitted":15440,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.4534496716740128,"acs":5041,"articleLive":2,"columnArticles":116,"formTitle":"[面试题 17.06]2出现的次数","frequency":1.0847265383,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","questionId":"1000034","status":"","submitted":11117,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.40960376687988626,"acs":9221,"articleLive":2,"columnArticles":222,"formTitle":"[面试题 17.07]婴儿名字","frequency":0.5506985748,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"1000035","status":"","submitted":22512,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.2723960102522929,"acs":8821,"articleLive":2,"columnArticles":126,"formTitle":"[面试题 17.08]马戏团人塔","frequency":1.7124614537,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"1000036","status":"","submitted":32383,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5492293744333635,"acs":15145,"articleLive":2,"columnArticles":166,"formTitle":"[面试题 17.09]第 k 个数","frequency":1.9219929666,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000037","status":"","submitted":27575,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5700691466374124,"acs":68593,"articleLive":2,"columnArticles":951,"formTitle":"[面试题 17.10]主要元素","frequency":2.9501259975,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"1000038","status":"ac","submitted":120324,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6854415916117758,"acs":15297,"articleLive":2,"columnArticles":282,"formTitle":"[面试题 17.11]单词距离","frequency":1.1154414835,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000039","status":"","submitted":22317,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.6312983809226755,"acs":22264,"articleLive":2,"columnArticles":309,"formTitle":"[面试题 17.12]BiNode","frequency":1.055182292,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"1000019","status":"","submitted":35267,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5519379505269385,"acs":25191,"articleLive":2,"columnArticles":277,"formTitle":"[面试题 17.13]恢复空格","frequency":1.1474135162,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"1000020","status":"","submitted":45641,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5962775633346643,"acs":80637,"articleLive":2,"columnArticles":797,"formTitle":"[面试题 17.14]最小K个数","frequency":3.7309323055,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000021","status":"ac","submitted":135234,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.4039194004177417,"acs":6575,"articleLive":2,"columnArticles":128,"formTitle":"[面试题 17.15]最长单词","frequency":1.9219929666,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"1000022","status":"","submitted":16278,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5170603889457523,"acs":63146,"articleLive":2,"columnArticles":1167,"formTitle":"[面试题 17.16]按摩师","frequency":1.814643173,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"1000023","status":"","submitted":122125,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.4492293512212607,"acs":8773,"articleLive":2,"columnArticles":193,"formTitle":"[面试题 17.17]多次搜索","frequency":0.5233893954,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"1000024","status":"","submitted":19529,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.442663797497027,"acs":7817,"articleLive":2,"columnArticles":134,"formTitle":"[面试题 17.18]最短超串","frequency":1.7452190502,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000043","status":"","submitted":17659,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5782468738392967,"acs":9341,"articleLive":2,"columnArticles":195,"formTitle":"[面试题 17.19]消失的两个数字","frequency":0.5506985748,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"1000044","status":"","submitted":16154,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5749198717948718,"acs":4305,"articleLive":2,"columnArticles":74,"formTitle":"[面试题 17.20]连续中值","frequency":0.60905819,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"1000028","status":"","submitted":7488,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.6361830426329285,"acs":45155,"articleLive":2,"columnArticles":543,"formTitle":"[面试题 17.21]直方图的水量","frequency":2.5873472706,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"1000029","status":"","submitted":70978,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.3805725567620928,"acs":9638,"articleLive":2,"columnArticles":163,"formTitle":"[面试题 17.22]单词转换","frequency":1.0847265383,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000030","status":"","submitted":25325,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.37640491815644567,"acs":4990,"articleLive":2,"columnArticles":108,"formTitle":"[面试题 17.23]最大黑方阵","frequency":1.5124236696,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"1000045","status":"","submitted":13257,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5224429416737109,"acs":12361,"articleLive":2,"columnArticles":132,"formTitle":"[面试题 17.24]最大子矩阵","frequency":3.8619040206,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"1000046","status":"","submitted":23660,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.5043772945495623,"acs":1786,"articleLive":2,"columnArticles":40,"formTitle":"[面试题 17.25]单词矩阵","frequency":1.2155249421,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"1000049","status":"","submitted":3541,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.3453971119133574,"acs":3827,"articleLive":2,"columnArticles":59,"formTitle":"[面试题 17.26]稀疏相似度","frequency":1.479109463,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"1000051","status":"","submitted":11080,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}] \ No newline at end of file +[{"acceptance":0.6724232959764835,"acs":25620,"articleLive":2,"columnArticles":323,"formTitle":"[2022]将一维数组转变成二维数组","frequency":0.0,"frontendQuestionId":"2022","leaf":true,"level":1,"nodeType":"def","questionId":"2132","status":"ac","submitted":38101,"title":"将一维数组转变成二维数组","titleSlug":"convert-1d-array-into-2d-array"},{"acceptance":0.5223500698448368,"acs":2819104,"articleLive":2,"columnArticles":15405,"formTitle":"[1]两数之和","frequency":4.7937305492,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"ac","submitted":5396963,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.4117216041458309,"acs":1114812,"articleLive":2,"columnArticles":7911,"formTitle":"[2]两数相加","frequency":4.7166739094,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"ac","submitted":2707684,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.3831735390901172,"acs":1401863,"articleLive":2,"columnArticles":8376,"formTitle":"[3]无重复字符的最长子串","frequency":4.6010889497,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"ac","submitted":3658559,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.41071641579096846,"acs":578453,"articleLive":2,"columnArticles":4312,"formTitle":"[4]寻找两个正序数组的中位数","frequency":4.5625606298,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"ac","submitted":1408400,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.3593908189445947,"acs":829244,"articleLive":2,"columnArticles":4506,"formTitle":"[5]最长回文子串","frequency":4.5240323099,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"ac","submitted":2307360,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5096113113624681,"acs":338042,"articleLive":2,"columnArticles":2745,"formTitle":"[6]Z 字形变换","frequency":3.7608843537,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"ac","submitted":663333,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.3509003531799554,"acs":919427,"articleLive":2,"columnArticles":5720,"formTitle":"[7]整数反转","frequency":4.6781455895,"frontendQuestionId":"7","leaf":true,"level":2,"nodeType":"def","questionId":"7","status":"ac","submitted":2620194,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.21742207304345462,"acs":383733,"articleLive":2,"columnArticles":2939,"formTitle":"[8]字符串转换整数 (atoi)","frequency":3.85210526,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","submitted":1764922,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5805932248295202,"acs":854646,"articleLive":2,"columnArticles":5414,"formTitle":"[9]回文数","frequency":3.88956984,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","submitted":1472022,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.31611211707039216,"acs":226427,"articleLive":2,"columnArticles":1360,"formTitle":"[10]正则表达式匹配","frequency":4.2816166844,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"ac","submitted":716287,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.6221402951040687,"acs":598056,"articleLive":2,"columnArticles":3393,"formTitle":"[11]盛最多水的容器","frequency":4.2184890737,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"ac","submitted":961288,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.6640494487136652,"acs":250425,"articleLive":2,"columnArticles":1956,"formTitle":"[12]整数转罗马数字","frequency":3.4807898118,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"ac","submitted":377118,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.6296198627515078,"acs":518106,"articleLive":2,"columnArticles":4246,"formTitle":"[13]罗马数字转整数","frequency":4.2089670059,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"ac","submitted":822887,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.4147865635831083,"acs":693755,"articleLive":2,"columnArticles":4329,"formTitle":"[14]最长公共前缀","frequency":4.4902239979,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"ac","submitted":1672559,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.341628523752916,"acs":748916,"articleLive":2,"columnArticles":3509,"formTitle":"[15]三数之和","frequency":4.3370345455,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"ac","submitted":2192194,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.45829780030092987,"acs":289663,"articleLive":2,"columnArticles":1587,"formTitle":"[16]最接近的三数之和","frequency":4.1504279831,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","submitted":632041,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.5750993056096436,"acs":383957,"articleLive":2,"columnArticles":3459,"formTitle":"[17]电话号码的字母组合","frequency":3.6119237368,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"ac","submitted":667636,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.3946184360879853,"acs":248992,"articleLive":2,"columnArticles":1711,"formTitle":"[18]四数之和","frequency":3.4807898118,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"ac","submitted":630969,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.43293366959026575,"acs":603584,"articleLive":2,"columnArticles":4478,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":3.6318699541,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"ac","submitted":1394172,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.4455060695118511,"acs":879670,"articleLive":2,"columnArticles":6206,"formTitle":"[20]有效的括号","frequency":4.3638609459,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"ac","submitted":1974541,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6669130331722348,"acs":810294,"articleLive":2,"columnArticles":3922,"formTitle":"[21]合并两个有序链表","frequency":4.0824861961,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"ac","submitted":1214992,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.772948051418395,"acs":398001,"articleLive":2,"columnArticles":2966,"formTitle":"[22]括号生成","frequency":4.389081229,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"ac","submitted":514913,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5621855408544096,"acs":366943,"articleLive":2,"columnArticles":2358,"formTitle":"[23]合并K个升序链表","frequency":3.9297969861,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"ac","submitted":652708,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7045900951204251,"acs":355849,"articleLive":2,"columnArticles":2804,"formTitle":"[24]两两交换链表中的节点","frequency":3.0255448413,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"ac","submitted":505044,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6587037589308701,"acs":258422,"articleLive":2,"columnArticles":2440,"formTitle":"[25]K 个一组翻转链表","frequency":4.1352416624,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"ac","submitted":392319,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5364300074314088,"acs":916017,"articleLive":2,"columnArticles":5032,"formTitle":"[26]删除有序数组中的重复项","frequency":3.6991945059,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"ac","submitted":1707617,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5958010320490972,"acs":548896,"articleLive":2,"columnArticles":4568,"formTitle":"[27]移除元素","frequency":3.4556015153,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"ac","submitted":921274,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.4032177027099257,"acs":528066,"articleLive":2,"columnArticles":3584,"formTitle":"[28]实现 strStr()","frequency":3.2083183383,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"ac","submitted":1309630,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.22041244309178257,"acs":140207,"articleLive":2,"columnArticles":1106,"formTitle":"[29]两数相除","frequency":3.4095424208,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"ac","submitted":636112,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.3623136206804815,"acs":88523,"articleLive":2,"columnArticles":680,"formTitle":"[30]串联所有单词的子串","frequency":2.7528724314,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"notac","submitted":244327,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.3726519396320388,"acs":243019,"articleLive":2,"columnArticles":1960,"formTitle":"[31]下一个排列","frequency":3.7266939473,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"ac","submitted":652134,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.3577707386339767,"acs":212904,"articleLive":2,"columnArticles":1436,"formTitle":"[32]最长有效括号","frequency":3.661311188,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","submitted":595085,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.4304078862066862,"acs":416272,"articleLive":2,"columnArticles":2754,"formTitle":"[33]搜索旋转排序数组","frequency":3.5456105141,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"ac","submitted":967157,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.4227932070627492,"acs":401150,"articleLive":2,"columnArticles":3781,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":3.6269435445,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"ac","submitted":948809,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.4589788113507158,"acs":605830,"articleLive":2,"columnArticles":4503,"formTitle":"[35]搜索插入位置","frequency":3.4419397164,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"ac","submitted":1319952,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6377596059385939,"acs":230464,"articleLive":2,"columnArticles":1638,"formTitle":"[36]有效的数独","frequency":3.3389414794,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"ac","submitted":361365,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6701786694526588,"acs":113541,"articleLive":2,"columnArticles":959,"formTitle":"[37]解数独","frequency":3.0304113269,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","submitted":169419,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.5971768696328431,"acs":254936,"articleLive":2,"columnArticles":2685,"formTitle":"[38]外观数列","frequency":2.4035306476,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","questionId":"38","status":"ac","submitted":426902,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.7275234522642879,"acs":383813,"articleLive":2,"columnArticles":2237,"formTitle":"[39]组合总和","frequency":3.7396694762,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"ac","submitted":527561,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.6153787648311531,"acs":226548,"articleLive":2,"columnArticles":1544,"formTitle":"[40]组合总和 II","frequency":3.2227117357,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"ac","submitted":368144,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.4201408587123466,"acs":182184,"articleLive":2,"columnArticles":1545,"formTitle":"[41]缺失的第一个正数","frequency":4.1773787826,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"ac","submitted":433626,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5909813683145385,"acs":372034,"articleLive":2,"columnArticles":2721,"formTitle":"[42]接雨水","frequency":4.3942429304,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"ac","submitted":629519,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.4495738976396802,"acs":187805,"articleLive":2,"columnArticles":1268,"formTitle":"[43]字符串相乘","frequency":3.9267891032,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"ac","submitted":417740,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.32863931010116304,"acs":91156,"articleLive":2,"columnArticles":594,"formTitle":"[44]通配符匹配","frequency":2.9192737382,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","submitted":277374,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.435886094839459,"acs":242432,"articleLive":2,"columnArticles":1904,"formTitle":"[45]跳跃游戏 II","frequency":3.6835838237,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"ac","submitted":556182,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7842996909812612,"acs":479942,"articleLive":2,"columnArticles":3084,"formTitle":"[46]全排列","frequency":3.9536601085,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"ac","submitted":611937,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6414581023801761,"acs":245919,"articleLive":2,"columnArticles":1678,"formTitle":"[47]全排列 II","frequency":3.282514327,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"ac","submitted":383375,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7364140243831437,"acs":252970,"articleLive":2,"columnArticles":2110,"formTitle":"[48]旋转图像","frequency":3.3218461232,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"ac","submitted":343516,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6675955424199388,"acs":260893,"articleLive":2,"columnArticles":1491,"formTitle":"[49]字母异位词分组","frequency":2.7902553041,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"ac","submitted":390795,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.3774141244573979,"acs":243708,"articleLive":2,"columnArticles":1441,"formTitle":"[50]Pow(x, n)","frequency":3.5147928156,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"ac","submitted":645731,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7379478449276484,"acs":171657,"articleLive":2,"columnArticles":1699,"formTitle":"[51]N 皇后","frequency":3.6421626853,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"ac","submitted":232614,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.82202893788316,"acs":80050,"articleLive":2,"columnArticles":655,"formTitle":"[52]N皇后 II","frequency":0.4181180555,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","submitted":97381,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.552634369146395,"acs":797463,"articleLive":2,"columnArticles":4239,"formTitle":"[53]最大子数组和","frequency":4.0691357356,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"ac","submitted":1443021,"title":"最大子数组和","titleSlug":"maximum-subarray"},{"acceptance":0.48296126798583877,"acs":210220,"articleLive":2,"columnArticles":2220,"formTitle":"[54]螺旋矩阵","frequency":3.8160132878,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","submitted":435273,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.43428219281958,"acs":379134,"articleLive":2,"columnArticles":2883,"formTitle":"[55]跳跃游戏","frequency":3.3502697349,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"ac","submitted":873013,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.4745034585867742,"acs":343401,"articleLive":2,"columnArticles":2620,"formTitle":"[56]合并区间","frequency":4.2430883645,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"ac","submitted":723706,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.4131631379589692,"acs":94352,"articleLive":2,"columnArticles":995,"formTitle":"[57]插入区间","frequency":1.712728134,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","submitted":228365,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.38590271343574467,"acs":273644,"articleLive":2,"columnArticles":2926,"formTitle":"[58]最后一个单词的长度","frequency":2.7414836515,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"ac","submitted":709101,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.781434127110969,"acs":146683,"articleLive":2,"columnArticles":1781,"formTitle":"[59]螺旋矩阵 II","frequency":3.5669015036,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","submitted":187710,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5265009123084702,"acs":95800,"articleLive":2,"columnArticles":1029,"formTitle":"[60]排列序列","frequency":1.9650996448,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","submitted":181956,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.41757132969912825,"acs":214787,"articleLive":2,"columnArticles":2191,"formTitle":"[61]旋转链表","frequency":2.4589269464,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"ac","submitted":514372,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.6655445920303605,"acs":350742,"articleLive":2,"columnArticles":2674,"formTitle":"[62]不同路径","frequency":3.1113431873,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"ac","submitted":527000,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.3957360220977328,"acs":204013,"articleLive":2,"columnArticles":1919,"formTitle":"[63]不同路径 II","frequency":2.6111759602,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","submitted":515528,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6895397722268831,"acs":297524,"articleLive":2,"columnArticles":2292,"formTitle":"[64]最小路径和","frequency":3.6570119553,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"ac","submitted":431482,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.27118475394337466,"acs":49050,"articleLive":2,"columnArticles":683,"formTitle":"[65]有效数字","frequency":2.062116643,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"ac","submitted":180873,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.46257512675480067,"acs":418309,"articleLive":2,"columnArticles":3800,"formTitle":"[66]加一","frequency":2.7682715654,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"ac","submitted":904305,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5408174138062257,"acs":213174,"articleLive":2,"columnArticles":1935,"formTitle":"[67]二进制求和","frequency":2.9728719126,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","submitted":394170,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.522117182494541,"acs":39931,"articleLive":2,"columnArticles":611,"formTitle":"[68]文本左右对齐","frequency":3.4143996287,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"ac","submitted":76479,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.3906438169165124,"acs":432397,"articleLive":2,"columnArticles":2188,"formTitle":"[69]Sqrt(x)","frequency":3.5926230862,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","submitted":1106883,"title":"Sqrt(x)","titleSlug":"sqrtx"},{"acceptance":0.5327241101159977,"acs":654483,"articleLive":2,"columnArticles":3963,"formTitle":"[70]爬楼梯","frequency":4.2985062256,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"ac","submitted":1228559,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.42219291014014837,"acs":102424,"articleLive":2,"columnArticles":925,"formTitle":"[71]简化路径","frequency":3.252153768,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"ac","submitted":242600,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6154460181388992,"acs":198149,"articleLive":2,"columnArticles":1376,"formTitle":"[72]编辑距离","frequency":4.0577672767,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"ac","submitted":321960,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6093553995022608,"acs":151072,"articleLive":2,"columnArticles":1120,"formTitle":"[73]矩阵置零","frequency":2.6524329771,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"ac","submitted":247921,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.46588395730942844,"acs":190629,"articleLive":2,"columnArticles":1907,"formTitle":"[74]搜索二维矩阵","frequency":2.5852033653,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"ac","submitted":409177,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5997993389990557,"acs":304890,"articleLive":2,"columnArticles":2100,"formTitle":"[75]颜色分类","frequency":2.5267601636,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","submitted":508320,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.43072912273090624,"acs":214454,"articleLive":2,"columnArticles":1477,"formTitle":"[76]最小覆盖子串","frequency":3.2667261873,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","submitted":497886,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.7687522759427626,"acs":257552,"articleLive":2,"columnArticles":1524,"formTitle":"[77]组合","frequency":3.1028208926,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"ac","submitted":335026,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8023288864438638,"acs":350024,"articleLive":2,"columnArticles":2296,"formTitle":"[78]子集","frequency":3.2547193193,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"ac","submitted":436260,"title":"子集","titleSlug":"subsets"},{"acceptance":0.4599042117578239,"acs":251586,"articleLive":2,"columnArticles":1584,"formTitle":"[79]单词搜索","frequency":2.6872837569,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"ac","submitted":547040,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6181280228923345,"acs":158985,"articleLive":2,"columnArticles":1415,"formTitle":"[80]删除有序数组中的重复项 II","frequency":2.6477779086,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"ac","submitted":257204,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.41426162696060514,"acs":134884,"articleLive":2,"columnArticles":1066,"formTitle":"[81]搜索旋转排序数组 II","frequency":2.2648969003,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"ac","submitted":325601,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5316644373243745,"acs":205097,"articleLive":2,"columnArticles":1874,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":3.3331495102,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"ac","submitted":385764,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.5374864746574594,"acs":353679,"articleLive":2,"columnArticles":2203,"formTitle":"[83]删除排序链表中的重复元素","frequency":2.7734601829,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"ac","submitted":658024,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.4347674411092711,"acs":201896,"articleLive":2,"columnArticles":1282,"formTitle":"[84]柱状图中最大的矩形","frequency":3.5333413071,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"ac","submitted":464377,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5186192922787467,"acs":107502,"articleLive":2,"columnArticles":757,"formTitle":"[85]最大矩形","frequency":2.4878976863,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"ac","submitted":207285,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6329333631528281,"acs":130183,"articleLive":2,"columnArticles":1217,"formTitle":"[86]分隔链表","frequency":2.2369794545,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"ac","submitted":205682,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.4848598833928907,"acs":43826,"articleLive":2,"columnArticles":331,"formTitle":"[87]扰乱字符串","frequency":0.4442975611,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"ac","submitted":90389,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.519340740857033,"acs":529283,"articleLive":2,"columnArticles":3673,"formTitle":"[88]合并两个有序数组","frequency":4.2870979898,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"ac","submitted":1019144,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7127996731340481,"acs":64549,"articleLive":2,"columnArticles":535,"formTitle":"[89]格雷编码","frequency":2.4185938956,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"ac","submitted":90557,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6339051586815341,"acs":155199,"articleLive":2,"columnArticles":1351,"formTitle":"[90]子集 II","frequency":2.4589269464,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"ac","submitted":244830,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.3140523714500701,"acs":179887,"articleLive":2,"columnArticles":1644,"formTitle":"[91]解码方法","frequency":3.1393861277,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"ac","submitted":572793,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5498570926909132,"acs":236438,"articleLive":2,"columnArticles":2214,"formTitle":"[92]反转链表 II","frequency":3.8160132878,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"ac","submitted":429999,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5477229544716933,"acs":173827,"articleLive":2,"columnArticles":1503,"formTitle":"[93]复原 IP 地址","frequency":3.8591699309,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"ac","submitted":317363,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.7556384494923724,"acs":644178,"articleLive":2,"columnArticles":2633,"formTitle":"[94]二叉树的中序遍历","frequency":3.0487043805,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","questionId":"94","status":"ac","submitted":852495,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.7077590787174252,"acs":110564,"articleLive":2,"columnArticles":685,"formTitle":"[95]不同的二叉搜索树 II","frequency":2.9927661381,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","submitted":156217,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.699704092080244,"acs":186567,"articleLive":2,"columnArticles":1464,"formTitle":"[96]不同的二叉搜索树","frequency":3.3766276186,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","submitted":266637,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.454411052990977,"acs":68542,"articleLive":2,"columnArticles":590,"formTitle":"[97]交错字符串","frequency":2.0524191271,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","submitted":150837,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.35288747389523567,"acs":396588,"articleLive":2,"columnArticles":2187,"formTitle":"[98]验证二叉搜索树","frequency":3.2422404279,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"ac","submitted":1123837,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6081885763383018,"acs":81403,"articleLive":2,"columnArticles":667,"formTitle":"[99]恢复二叉搜索树","frequency":1.9963034245,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","questionId":"99","status":"","submitted":133845,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.5992667148094895,"acs":279658,"articleLive":2,"columnArticles":2073,"formTitle":"[100]相同的树","frequency":2.5549469226,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","submitted":466667,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.5674204227826525,"acs":466705,"articleLive":2,"columnArticles":2544,"formTitle":"[101]对称二叉树","frequency":3.2213637904,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"ac","submitted":822503,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6423711954306691,"acs":450766,"articleLive":2,"columnArticles":2822,"formTitle":"[102]二叉树的层序遍历","frequency":4.2004988378,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"ac","submitted":701722,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5717957535619208,"acs":192877,"articleLive":2,"columnArticles":1728,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":3.3996473789,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"ac","submitted":337318,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7671760081324766,"acs":578084,"articleLive":2,"columnArticles":2841,"formTitle":"[104]二叉树的最大深度","frequency":3.4547602318,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"ac","submitted":753522,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7064386171077431,"acs":280738,"articleLive":2,"columnArticles":1604,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":3.2468929515,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"","submitted":397399,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.7216470678288825,"acs":150843,"articleLive":2,"columnArticles":1003,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":3.4143996287,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"","submitted":209026,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.7019695280564846,"acs":177566,"articleLive":2,"columnArticles":1437,"formTitle":"[107]二叉树的层序遍历 II","frequency":2.5152591743,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","submitted":252954,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7622311856794467,"acs":213161,"articleLive":2,"columnArticles":1310,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":2.6271074744,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"ac","submitted":279654,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7621784407123317,"acs":102247,"articleLive":2,"columnArticles":796,"formTitle":"[109]有序链表转换二叉搜索树","frequency":2.5724789284,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"ac","submitted":134151,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5647051639641343,"acs":286685,"articleLive":2,"columnArticles":1622,"formTitle":"[110]平衡二叉树","frequency":2.7804223832,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"ac","submitted":507672,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.49138143511509025,"acs":307022,"articleLive":2,"columnArticles":2019,"formTitle":"[111]二叉树的最小深度","frequency":2.326125304,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","submitted":624814,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5273570644991319,"acs":305258,"articleLive":2,"columnArticles":1914,"formTitle":"[112]路径总和","frequency":3.1305542286,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"ac","submitted":578845,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6283038566419945,"acs":201607,"articleLive":2,"columnArticles":1417,"formTitle":"[113]路径总和 II","frequency":2.5852033653,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","submitted":320875,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.726825381947699,"acs":201617,"articleLive":2,"columnArticles":1514,"formTitle":"[114]二叉树展开为链表","frequency":2.1330348198,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","submitted":277394,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5206617206859706,"acs":68706,"articleLive":2,"columnArticles":739,"formTitle":"[115]不同的子序列","frequency":2.8242067375,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","submitted":131959,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7076013259002562,"acs":187854,"articleLive":2,"columnArticles":1428,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":2.5948599891,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"ac","submitted":265480,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6223090803364286,"acs":103808,"articleLive":2,"columnArticles":882,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":1.2634159152,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"ac","submitted":166811,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7375890555180026,"acs":246607,"articleLive":2,"columnArticles":1983,"formTitle":"[118]杨辉三角","frequency":3.1986876661,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"ac","submitted":334342,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6741897034066658,"acs":164596,"articleLive":2,"columnArticles":1361,"formTitle":"[119]杨辉三角 II","frequency":2.157944776,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"ac","submitted":244139,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6831249697648222,"acs":197695,"articleLive":2,"columnArticles":1736,"formTitle":"[120]三角形最小路径和","frequency":2.1516538645,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"ac","submitted":289398,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5737853982160487,"acs":632918,"articleLive":2,"columnArticles":3813,"formTitle":"[121]买卖股票的最佳时机","frequency":4.1809382653,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"ac","submitted":1103057,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.692328215252858,"acs":518990,"articleLive":2,"columnArticles":2931,"formTitle":"[122]买卖股票的最佳时机 II","frequency":2.8641960721,"frontendQuestionId":"122","leaf":true,"level":2,"nodeType":"def","questionId":"122","status":"ac","submitted":749630,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5420203974836327,"acs":143972,"articleLive":2,"columnArticles":899,"formTitle":"[123]买卖股票的最佳时机 III","frequency":3.1966984074,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"","submitted":265621,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.4463559353658992,"acs":179415,"articleLive":2,"columnArticles":1218,"formTitle":"[124]二叉树中的最大路径和","frequency":4.0192389568,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"ac","submitted":401955,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.471476038397552,"acs":306921,"articleLive":2,"columnArticles":2021,"formTitle":"[125]验证回文串","frequency":2.8306281299,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","submitted":650979,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.39850325551850085,"acs":40150,"articleLive":2,"columnArticles":360,"formTitle":"[126]单词接龙 II","frequency":1.6786996721,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","submitted":100752,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.47144827978552434,"acs":132592,"articleLive":2,"columnArticles":713,"formTitle":"[127]单词接龙","frequency":1.6143688138,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","submitted":281244,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5452776016589929,"acs":196945,"articleLive":2,"columnArticles":1307,"formTitle":"[128]最长连续序列","frequency":3.9206017304,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","questionId":"128","status":"","submitted":361183,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6865115943745527,"acs":133313,"articleLive":2,"columnArticles":1240,"formTitle":"[129]求根节点到叶节点数字之和","frequency":2.8836066195,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","submitted":194189,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.44925266726648383,"acs":144304,"articleLive":2,"columnArticles":1306,"formTitle":"[130]被围绕的区域","frequency":2.3385896309,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"ac","submitted":321209,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7235506722567587,"acs":150144,"articleLive":2,"columnArticles":996,"formTitle":"[131]分割回文串","frequency":2.8242067375,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","submitted":207510,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.4930638872225555,"acs":52604,"articleLive":2,"columnArticles":470,"formTitle":"[132]分割回文串 II","frequency":2.1436281392,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","submitted":106688,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6782674889023838,"acs":79301,"articleLive":2,"columnArticles":563,"formTitle":"[133]克隆图","frequency":1.5544706722,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"ac","submitted":116917,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.5655966066467993,"acs":139876,"articleLive":2,"columnArticles":1059,"formTitle":"[134]加油站","frequency":3.4588439815,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"ac","submitted":247307,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.4866383719664817,"acs":111793,"articleLive":2,"columnArticles":900,"formTitle":"[135]分发糖果","frequency":4.1937760712,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"ac","submitted":229725,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7192495310524814,"acs":564421,"articleLive":2,"columnArticles":2568,"formTitle":"[136]只出现一次的数字","frequency":3.9625469912,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"ac","submitted":784736,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.720369164529375,"acs":108417,"articleLive":2,"columnArticles":813,"formTitle":"[137]只出现一次的数字 II","frequency":2.1436281392,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"ac","submitted":150502,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6635437511369838,"acs":124015,"articleLive":2,"columnArticles":934,"formTitle":"[138]复制带随机指针的链表","frequency":3.1663746771,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"ac","submitted":186898,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5198345838065273,"acs":223375,"articleLive":2,"columnArticles":1400,"formTitle":"[139]单词拆分","frequency":3.489742423,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"ac","submitted":429704,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.5041420937029799,"acs":58300,"articleLive":2,"columnArticles":620,"formTitle":"[140]单词拆分 II","frequency":1.2911800528,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","submitted":115642,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.5131638947920879,"acs":596435,"articleLive":2,"columnArticles":3062,"formTitle":"[141]环形链表","frequency":3.262974823,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"ac","submitted":1162270,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5547758552440025,"acs":339160,"articleLive":2,"columnArticles":1964,"formTitle":"[142]环形链表 II","frequency":3.0626548509,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"ac","submitted":611346,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6261815798098984,"acs":143286,"articleLive":2,"columnArticles":1205,"formTitle":"[143]重排链表","frequency":3.9690608235,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"ac","submitted":228825,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7050275259067358,"acs":470259,"articleLive":2,"columnArticles":2085,"formTitle":"[144]二叉树的前序遍历","frequency":1.9963034245,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","questionId":"144","status":"ac","submitted":667008,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.7525294842149247,"acs":343988,"articleLive":2,"columnArticles":1758,"formTitle":"[145]二叉树的后序遍历","frequency":3.2386604718,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","questionId":"145","status":"ac","submitted":457109,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5243144453090812,"acs":264794,"articleLive":2,"columnArticles":1551,"formTitle":"[146]LRU 缓存","frequency":4.129338806,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","submitted":505029,"title":"LRU 缓存","titleSlug":"lru-cache"},{"acceptance":0.6839175520071251,"acs":107505,"articleLive":2,"columnArticles":832,"formTitle":"[147]对链表进行插入排序","frequency":2.3233778986,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"ac","submitted":157190,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6663564740808404,"acs":233438,"articleLive":2,"columnArticles":1383,"formTitle":"[148]排序链表","frequency":3.353065438,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"ac","submitted":350320,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.3514190545097129,"acs":51485,"articleLive":2,"columnArticles":553,"formTitle":"[149]直线上最多的点数","frequency":2.5486512584,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"ac","submitted":146506,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5346868363256815,"acs":147534,"articleLive":2,"columnArticles":1162,"formTitle":"[150]逆波兰表达式求值","frequency":2.5486512584,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"ac","submitted":275926,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.49066985157510057,"acs":192268,"articleLive":2,"columnArticles":1582,"formTitle":"[151]翻转字符串里的单词","frequency":2.4878976863,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","submitted":391848,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.423022698004846,"acs":207933,"articleLive":2,"columnArticles":1379,"formTitle":"[152]乘积最大子数组","frequency":3.7435319389,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","submitted":491541,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5682058009177687,"acs":234769,"articleLive":2,"columnArticles":1648,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":1.3727187537,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"ac","submitted":413176,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5308769273606906,"acs":122021,"articleLive":2,"columnArticles":963,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":1.7058163011,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"ac","submitted":229848,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5754695570867036,"acs":316960,"articleLive":2,"columnArticles":1748,"formTitle":"[155]最小栈","frequency":3.3075031335,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"ac","submitted":550785,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7224898824436308,"acs":7498,"articleLive":2,"columnArticles":140,"formTitle":"[156]上下翻转二叉树","frequency":0.4442975611,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"","submitted":10378,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5354816294623469,"acs":6165,"articleLive":2,"columnArticles":88,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"","submitted":11513,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5969445492267069,"acs":3165,"articleLive":2,"columnArticles":74,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":0.4716067405,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","questionId":"158","status":"","submitted":5302,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5500212856534695,"acs":18088,"articleLive":2,"columnArticles":215,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":1.3496762595,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","questionId":"159","status":"ac","submitted":32886,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.618697532392777,"acs":377270,"articleLive":2,"columnArticles":2187,"formTitle":"[160]相交链表","frequency":2.6850678369,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"ac","submitted":609781,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.33772493573264784,"acs":8408,"articleLive":2,"columnArticles":116,"formTitle":"[161]相隔为 1 的编辑距离","frequency":0.4442975611,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"","submitted":24896,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.49636695289006766,"acs":180414,"articleLive":2,"columnArticles":1212,"formTitle":"[162]寻找峰值","frequency":3.3148796115,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"ac","submitted":363469,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.33343966314714985,"acs":10453,"articleLive":2,"columnArticles":158,"formTitle":"[163]缺失的区间","frequency":1.4125900849,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"","submitted":31349,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.608886313145948,"acs":63038,"articleLive":2,"columnArticles":531,"formTitle":"[164]最大间距","frequency":2.4560782663,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","submitted":103530,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.5211543630173804,"acs":93074,"articleLive":2,"columnArticles":966,"formTitle":"[165]比较版本号","frequency":3.8083805369,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"ac","submitted":178592,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.33130841818100504,"acs":44449,"articleLive":2,"columnArticles":397,"formTitle":"[166]分数到小数","frequency":2.8492153347,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","submitted":134162,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5872700846123233,"acs":339401,"articleLive":2,"columnArticles":2227,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":3.2754908398,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"ac","submitted":577930,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.43398250928185506,"acs":91408,"articleLive":2,"columnArticles":812,"formTitle":"[168]Excel表列名称","frequency":2.0286164134,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"ac","submitted":210626,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.665323010840473,"acs":430293,"articleLive":2,"columnArticles":2399,"formTitle":"[169]多数元素","frequency":3.1663746771,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","submitted":646743,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.42327701104948623,"acs":9845,"articleLive":2,"columnArticles":100,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":1.0182071603,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"ac","submitted":23259,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7174792048146088,"acs":114806,"articleLive":2,"columnArticles":980,"formTitle":"[171]Excel 表列序号","frequency":2.6333759084,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"ac","submitted":160013,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.4458439559934771,"acs":97058,"articleLive":2,"columnArticles":634,"formTitle":"[172]阶乘后的零","frequency":2.602439228,"frontendQuestionId":"172","leaf":true,"level":2,"nodeType":"def","questionId":"172","status":"","submitted":217695,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8058384114414513,"acs":80799,"articleLive":2,"columnArticles":679,"formTitle":"[173]二叉搜索树迭代器","frequency":1.6786996721,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"ac","submitted":100267,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.4805299782104449,"acs":41019,"articleLive":2,"columnArticles":435,"formTitle":"[174]地下城游戏","frequency":3.1663746771,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","submitted":85362,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7361993377277946,"acs":332154,"articleLive":2,"columnArticles":1570,"formTitle":"[175]组合两个表","frequency":4.4327712503,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","submitted":451174,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.3542934679282334,"acs":272074,"articleLive":2,"columnArticles":1103,"formTitle":"[176]第二高的薪水","frequency":4.0677553741,"frontendQuestionId":"176","leaf":true,"level":2,"nodeType":"def","questionId":"176","status":"","submitted":767934,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.46311229744632515,"acs":139840,"articleLive":2,"columnArticles":547,"formTitle":"[177]第N高的薪水","frequency":3.536439203,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","submitted":301957,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6037543339658269,"acs":130775,"articleLive":2,"columnArticles":710,"formTitle":"[178]分数排名","frequency":2.680481935,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","submitted":216603,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.4097391598385678,"acs":130867,"articleLive":2,"columnArticles":1038,"formTitle":"[179]最大数","frequency":3.3808956575,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"ac","submitted":319391,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.4848317453882019,"acs":95667,"articleLive":2,"columnArticles":553,"formTitle":"[180]连续出现的数字","frequency":3.5030228307,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","submitted":197320,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.6965049887313817,"acs":180174,"articleLive":2,"columnArticles":728,"formTitle":"[181]超过经理收入的员工","frequency":3.3541635428,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","submitted":258683,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7943453735057154,"acs":197286,"articleLive":2,"columnArticles":643,"formTitle":"[182]查找重复的电子邮箱","frequency":3.1369694417,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","submitted":248363,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.674038083377032,"acs":164530,"articleLive":2,"columnArticles":597,"formTitle":"[183]从不订购的客户","frequency":2.8492153347,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","submitted":244096,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.4824939986172127,"acs":112355,"articleLive":2,"columnArticles":730,"formTitle":"[184]部门工资最高的员工","frequency":3.0304113269,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","submitted":232863,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.5016139112058913,"acs":77857,"articleLive":2,"columnArticles":686,"formTitle":"[185]部门工资前三高的所有员工","frequency":3.6308210213,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","submitted":155213,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7583468687962461,"acs":8404,"articleLive":2,"columnArticles":129,"formTitle":"[186]翻转字符串里的单词 II","frequency":0.988662914,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"","submitted":11082,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.5232926736489742,"acs":82540,"articleLive":2,"columnArticles":602,"formTitle":"[187]重复的DNA序列","frequency":3.3228098672,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"ac","submitted":157732,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.3987077890487735,"acs":99167,"articleLive":2,"columnArticles":775,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":2.9430771731,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"","submitted":248721,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.4463288006022791,"acs":399583,"articleLive":2,"columnArticles":1998,"formTitle":"[189]轮转数组","frequency":3.6735213519,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"ac","submitted":895266,"title":"轮转数组","titleSlug":"rotate-array"},{"acceptance":0.7021446746637586,"acs":144870,"articleLive":2,"columnArticles":909,"formTitle":"[190]颠倒二进制位","frequency":1.8500579241,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"ac","submitted":206325,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7510446146913023,"acs":208321,"articleLive":2,"columnArticles":1314,"formTitle":"[191]位1的个数","frequency":1.3199121576,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"ac","submitted":277375,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.35720257632996844,"acs":23071,"articleLive":2,"columnArticles":181,"formTitle":"[192]统计词频","frequency":2.112207242,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","submitted":64588,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.32695570216776626,"acs":27752,"articleLive":2,"columnArticles":148,"formTitle":"[193]有效电话号码","frequency":1.6459420757,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","submitted":84880,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.34706436420722137,"acs":11054,"articleLive":2,"columnArticles":75,"formTitle":"[194]转置文件","frequency":1.3805429075,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","submitted":31850,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.43780774009479545,"acs":38056,"articleLive":2,"columnArticles":152,"formTitle":"[195]第十行","frequency":1.9349344781,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","submitted":86924,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6646875,"acs":110604,"articleLive":2,"columnArticles":433,"formTitle":"[196]删除重复的电子邮箱","frequency":2.9469188989,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","submitted":166400,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5331850988201426,"acs":103351,"articleLive":2,"columnArticles":563,"formTitle":"[197]上升的温度","frequency":3.0397836424,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","submitted":193837,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.5211231030827351,"acs":439485,"articleLive":2,"columnArticles":3012,"formTitle":"[198]打家劫舍","frequency":3.6943232198,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"ac","submitted":843342,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.652747772351891,"acs":160136,"articleLive":2,"columnArticles":1770,"formTitle":"[199]二叉树的右视图","frequency":2.9339190408,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"ac","submitted":245326,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5641056591019852,"acs":373874,"articleLive":2,"columnArticles":2349,"formTitle":"[200]岛屿数量","frequency":4.1970507543,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"ac","submitted":662773,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5285652370914679,"acs":53661,"articleLive":2,"columnArticles":351,"formTitle":"[201]数字范围按位与","frequency":1.3805429075,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"ac","submitted":101522,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6215372128885642,"acs":191449,"articleLive":2,"columnArticles":1546,"formTitle":"[202]快乐数","frequency":2.8836066195,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"ac","submitted":308025,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5230195587243472,"acs":271421,"articleLive":2,"columnArticles":1884,"formTitle":"[203]移除链表元素","frequency":1.5779349115,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"ac","submitted":518950,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.37740419908970785,"acs":179935,"articleLive":2,"columnArticles":771,"formTitle":"[204]计数质数","frequency":2.6504607454,"frontendQuestionId":"204","leaf":true,"level":2,"nodeType":"def","questionId":"204","status":"","submitted":476770,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.49932893525745775,"acs":123146,"articleLive":2,"columnArticles":955,"formTitle":"[205]同构字符串","frequency":2.3540530595,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"ac","submitted":246623,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7246879817370847,"acs":811394,"articleLive":2,"columnArticles":7801,"formTitle":"[206]反转链表","frequency":3.9735865373,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"ac","submitted":1119646,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.540691761625858,"acs":161091,"articleLive":2,"columnArticles":1047,"formTitle":"[207]课程表","frequency":3.1205581437,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","submitted":297935,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.718775095501555,"acs":162004,"articleLive":2,"columnArticles":1087,"formTitle":"[208]实现 Trie (前缀树)","frequency":2.749284855,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"ac","submitted":225389,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.47757891338190805,"acs":232228,"articleLive":2,"columnArticles":1621,"formTitle":"[209]长度最小的子数组","frequency":3.0431800387,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"ac","submitted":486261,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.5468695130713834,"acs":101225,"articleLive":2,"columnArticles":762,"formTitle":"[210]课程表 II","frequency":2.1330348198,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","submitted":185099,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.5110496692011455,"acs":51754,"articleLive":2,"columnArticles":565,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":1.4459042916,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"ac","submitted":101270,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.4639988346443584,"acs":66891,"articleLive":2,"columnArticles":601,"formTitle":"[212]单词搜索 II","frequency":1.712728134,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"ac","submitted":144162,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.4343716614232346,"acs":191501,"articleLive":2,"columnArticles":1734,"formTitle":"[213]打家劫舍 II","frequency":3.0785219033,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"ac","submitted":440869,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.37490099345991085,"acs":33133,"articleLive":2,"columnArticles":335,"formTitle":"[214]最短回文串","frequency":2.5903413307,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","submitted":88378,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.6464904965925755,"acs":494626,"articleLive":2,"columnArticles":2560,"formTitle":"[215]数组中的第K个最大元素","frequency":4.1461125163,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"ac","submitted":765094,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7352563691201951,"acs":114575,"articleLive":2,"columnArticles":1162,"formTitle":"[216]组合总和 III","frequency":2.9870044259,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","submitted":155830,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5557775431293158,"acs":438972,"articleLive":2,"columnArticles":2034,"formTitle":"[217]存在重复元素","frequency":4.4712995702,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"ac","submitted":789834,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5417259402522258,"acs":33892,"articleLive":2,"columnArticles":299,"formTitle":"[218]天际线问题","frequency":3.7475715323,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"ac","submitted":62563,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.42216018822098694,"acs":122193,"articleLive":2,"columnArticles":1007,"formTitle":"[219]存在重复元素 II","frequency":2.2720093059,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"ac","submitted":289447,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.2869642462434158,"acs":68808,"articleLive":2,"columnArticles":454,"formTitle":"[220]存在重复元素 III","frequency":2.0968906614,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"ac","submitted":239779,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.4796106909590925,"acs":156261,"articleLive":2,"columnArticles":1109,"formTitle":"[221]最大正方形","frequency":3.4043649251,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","submitted":325808,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7853217545683367,"acs":134473,"articleLive":2,"columnArticles":991,"formTitle":"[222]完全二叉树的节点个数","frequency":2.0818255979,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","submitted":171233,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.5253448380628304,"acs":43228,"articleLive":2,"columnArticles":534,"formTitle":"[223]矩形面积","frequency":3.2937934901,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"ac","submitted":82285,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.4175705401515357,"acs":76881,"articleLive":2,"columnArticles":698,"formTitle":"[224]基本计算器","frequency":3.1100851989,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"ac","submitted":184115,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.6746684520668815,"acs":152160,"articleLive":2,"columnArticles":4844,"formTitle":"[225]用队列实现栈","frequency":1.9963034245,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"ac","submitted":225533,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7883059882748956,"acs":349877,"articleLive":2,"columnArticles":2098,"formTitle":"[226]翻转二叉树","frequency":3.585070608,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"ac","submitted":443834,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.4371889685991007,"acs":94703,"articleLive":2,"columnArticles":758,"formTitle":"[227]基本计算器 II","frequency":2.9992086292,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"ac","submitted":216618,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5764071333747992,"acs":62090,"articleLive":2,"columnArticles":705,"formTitle":"[228]汇总区间","frequency":0.4442975611,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","submitted":107719,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.5343599241258793,"acs":71554,"articleLive":2,"columnArticles":672,"formTitle":"[229]求众数 II","frequency":2.9168543627,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"ac","submitted":133906,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7523092037805302,"acs":175355,"articleLive":2,"columnArticles":1198,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":0.8089232152,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"ac","submitted":233089,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.504759947034577,"acs":189075,"articleLive":2,"columnArticles":1348,"formTitle":"[231]2 的幂","frequency":0.0,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"ac","submitted":374584,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6895754742043462,"acs":181699,"articleLive":2,"columnArticles":1420,"formTitle":"[232]用栈实现队列","frequency":2.4633264256,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"ac","submitted":263494,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.4772718379485307,"acs":36591,"articleLive":2,"columnArticles":446,"formTitle":"[233]数字 1 的个数","frequency":3.1997834966,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"ac","submitted":76667,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.5024462689332531,"acs":347114,"articleLive":2,"columnArticles":2187,"formTitle":"[234]回文链表","frequency":3.3075031335,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"ac","submitted":690848,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.6681574239713775,"acs":191232,"articleLive":2,"columnArticles":1105,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":2.602439228,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"ac","submitted":286208,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6834866665422584,"acs":293008,"articleLive":2,"columnArticles":1583,"formTitle":"[236]二叉树的最近公共祖先","frequency":3.4626404932,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","submitted":428696,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.8568763441038368,"acs":258589,"articleLive":2,"columnArticles":1358,"formTitle":"[237]删除链表中的节点","frequency":2.3954958944,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"ac","submitted":301781,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7254589249254335,"acs":154205,"articleLive":2,"columnArticles":974,"formTitle":"[238]除自身以外数组的乘积","frequency":2.6524329771,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","submitted":212562,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.49692653909812073,"acs":220374,"articleLive":2,"columnArticles":1502,"formTitle":"[239]滑动窗口最大值","frequency":3.4468173783,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"ac","submitted":443474,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.4983489385392091,"acs":222000,"articleLive":2,"columnArticles":1126,"formTitle":"[240]搜索二维矩阵 II","frequency":3.2343818413,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"ac","submitted":445471,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7357732044659223,"acs":35323,"articleLive":2,"columnArticles":324,"formTitle":"[241]为运算表达式设计优先级","frequency":2.6135727209,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","submitted":48008,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6477329259799015,"acs":332013,"articleLive":2,"columnArticles":1920,"formTitle":"[242]有效的字母异位词","frequency":2.2342333317,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"ac","submitted":512577,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.657249966528317,"acs":9818,"articleLive":2,"columnArticles":119,"formTitle":"[243]最短单词距离","frequency":0.4442975611,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"","submitted":14938,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.5604267701260912,"acs":5778,"articleLive":2,"columnArticles":69,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"","submitted":10310,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.5951261751608115,"acs":4811,"articleLive":2,"columnArticles":67,"formTitle":"[245]最短单词距离 III","frequency":1.0489221055,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"","submitted":8084,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.4765809692671395,"acs":6451,"articleLive":2,"columnArticles":118,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"","submitted":13536,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5270616200402267,"acs":5765,"articleLive":2,"columnArticles":100,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"","submitted":10938,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.4679092382495948,"acs":2887,"articleLive":2,"columnArticles":55,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"","submitted":6170,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.6406448461162677,"acs":6557,"articleLive":2,"columnArticles":114,"formTitle":"[249]移位字符串分组","frequency":1.0182071603,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"ac","submitted":10235,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6373569867592236,"acs":4958,"articleLive":2,"columnArticles":85,"formTitle":"[250]统计同值子树","frequency":0.4442975611,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"","submitted":7779,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5503206386598612,"acs":4205,"articleLive":2,"columnArticles":76,"formTitle":"[251]展开二维向量","frequency":0.4716067405,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"","submitted":7641,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.56442124451073,"acs":13624,"articleLive":2,"columnArticles":170,"formTitle":"[252]会议室","frequency":0.0,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"","submitted":24138,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.5058040593826528,"acs":36558,"articleLive":2,"columnArticles":388,"formTitle":"[253]会议室 II","frequency":2.9430771731,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"","submitted":72277,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5686910096291353,"acs":5965,"articleLive":2,"columnArticles":85,"formTitle":"[254]因子的组合","frequency":1.0182071603,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"","submitted":10489,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.47821749251745926,"acs":5752,"articleLive":2,"columnArticles":71,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"","submitted":12028,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.6467345833948521,"acs":13141,"articleLive":2,"columnArticles":210,"formTitle":"[256]粉刷房子","frequency":0.4716067405,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"","submitted":20319,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.687004244736955,"acs":160230,"articleLive":2,"columnArticles":1169,"formTitle":"[257]二叉树的所有路径","frequency":2.6378787979,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"ac","submitted":233230,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6917009321298101,"acs":84447,"articleLive":2,"columnArticles":710,"formTitle":"[258]各位相加","frequency":2.4878976863,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","submitted":122086,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5611449624486325,"acs":7920,"articleLive":2,"columnArticles":95,"formTitle":"[259]较小的三数之和","frequency":0.5299663557,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"","submitted":14114,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7405273347469347,"acs":80325,"articleLive":2,"columnArticles":716,"formTitle":"[260]只出现一次的数字 III","frequency":3.1522000953,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"ac","submitted":108470,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.49851647227337836,"acs":9745,"articleLive":2,"columnArticles":134,"formTitle":"[261]以图判树","frequency":1.4125900849,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"","submitted":19548,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.43069954187471043,"acs":41836,"articleLive":2,"columnArticles":397,"formTitle":"[262]行程和用户","frequency":2.9512914463,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","submitted":97135,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.5140552932507301,"acs":113013,"articleLive":2,"columnArticles":876,"formTitle":"[263]丑数","frequency":1.9963034245,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"ac","submitted":219846,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.581063679093426,"acs":108294,"articleLive":2,"columnArticles":669,"formTitle":"[264]丑数 II","frequency":2.7227988531,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","submitted":186372,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5992672315090452,"acs":7851,"articleLive":2,"columnArticles":174,"formTitle":"[265]粉刷房子 II","frequency":0.0,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"","submitted":13101,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6804480466259903,"acs":7472,"articleLive":2,"columnArticles":114,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"","submitted":10981,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.44911320080942746,"acs":3773,"articleLive":2,"columnArticles":81,"formTitle":"[267]回文排列 II","frequency":0.0,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"","submitted":8401,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6517340570231099,"acs":200287,"articleLive":2,"columnArticles":1549,"formTitle":"[268]丢失的数字","frequency":2.3233778986,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"ac","submitted":307314,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.3448161955547166,"acs":7307,"articleLive":2,"columnArticles":117,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"","submitted":21191,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.5641089978421238,"acs":11241,"articleLive":2,"columnArticles":149,"formTitle":"[270]最接近的二叉搜索树值","frequency":0.3456225535,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"","submitted":19927,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.557161629434954,"acs":2968,"articleLive":2,"columnArticles":50,"formTitle":"[271]字符串的编码与解码","frequency":0.5001312072,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"","submitted":5327,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.6477215402724062,"acs":3852,"articleLive":2,"columnArticles":87,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":0.0,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"","submitted":5947,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.36654703321369986,"acs":29720,"articleLive":2,"columnArticles":360,"formTitle":"[273]整数转换英文表示","frequency":2.5805565168,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"ac","submitted":81081,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.4403810766113065,"acs":56718,"articleLive":2,"columnArticles":597,"formTitle":"[274]H 指数","frequency":2.8836066195,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"ac","submitted":128793,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.4608394033992369,"acs":53144,"articleLive":2,"columnArticles":440,"formTitle":"[275]H 指数 II","frequency":2.062116643,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"ac","submitted":115320,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.4998364195511352,"acs":7639,"articleLive":2,"columnArticles":144,"formTitle":"[276]栅栏涂色","frequency":0.0,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"","submitted":15283,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.572458397897999,"acs":8497,"articleLive":2,"columnArticles":98,"formTitle":"[277]搜寻名人","frequency":0.4181180555,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"","submitted":14843,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.4524607668098721,"acs":233910,"articleLive":2,"columnArticles":1321,"formTitle":"[278]第一个错误的版本","frequency":3.9531672913,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"ac","submitted":516973,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6369177113930908,"acs":225723,"articleLive":2,"columnArticles":1318,"formTitle":"[279]完全平方数","frequency":3.2144608638,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"ac","submitted":354399,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6836745987825125,"acs":6177,"articleLive":2,"columnArticles":78,"formTitle":"[280]摆动排序","frequency":1.0182071603,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"ac","submitted":9035,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7571172095409079,"acs":2952,"articleLive":2,"columnArticles":74,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"","submitted":3899,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.4842491710090005,"acs":20445,"articleLive":2,"columnArticles":172,"formTitle":"[282]给表达式添加运算符","frequency":1.4459042916,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"ac","submitted":42220,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.6404260875723721,"acs":578730,"articleLive":2,"columnArticles":3769,"formTitle":"[283]移动零","frequency":3.9161784123,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"ac","submitted":903664,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.7702610803938381,"acs":26051,"articleLive":2,"columnArticles":219,"formTitle":"[284]窥探迭代器","frequency":1.8234606116,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"ac","submitted":33821,"title":"窥探迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6364903477594257,"acs":9133,"articleLive":2,"columnArticles":115,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"","submitted":14349,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.518610521254858,"acs":12944,"articleLive":2,"columnArticles":166,"formTitle":"[286]墙与门","frequency":0.0,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"ac","submitted":24959,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.6548332621348855,"acs":196209,"articleLive":2,"columnArticles":1331,"formTitle":"[287]寻找重复数","frequency":2.6111759602,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","submitted":299632,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.4470087385166928,"acs":3990,"articleLive":2,"columnArticles":64,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"ac","submitted":8926,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7543218174485818,"acs":56114,"articleLive":2,"columnArticles":857,"formTitle":"[289]生命游戏","frequency":1.6143688138,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","submitted":74390,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.45529069413744855,"acs":89807,"articleLive":2,"columnArticles":1193,"formTitle":"[290]单词规律","frequency":2.2098775248,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","submitted":197252,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.5262565641410353,"acs":2806,"articleLive":2,"columnArticles":62,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"","submitted":5332,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.7076318775983018,"acs":120342,"articleLive":2,"columnArticles":800,"formTitle":"[292]Nim 游戏","frequency":2.1436281392,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"ac","submitted":170063,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.713321867971954,"acs":5392,"articleLive":2,"columnArticles":89,"formTitle":"[293]翻转游戏","frequency":0.0,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"","submitted":7559,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5835640390499781,"acs":4005,"articleLive":2,"columnArticles":59,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"","submitted":6863,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.522864531946064,"acs":69953,"articleLive":2,"columnArticles":548,"formTitle":"[295]数据流的中位数","frequency":3.1821404143,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"ac","submitted":133788,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.621504887474426,"acs":2734,"articleLive":2,"columnArticles":52,"formTitle":"[296]最佳的碰头地点","frequency":1.1490055641,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"","submitted":4399,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.564019610165076,"acs":119073,"articleLive":2,"columnArticles":832,"formTitle":"[297]二叉树的序列化与反序列化","frequency":2.9430771731,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"ac","submitted":211115,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5834026622296173,"acs":5610,"articleLive":2,"columnArticles":88,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"","submitted":9616,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.5643208058071743,"acs":63981,"articleLive":2,"columnArticles":729,"formTitle":"[299]猜数字游戏","frequency":2.4878976863,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"ac","submitted":113377,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5222399512930684,"acs":404866,"articleLive":2,"columnArticles":2225,"formTitle":"[300]最长递增子序列","frequency":3.5669015036,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"ac","submitted":775249,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5478384264414596,"acs":55593,"articleLive":2,"columnArticles":400,"formTitle":"[301]删除无效的括号","frequency":2.9147423849,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"ac","submitted":101477,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.6590776415645068,"acs":2258,"articleLive":2,"columnArticles":42,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"","submitted":3426,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.7320063120882845,"acs":138235,"articleLive":2,"columnArticles":844,"formTitle":"[303]区域和检索 - 数组不可变","frequency":1.6143688138,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","submitted":188844,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.5590776729758815,"acs":70654,"articleLive":2,"columnArticles":628,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":1.5260111533,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","submitted":126376,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.3955253379713811,"acs":5003,"articleLive":2,"columnArticles":74,"formTitle":"[305]岛屿数量 II","frequency":0.4181180555,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"","submitted":12649,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.3386005347100581,"acs":18364,"articleLive":2,"columnArticles":275,"formTitle":"[306]累加数","frequency":2.2448705983,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","submitted":54235,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5301015621813435,"acs":25993,"articleLive":2,"columnArticles":250,"formTitle":"[307]区域和检索 - 数组可修改","frequency":0.4181180555,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"ac","submitted":49034,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6187282662692499,"acs":2491,"articleLive":2,"columnArticles":52,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"","submitted":4026,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.6165501755419253,"acs":133993,"articleLive":2,"columnArticles":1063,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":3.4016459805,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"","submitted":217327,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.3824830756242085,"acs":24464,"articleLive":2,"columnArticles":230,"formTitle":"[310]最小高度树","frequency":1.6143688138,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","submitted":63961,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7629767441860466,"acs":4101,"articleLive":2,"columnArticles":50,"formTitle":"[311]稀疏矩阵的乘法","frequency":1.0808941382,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"ac","submitted":5375,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6851280675875017,"acs":61308,"articleLive":2,"columnArticles":418,"formTitle":"[312]戳气球","frequency":2.7114796006,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","submitted":89484,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.615178888967921,"acs":43244,"articleLive":2,"columnArticles":375,"formTitle":"[313]超级丑数","frequency":2.5805565168,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"ac","submitted":70295,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5508958062256031,"acs":5504,"articleLive":2,"columnArticles":100,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"","submitted":9991,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.41758741560345974,"acs":53252,"articleLive":2,"columnArticles":500,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":2.6135727209,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"ac","submitted":127523,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.4769683705903809,"acs":73228,"articleLive":2,"columnArticles":588,"formTitle":"[316]去除重复字母","frequency":3.1305542286,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"ac","submitted":153528,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.4739027843322322,"acs":5021,"articleLive":2,"columnArticles":70,"formTitle":"[317]离建筑物最近的距离","frequency":0.4442975611,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"","submitted":10595,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.7365758641742013,"acs":50672,"articleLive":2,"columnArticles":493,"formTitle":"[318]最大单词长度乘积","frequency":2.4560782663,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","submitted":68794,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5707605073946338,"acs":48820,"articleLive":2,"columnArticles":443,"formTitle":"[319]灯泡开关","frequency":2.8160133283,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"ac","submitted":85535,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.6821526171957116,"acs":3245,"articleLive":2,"columnArticles":57,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"","submitted":4757,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.4232052409693367,"acs":27907,"articleLive":2,"columnArticles":240,"formTitle":"[321]拼接最大数","frequency":1.5167303442,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","submitted":65942,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.4483594313113059,"acs":343368,"articleLive":2,"columnArticles":1998,"formTitle":"[322]零钱兑换","frequency":3.443057622,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"ac","submitted":765832,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.631447883315546,"acs":12425,"articleLive":2,"columnArticles":166,"formTitle":"[323]无向图中连通分量的数目","frequency":1.4125900849,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"","submitted":19677,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.38025738241809015,"acs":27982,"articleLive":2,"columnArticles":184,"formTitle":"[324]摆动排序 II","frequency":1.6143688138,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"ac","submitted":73587,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5356534310941292,"acs":10374,"articleLive":2,"columnArticles":125,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":0.4181180555,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"","submitted":19367,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.5046868712099135,"acs":145477,"articleLive":2,"columnArticles":617,"formTitle":"[326]3 的幂","frequency":2.5177863427,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"ac","submitted":288252,"title":"3 的幂","titleSlug":"power-of-three"},{"acceptance":0.41814840488127286,"acs":25939,"articleLive":2,"columnArticles":217,"formTitle":"[327]区间和的个数","frequency":1.748123795,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","submitted":62033,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6548735101521647,"acs":139010,"articleLive":2,"columnArticles":1153,"formTitle":"[328]奇偶链表","frequency":3.0064602926,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"ac","submitted":212270,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.49094784232961347,"acs":61503,"articleLive":2,"columnArticles":538,"formTitle":"[329]矩阵中的最长递增路径","frequency":2.4878976863,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","submitted":125274,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5319305714753562,"acs":19491,"articleLive":2,"columnArticles":157,"formTitle":"[330]按要求补齐数组","frequency":1.4805818301,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","submitted":36642,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.4793957998739556,"acs":47162,"articleLive":2,"columnArticles":523,"formTitle":"[331]验证二叉树的前序序列化","frequency":0.9602114928,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"ac","submitted":98378,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.4512472818282526,"acs":43993,"articleLive":2,"columnArticles":361,"formTitle":"[332]重新安排行程","frequency":1.1853732082,"frontendQuestionId":"332","leaf":true,"level":3,"nodeType":"def","questionId":"332","status":"","submitted":97492,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.46887072140867847,"acs":5219,"articleLive":2,"columnArticles":90,"formTitle":"[333]最大 BST 子树","frequency":0.5299663557,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"","submitted":11131,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.41169997877875675,"acs":52381,"articleLive":2,"columnArticles":342,"formTitle":"[334]递增的三元子序列","frequency":2.3385896309,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","submitted":127231,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.4303840253763553,"acs":16553,"articleLive":2,"columnArticles":151,"formTitle":"[335]路径交叉","frequency":1.9589856614,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"ac","submitted":38461,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.40058062721646615,"acs":23043,"articleLive":2,"columnArticles":200,"formTitle":"[336]回文对","frequency":0.4716067405,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","submitted":57524,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6074231186037587,"acs":144051,"articleLive":2,"columnArticles":1007,"formTitle":"[337]打家劫舍 III","frequency":3.262974823,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","submitted":237151,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7867807957583519,"acs":175102,"articleLive":2,"columnArticles":1489,"formTitle":"[338]比特位计数","frequency":2.301685074,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"","submitted":222555,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8203337213814513,"acs":4228,"articleLive":2,"columnArticles":66,"formTitle":"[339]嵌套列表权重和","frequency":0.5299663557,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"","submitted":5154,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.496780727772553,"acs":13734,"articleLive":2,"columnArticles":202,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":1.4125900849,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","questionId":"340","status":"","submitted":27646,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.7262193082223858,"acs":54274,"articleLive":2,"columnArticles":508,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":1.5260111533,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"ac","submitted":74735,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.518003355704698,"acs":92619,"articleLive":2,"columnArticles":808,"formTitle":"[342]4的幂","frequency":1.3496762595,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"ac","submitted":178800,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.610286076938098,"acs":125011,"articleLive":2,"columnArticles":1162,"formTitle":"[343]整数拆分","frequency":3.3389414794,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"ac","submitted":204840,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.775133669704044,"acs":422013,"articleLive":2,"columnArticles":2220,"formTitle":"[344]反转字符串","frequency":3.0785219033,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"ac","submitted":544439,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5399801638596805,"acs":114877,"articleLive":2,"columnArticles":1088,"formTitle":"[345]反转字符串中的元音字母","frequency":2.7227988531,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"ac","submitted":212743,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7097563515201999,"acs":13633,"articleLive":2,"columnArticles":148,"formTitle":"[346]数据流中的移动平均值","frequency":0.4716067405,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"ac","submitted":19208,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.6239114245121505,"acs":227037,"articleLive":2,"columnArticles":1693,"formTitle":"[347]前 K 个高频元素","frequency":3.2996791837,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"ac","submitted":363893,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.6011350251632938,"acs":5614,"articleLive":2,"columnArticles":88,"formTitle":"[348]设计井字棋","frequency":0.4716067405,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"","submitted":9339,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.738776052694211,"acs":239014,"articleLive":2,"columnArticles":1669,"formTitle":"[349]两个数组的交集","frequency":3.3522343624,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"ac","submitted":323527,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.552788454452723,"acs":285052,"articleLive":2,"columnArticles":1605,"formTitle":"[350]两个数组的交集 II","frequency":3.2650496847,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"ac","submitted":515662,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5926434837754995,"acs":5607,"articleLive":2,"columnArticles":103,"formTitle":"[351]安卓系统手势解锁","frequency":0.0,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"","submitted":9461,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.6780366318842407,"acs":21508,"articleLive":2,"columnArticles":354,"formTitle":"[352]将数据流变为多个不相交区间","frequency":1.8234606116,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"ac","submitted":31721,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.4311050477489768,"acs":2528,"articleLive":2,"columnArticles":52,"formTitle":"[353]贪吃蛇","frequency":0.4181180555,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"","submitted":5864,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.45875679364383026,"acs":75293,"articleLive":2,"columnArticles":588,"formTitle":"[354]俄罗斯套娃信封问题","frequency":2.3857681912,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","submitted":164124,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.4088764829030007,"acs":29296,"articleLive":2,"columnArticles":489,"formTitle":"[355]设计推特","frequency":1.712728134,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","submitted":71650,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.35431947840260797,"acs":1739,"articleLive":2,"columnArticles":44,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"","submitted":4908,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.5206126254810935,"acs":26242,"articleLive":2,"columnArticles":420,"formTitle":"[357]计算各个位数不同的数字个数","frequency":1.8554735886,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","submitted":50406,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.35292369418233155,"acs":4750,"articleLive":2,"columnArticles":63,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.6284711262,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"","submitted":13459,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.7286863270777479,"acs":5436,"articleLive":2,"columnArticles":64,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"","submitted":7460,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.6028152938938558,"acs":3169,"articleLive":2,"columnArticles":65,"formTitle":"[360]有序转化数组","frequency":0.5001312072,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"","submitted":5257,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5652701882210079,"acs":3724,"articleLive":2,"columnArticles":71,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"","submitted":6588,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6890471950133571,"acs":3869,"articleLive":2,"columnArticles":72,"formTitle":"[362]敲击计数器","frequency":0.4716067405,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"","submitted":5615,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.48789432967536744,"acs":34056,"articleLive":2,"columnArticles":224,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":0.4181180555,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"ac","submitted":69802,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.7318534178999295,"acs":2077,"articleLive":2,"columnArticles":52,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"","submitted":2838,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.3693659163187718,"acs":35656,"articleLive":2,"columnArticles":499,"formTitle":"[365]水壶问题","frequency":2.4878976863,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","submitted":96533,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7682234143262859,"acs":4869,"articleLive":2,"columnArticles":128,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.4181180555,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"","submitted":6338,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.4477505038871293,"acs":124403,"articleLive":2,"columnArticles":992,"formTitle":"[367]有效的完全平方数","frequency":2.2404235771,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","submitted":277840,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.4595011678345012,"acs":44068,"articleLive":2,"columnArticles":467,"formTitle":"[368]最大整除子集","frequency":2.3047053119,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"ac","submitted":95904,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.6192792118718045,"acs":4966,"articleLive":2,"columnArticles":143,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"","submitted":8019,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.7421889274620866,"acs":4062,"articleLive":2,"columnArticles":61,"formTitle":"[370]区间加法","frequency":0.4181180555,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"","submitted":5473,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.6128296238164789,"acs":84337,"articleLive":2,"columnArticles":528,"formTitle":"[371]两整数之和","frequency":2.8514701779,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"ac","submitted":137619,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5749628035075501,"acs":36325,"articleLive":2,"columnArticles":374,"formTitle":"[372]超级次方","frequency":1.0808941382,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","submitted":63178,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.4070153627564159,"acs":22917,"articleLive":2,"columnArticles":245,"formTitle":"[373]查找和最小的K对数字","frequency":1.9231446693,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"ac","submitted":56305,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5181483489825622,"acs":90777,"articleLive":2,"columnArticles":619,"formTitle":"[374]猜数字大小","frequency":1.0182071603,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"ac","submitted":175195,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.6014491503493488,"acs":34863,"articleLive":2,"columnArticles":275,"formTitle":"[375]猜数字大小 II","frequency":2.6653530534,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"ac","submitted":57965,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.46774953046433965,"acs":86420,"articleLive":2,"columnArticles":911,"formTitle":"[376]摆动序列","frequency":1.7626885733,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"ac","submitted":184757,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5134794317550334,"acs":72073,"articleLive":2,"columnArticles":606,"formTitle":"[377]组合总和 Ⅳ","frequency":1.8554735886,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"ac","submitted":140362,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6290275783029406,"acs":86719,"articleLive":2,"columnArticles":612,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":2.3047053119,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"ac","submitted":137862,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6296423070340579,"acs":3679,"articleLive":2,"columnArticles":79,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"","submitted":5843,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.5059084384292013,"acs":39473,"articleLive":2,"columnArticles":255,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":2.1803070674,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"ac","submitted":78024,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.4390278338039532,"acs":21767,"articleLive":2,"columnArticles":183,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":0.5299663557,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","submitted":49580,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.6386099270283939,"acs":17678,"articleLive":2,"columnArticles":141,"formTitle":"[382]链表随机节点","frequency":1.3496762595,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","submitted":27682,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.6426025389304472,"acs":118805,"articleLive":2,"columnArticles":1277,"formTitle":"[383]赎金信","frequency":1.2841506411,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"ac","submitted":184881,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.606920508249144,"acs":85787,"articleLive":2,"columnArticles":406,"formTitle":"[384]打乱数组","frequency":2.5486512584,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"ac","submitted":141348,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.4208694721062212,"acs":7861,"articleLive":2,"columnArticles":95,"formTitle":"[385]迷你语法分析器","frequency":0.0,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"ac","submitted":18678,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7499695752707801,"acs":24650,"articleLive":2,"columnArticles":262,"formTitle":"[386]字典序排数","frequency":2.4560782663,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","submitted":32868,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5390707873786094,"acs":249517,"articleLive":2,"columnArticles":1378,"formTitle":"[387]字符串中的第一个唯一字符","frequency":3.1084294323,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"ac","submitted":462865,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5354946473312581,"acs":7053,"articleLive":2,"columnArticles":135,"formTitle":"[388]文件的最长绝对路径","frequency":1.0489221055,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","submitted":13171,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6901183059953134,"acs":108675,"articleLive":2,"columnArticles":1085,"formTitle":"[389]找不同","frequency":0.3688470065,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","submitted":157473,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.46906223666787045,"acs":7793,"articleLive":2,"columnArticles":105,"formTitle":"[390]消除游戏","frequency":1.3496762595,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","submitted":16614,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.4673865997229917,"acs":21597,"articleLive":2,"columnArticles":197,"formTitle":"[391]完美矩形","frequency":2.1761588888,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","submitted":46208,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.5167199236685216,"acs":161383,"articleLive":2,"columnArticles":1730,"formTitle":"[392]判断子序列","frequency":2.3233778986,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"ac","submitted":312322,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.3929903303521336,"acs":11908,"articleLive":2,"columnArticles":143,"formTitle":"[393]UTF-8 编码验证","frequency":0.0,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","submitted":30301,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5547833856616324,"acs":134115,"articleLive":2,"columnArticles":1419,"formTitle":"[394]字符串解码","frequency":3.79371582,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"ac","submitted":241743,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5202723614979883,"acs":55473,"articleLive":2,"columnArticles":453,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":2.6984412663,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"","submitted":106623,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.43871765357888903,"acs":10291,"articleLive":2,"columnArticles":172,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","submitted":23457,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.4317463670530661,"acs":49052,"articleLive":2,"columnArticles":569,"formTitle":"[397]整数替换","frequency":3.0064602926,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","submitted":113613,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6650713755260335,"acs":16120,"articleLive":2,"columnArticles":138,"formTitle":"[398]随机数索引","frequency":0.0,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","submitted":24238,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.5911626579486781,"acs":45568,"articleLive":2,"columnArticles":560,"formTitle":"[399]除法求值","frequency":0.5299663557,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","submitted":77082,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.45442801473335825,"acs":42564,"articleLive":2,"columnArticles":485,"formTitle":"[400]第 N 位数字","frequency":3.4876835382,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"ac","submitted":93665,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6155977614626856,"acs":56430,"articleLive":2,"columnArticles":690,"formTitle":"[401]二进制手表","frequency":1.0182071603,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","submitted":91667,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.3268306188803209,"acs":87353,"articleLive":2,"columnArticles":644,"formTitle":"[402]移掉 K 位数字","frequency":2.9642955307,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"ac","submitted":267273,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.4553803268672674,"acs":47702,"articleLive":2,"columnArticles":473,"formTitle":"[403]青蛙过河","frequency":2.0286164134,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"ac","submitted":104752,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.590015362566889,"acs":114450,"articleLive":2,"columnArticles":1253,"formTitle":"[404]左叶子之和","frequency":3.0304113269,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"ac","submitted":193978,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5593286991521993,"acs":48359,"articleLive":2,"columnArticles":487,"formTitle":"[405]数字转换为十六进制数","frequency":2.6135727209,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"ac","submitted":86459,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7400380360780077,"acs":131524,"articleLive":2,"columnArticles":864,"formTitle":"[406]根据身高重建队列","frequency":2.6653530534,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","submitted":177726,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.579993609640314,"acs":25413,"articleLive":2,"columnArticles":253,"formTitle":"[407]接雨水 II","frequency":3.1492421696,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"ac","submitted":43816,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.33330622204148025,"acs":4098,"articleLive":2,"columnArticles":85,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"","submitted":12295,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.5558556634995195,"acs":104134,"articleLive":2,"columnArticles":1432,"formTitle":"[409]最长回文串","frequency":2.7682715654,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","submitted":187340,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5697518981927067,"acs":42622,"articleLive":2,"columnArticles":354,"formTitle":"[410]分割数组的最大值","frequency":2.9802067653,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","submitted":74808,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.4975124378109453,"acs":1000,"articleLive":2,"columnArticles":28,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"","submitted":2010,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.7101201816899273,"acs":107716,"articleLive":2,"columnArticles":616,"formTitle":"[412]Fizz Buzz","frequency":2.3954958944,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"ac","submitted":151687,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6899391212508909,"acs":80351,"articleLive":2,"columnArticles":1045,"formTitle":"[413]等差数列划分","frequency":2.6504607454,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"ac","submitted":116461,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.39399713156446475,"acs":94501,"articleLive":2,"columnArticles":1214,"formTitle":"[414]第三大的数","frequency":2.7227988531,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"ac","submitted":239852,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5413715843056583,"acs":165271,"articleLive":2,"columnArticles":1182,"formTitle":"[415]字符串相加","frequency":3.85210526,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","submitted":305282,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.510244320617231,"acs":196416,"articleLive":2,"columnArticles":1127,"formTitle":"[416]分割等和子集","frequency":3.274044007,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"ac","submitted":384945,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.4870335922967502,"acs":31157,"articleLive":2,"columnArticles":366,"formTitle":"[417]太平洋大西洋水流问题","frequency":2.3385896309,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"ac","submitted":63973,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.3685312593478911,"acs":2464,"articleLive":2,"columnArticles":36,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"","submitted":6686,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7903571344492314,"acs":33572,"articleLive":2,"columnArticles":440,"formTitle":"[419]甲板上的战舰","frequency":0.0385283199,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","submitted":42477,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.21281628557092683,"acs":2969,"articleLive":2,"columnArticles":58,"formTitle":"[420]强密码检验器","frequency":2.1330348198,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","submitted":13951,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6211607142857143,"acs":34785,"articleLive":2,"columnArticles":318,"formTitle":"[421]数组中两个数的最大异或值","frequency":0.988662914,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"ac","submitted":56000,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.4335922330097087,"acs":2233,"articleLive":2,"columnArticles":56,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"","submitted":5150,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.6119195242313046,"acs":33852,"articleLive":2,"columnArticles":394,"formTitle":"[423]从英文中重建数字","frequency":3.1305542286,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","submitted":55321,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.5328878457539667,"acs":54945,"articleLive":2,"columnArticles":476,"formTitle":"[424]替换后的最长重复字符","frequency":2.4526082093,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"ac","submitted":103108,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6203327171903882,"acs":1678,"articleLive":2,"columnArticles":37,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"","submitted":2705,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6761712507359744,"acs":8039,"articleLive":2,"columnArticles":127,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":1.0182071603,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"","submitted":11889,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.6182572614107884,"acs":4470,"articleLive":2,"columnArticles":76,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","submitted":7230,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.6621923937360179,"acs":2960,"articleLive":2,"columnArticles":58,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"","submitted":4470,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.705694075472906,"acs":66144,"articleLive":2,"columnArticles":534,"formTitle":"[429]N 叉树的层序遍历","frequency":1.5544706722,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"ac","submitted":93729,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.588923398080497,"acs":46267,"articleLive":2,"columnArticles":702,"formTitle":"[430]扁平化多级双向链表","frequency":2.1761588888,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"ac","submitted":78562,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7289512555391433,"acs":987,"articleLive":2,"columnArticles":33,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"771","status":"","submitted":1354,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.38258589318206143,"acs":7149,"articleLive":2,"columnArticles":99,"formTitle":"[432]全 O(1) 的数据结构","frequency":2.0286164134,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","submitted":18686,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.533073568976714,"acs":17238,"articleLive":2,"columnArticles":245,"formTitle":"[433]最小基因变化","frequency":1.3805429075,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","submitted":32337,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.3981958148624815,"acs":66830,"articleLive":2,"columnArticles":911,"formTitle":"[434]字符串中的单词数","frequency":3.1492421696,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"ac","submitted":167832,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5067469967636357,"acs":110858,"articleLive":2,"columnArticles":973,"formTitle":"[435]无重叠区间","frequency":2.705198962,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"ac","submitted":218764,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.4908163770483687,"acs":9914,"articleLive":2,"columnArticles":169,"formTitle":"[436]寻找右区间","frequency":0.4442975611,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"ac","submitted":20199,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5743795341733486,"acs":135387,"articleLive":2,"columnArticles":1092,"formTitle":"[437]路径总和 III","frequency":2.912882715,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"ac","submitted":235710,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5368044741045586,"acs":134090,"articleLive":2,"columnArticles":1154,"formTitle":"[438]找到字符串中所有字母异位词","frequency":2.8007778403,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"ac","submitted":249793,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5923839129590053,"acs":3049,"articleLive":2,"columnArticles":72,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"","submitted":5147,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.3826233855102215,"acs":17893,"articleLive":2,"columnArticles":134,"formTitle":"[440]字典序的第K小数字","frequency":3.2422404279,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","submitted":46764,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.4587479844983169,"acs":81086,"articleLive":2,"columnArticles":778,"formTitle":"[441]排列硬币","frequency":2.6135727209,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"ac","submitted":176755,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6978631600575304,"acs":47551,"articleLive":2,"columnArticles":482,"formTitle":"[442]数组中重复的数据","frequency":3.0835870647,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","submitted":68138,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.47758684494215703,"acs":59365,"articleLive":2,"columnArticles":724,"formTitle":"[443]压缩字符串","frequency":2.8836066195,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"ac","submitted":124302,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.2563927719058984,"acs":3760,"articleLive":2,"columnArticles":58,"formTitle":"[444]序列重建","frequency":0.5001312072,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"","submitted":14665,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5906969903600604,"acs":88360,"articleLive":2,"columnArticles":996,"formTitle":"[445]两数相加 II","frequency":1.7626885733,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"ac","submitted":149586,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5502201545235523,"acs":19869,"articleLive":2,"columnArticles":176,"formTitle":"[446]等差数列划分 II - 子序列","frequency":2.3385896309,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"ac","submitted":36111,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6637311981241424,"acs":49819,"articleLive":2,"columnArticles":388,"formTitle":"[447]回旋镖的数量","frequency":2.2720093059,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"ac","submitted":75059,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6513544693214836,"acs":152443,"articleLive":2,"columnArticles":1194,"formTitle":"[448]找到所有数组中消失的数字","frequency":2.3512224417,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","submitted":234040,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5625246807950507,"acs":17094,"articleLive":2,"columnArticles":153,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":0.4716067405,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"ac","submitted":30388,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.49099964756654674,"acs":73838,"articleLive":2,"columnArticles":723,"formTitle":"[450]删除二叉搜索树中的节点","frequency":2.2648969003,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","submitted":150383,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7123891657497896,"acs":88057,"articleLive":2,"columnArticles":1012,"formTitle":"[451]根据字符出现频率排序","frequency":2.680481935,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"ac","submitted":123608,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5077070794594974,"acs":108398,"articleLive":2,"columnArticles":948,"formTitle":"[452]用最少数量的箭引爆气球","frequency":2.5152591743,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"ac","submitted":213505,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.6115096495683088,"acs":57795,"articleLive":2,"columnArticles":695,"formTitle":"[453]最小操作次数使数组元素相等","frequency":2.8160133283,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"ac","submitted":94512,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.6097387546919548,"acs":89181,"articleLive":2,"columnArticles":562,"formTitle":"[454]四数相加 II","frequency":2.9469188989,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"ac","submitted":146261,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5757120479695474,"acs":170903,"articleLive":2,"columnArticles":1396,"formTitle":"[455]分发饼干","frequency":3.1508608692,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"ac","submitted":296855,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.36281679523887683,"acs":59683,"articleLive":2,"columnArticles":474,"formTitle":"[456]132 模式","frequency":1.9963034245,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"ac","submitted":164499,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.43529171290077673,"acs":29814,"articleLive":2,"columnArticles":339,"formTitle":"[457]环形数组是否存在循环","frequency":2.2812344635,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"ac","submitted":68492,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.698241718674988,"acs":23271,"articleLive":2,"columnArticles":212,"formTitle":"[458]可怜的小猪","frequency":2.7766672155,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","submitted":33328,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5093087877735325,"acs":87978,"articleLive":2,"columnArticles":702,"formTitle":"[459]重复的子字符串","frequency":2.0968906614,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","submitted":172740,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.4346216530849825,"acs":37334,"articleLive":2,"columnArticles":430,"formTitle":"[460]LFU 缓存","frequency":2.3540530595,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","submitted":85900,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8131313131313131,"acs":181608,"articleLive":2,"columnArticles":1448,"formTitle":"[461]汉明距离","frequency":1.7058163011,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"ac","submitted":223344,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6097789580567055,"acs":15614,"articleLive":2,"columnArticles":151,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":0.988662914,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","submitted":25606,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7049870656095907,"acs":84210,"articleLive":2,"columnArticles":1016,"formTitle":"[463]岛屿的周长","frequency":2.3954958944,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","submitted":119449,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.3544511196067723,"acs":12331,"articleLive":2,"columnArticles":119,"formTitle":"[464]我能赢吗","frequency":1.114219448,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","submitted":34789,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.536178107606679,"acs":1734,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.8807415775,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"","submitted":3234,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.37308599276843263,"acs":11866,"articleLive":2,"columnArticles":184,"formTitle":"[466]统计重复个数","frequency":1.4805818301,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","submitted":31805,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.44271242888200196,"acs":9571,"articleLive":2,"columnArticles":123,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":0.4442975611,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","submitted":21619,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.2534027074316235,"acs":27517,"articleLive":2,"columnArticles":322,"formTitle":"[468]验证IP地址","frequency":2.2720093059,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","submitted":108590,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.43267407206719044,"acs":1597,"articleLive":2,"columnArticles":21,"formTitle":"[469]凸多边形","frequency":0.743540456,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"","submitted":3691,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.547924877535064,"acs":68678,"articleLive":2,"columnArticles":354,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":3.0960098051,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"ac","submitted":125342,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6029699101211411,"acs":1543,"articleLive":2,"columnArticles":27,"formTitle":"[471]编码最短长度的字符串","frequency":1.7725331103,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"","submitted":2559,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.49814958866652526,"acs":21133,"articleLive":2,"columnArticles":218,"formTitle":"[472]连接词","frequency":1.0918471502,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","submitted":42423,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.4213826308792354,"acs":23455,"articleLive":2,"columnArticles":203,"formTitle":"[473]火柴拼正方形","frequency":2.1761588888,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","submitted":55662,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.616019021840722,"acs":82387,"articleLive":2,"columnArticles":657,"formTitle":"[474]一和零","frequency":2.0239294907,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"ac","submitted":133741,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.4018808878305431,"acs":49955,"articleLive":2,"columnArticles":562,"formTitle":"[475]供暖器","frequency":2.4964527902,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","submitted":124303,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7123839910318734,"acs":66090,"articleLive":2,"columnArticles":890,"formTitle":"[476]数字的补数","frequency":2.112207242,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"ac","submitted":92773,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6040034418731036,"acs":40011,"articleLive":2,"columnArticles":340,"formTitle":"[477]汉明距离总和","frequency":0.4181180555,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"ac","submitted":66243,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.4449650066516282,"acs":7693,"articleLive":2,"columnArticles":55,"formTitle":"[478]在圆内随机生成点","frequency":0.5299663557,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","submitted":17289,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.431205493387589,"acs":3391,"articleLive":2,"columnArticles":34,"formTitle":"[479]最大回文数乘积","frequency":0.5299663557,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"ac","submitted":7864,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.4474735878395071,"acs":30792,"articleLive":2,"columnArticles":418,"formTitle":"[480]滑动窗口中位数","frequency":2.1761588888,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"ac","submitted":68813,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.55,"acs":6325,"articleLive":2,"columnArticles":108,"formTitle":"[481]神奇字符串","frequency":0.0,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","submitted":11500,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.47260085288316384,"acs":42889,"articleLive":2,"columnArticles":455,"formTitle":"[482]密钥格式化","frequency":1.3199121576,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"ac","submitted":90751,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5899309488144386,"acs":16147,"articleLive":2,"columnArticles":121,"formTitle":"[483]最小好进制","frequency":0.0,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"ac","submitted":27371,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6320939334637965,"acs":1615,"articleLive":2,"columnArticles":36,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"","submitted":2555,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6089109592498932,"acs":132675,"articleLive":2,"columnArticles":1073,"formTitle":"[485]最大连续 1 的个数","frequency":2.8160133283,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","submitted":217889,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5874483857725835,"acs":48656,"articleLive":2,"columnArticles":418,"formTitle":"[486]预测赢家","frequency":2.3047053119,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"ac","submitted":82826,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5790718538455265,"acs":7100,"articleLive":2,"columnArticles":132,"formTitle":"[487]最大连续1的个数 II","frequency":1.3496762595,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"","submitted":12261,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.5255210173083716,"acs":17853,"articleLive":2,"columnArticles":174,"formTitle":"[488]祖玛游戏","frequency":2.9621398929,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"ac","submitted":33972,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.7348108521207489,"acs":1923,"articleLive":2,"columnArticles":27,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"","submitted":2617,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.4860045886594559,"acs":7414,"articleLive":2,"columnArticles":90,"formTitle":"[490]迷宫","frequency":0.4181180555,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"","submitted":15255,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.539913338470314,"acs":53953,"articleLive":2,"columnArticles":459,"formTitle":"[491]递增子序列","frequency":2.0818255979,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"ac","submitted":99929,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.6052030674603699,"acs":45852,"articleLive":2,"columnArticles":441,"formTitle":"[492]构造矩形","frequency":2.1436281392,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","submitted":75763,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.3470110367515036,"acs":27637,"articleLive":2,"columnArticles":278,"formTitle":"[493]翻转对","frequency":1.0808941382,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","submitted":79643,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.49154949663697034,"acs":168891,"articleLive":2,"columnArticles":1137,"formTitle":"[494]目标和","frequency":2.7227988531,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"ac","submitted":343589,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.6062744740916128,"acs":66575,"articleLive":2,"columnArticles":954,"formTitle":"[495]提莫攻击","frequency":2.680481935,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"ac","submitted":109810,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.7051679857935288,"acs":147720,"articleLive":2,"columnArticles":1503,"formTitle":"[496]下一个更大元素 I","frequency":2.6653530534,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"ac","submitted":209482,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.4060004839099927,"acs":3356,"articleLive":2,"columnArticles":41,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.5001312072,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","submitted":8266,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.479187466020857,"acs":48477,"articleLive":2,"columnArticles":505,"formTitle":"[498]对角线遍历","frequency":2.5805565168,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","submitted":101165,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.3780290791599354,"acs":2808,"articleLive":2,"columnArticles":51,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"","submitted":7428,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.7442732078426986,"acs":53220,"articleLive":2,"columnArticles":776,"formTitle":"[500]键盘行","frequency":2.1761588888,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"ac","submitted":71506,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5177459439836921,"acs":74164,"articleLive":2,"columnArticles":606,"formTitle":"[501]二叉搜索树中的众数","frequency":2.112207242,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","submitted":143244,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.441235994603156,"acs":30087,"articleLive":2,"columnArticles":364,"formTitle":"[502]IPO","frequency":2.3047053119,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"ac","submitted":68188,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.640732716170967,"acs":113855,"articleLive":2,"columnArticles":1069,"formTitle":"[503]下一个更大元素 II","frequency":2.4354472802,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"ac","submitted":177695,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5037304524292706,"acs":33758,"articleLive":2,"columnArticles":361,"formTitle":"[504]七进制数","frequency":0.3688470065,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","submitted":67016,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.49189359357783724,"acs":6250,"articleLive":2,"columnArticles":72,"formTitle":"[505]迷宫 II","frequency":0.5612188992,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"","submitted":12706,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.65356987623819,"acs":57139,"articleLive":2,"columnArticles":737,"formTitle":"[506]相对名次","frequency":2.4308208552,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","submitted":87426,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.48621668352200437,"acs":59616,"articleLive":2,"columnArticles":445,"formTitle":"[507]完美数","frequency":0.22231568,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","submitted":122612,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6801945973626936,"acs":15939,"articleLive":2,"columnArticles":235,"formTitle":"[508]出现次数最多的子树元素和","frequency":1.3496762595,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","submitted":23433,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6705400036954915,"acs":290317,"articleLive":2,"columnArticles":1710,"formTitle":"[509]斐波那契数","frequency":3.0626548509,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"ac","submitted":432960,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6096861289233885,"acs":3613,"articleLive":2,"columnArticles":59,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":0.0,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"","submitted":5926,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7302485350575874,"acs":21684,"articleLive":2,"columnArticles":118,"formTitle":"[511]游戏玩法分析 I","frequency":1.3496762595,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"","submitted":29694,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5387287801026451,"acs":20469,"articleLive":2,"columnArticles":161,"formTitle":"[512]游戏玩法分析 II","frequency":0.4716067405,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"","submitted":37995,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7313820825109517,"acs":60772,"articleLive":2,"columnArticles":681,"formTitle":"[513]找树左下角的值","frequency":0.9327824556,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","submitted":83092,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.4987408005085699,"acs":20398,"articleLive":2,"columnArticles":253,"formTitle":"[514]自由之路","frequency":0.4442975611,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","submitted":40899,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.6494234695344624,"acs":45170,"articleLive":2,"columnArticles":487,"formTitle":"[515]在每个树行中找最大值","frequency":0.9327824556,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","submitted":69554,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6582326232184255,"acs":95969,"articleLive":2,"columnArticles":692,"formTitle":"[516]最长回文子序列","frequency":3.1393861277,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"ac","submitted":145798,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.5089611256611719,"acs":19822,"articleLive":2,"columnArticles":171,"formTitle":"[517]超级洗衣机","frequency":2.8836066195,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"ac","submitted":38946,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.664321591507282,"acs":121151,"articleLive":2,"columnArticles":753,"formTitle":"[518]零钱兑换 II","frequency":3.0835870647,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"ac","submitted":182368,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.47013062549984247,"acs":19399,"articleLive":2,"columnArticles":190,"formTitle":"[519]随机翻转矩阵","frequency":2.4526082093,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","submitted":41263,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5760395707578806,"acs":68710,"articleLive":2,"columnArticles":1052,"formTitle":"[520]检测大写字母","frequency":2.1436281392,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"ac","submitted":119280,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7126738180373461,"acs":26907,"articleLive":2,"columnArticles":273,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":0.4181180555,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","submitted":37755,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.3623417721518987,"acs":7328,"articleLive":2,"columnArticles":115,"formTitle":"[522]最长特殊序列 II","frequency":1.4125900849,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","submitted":20224,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.2763481652459416,"acs":72553,"articleLive":2,"columnArticles":625,"formTitle":"[523]连续的子数组和","frequency":1.114219448,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"ac","submitted":262542,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.49666990559906304,"acs":77183,"articleLive":2,"columnArticles":795,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":2.6504607454,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"ac","submitted":155401,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5372526775883354,"acs":48306,"articleLive":2,"columnArticles":545,"formTitle":"[525]连续数组","frequency":2.6135727209,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"ac","submitted":89913,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7344701583434835,"acs":34974,"articleLive":2,"columnArticles":400,"formTitle":"[526]优美的排列","frequency":3.0742964259,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"ac","submitted":47618,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5770089285714286,"acs":2068,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"","submitted":3584,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.47935339990624865,"acs":33746,"articleLive":2,"columnArticles":268,"formTitle":"[528]按权重随机选择","frequency":2.5208278926,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"ac","submitted":70399,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6433490338727479,"acs":41386,"articleLive":2,"columnArticles":482,"formTitle":"[529]扫雷游戏","frequency":1.5839018723,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","submitted":64329,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6213119977342727,"acs":87751,"articleLive":2,"columnArticles":702,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":0.3232602621,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"ac","submitted":141235,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6624859302138607,"acs":4120,"articleLive":2,"columnArticles":80,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"","submitted":6219,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.3794208116574766,"acs":26767,"articleLive":2,"columnArticles":298,"formTitle":"[532]数组中的 k-diff 数对","frequency":0.3929911054,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","submitted":70547,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5263628239499554,"acs":1767,"articleLive":2,"columnArticles":35,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"","submitted":3357,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6754169627555072,"acs":16158,"articleLive":2,"columnArticles":150,"formTitle":"[534]游戏玩法分析 III","frequency":0.5299663557,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"","submitted":23923,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.844643576318969,"acs":16778,"articleLive":2,"columnArticles":109,"formTitle":"[535]TinyURL 的加密与解密","frequency":1.0182071603,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","submitted":19864,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5365927725478288,"acs":3534,"articleLive":2,"columnArticles":58,"formTitle":"[536]从字符串生成二叉树","frequency":1.0808941382,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"","submitted":6586,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7132205334098078,"acs":12435,"articleLive":2,"columnArticles":192,"formTitle":"[537]复数乘法","frequency":0.0,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","submitted":17435,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.7121987236960076,"acs":121536,"articleLive":2,"columnArticles":935,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":1.4984649962,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","submitted":170649,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.6011422951811786,"acs":15893,"articleLive":2,"columnArticles":221,"formTitle":"[539]最小时间差","frequency":2.0286164134,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","submitted":26438,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5839090945679443,"acs":43524,"articleLive":2,"columnArticles":447,"formTitle":"[540]有序数组中的单一元素","frequency":2.112207242,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"ac","submitted":74539,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6020918533531179,"acs":83182,"articleLive":2,"columnArticles":876,"formTitle":"[541]反转字符串 II","frequency":2.6271074744,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"ac","submitted":138155,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.4574603575280538,"acs":79739,"articleLive":2,"columnArticles":725,"formTitle":"[542]01 矩阵","frequency":2.7327185853,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"ac","submitted":174308,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.5571248288268936,"acs":165992,"articleLive":2,"columnArticles":1331,"formTitle":"[543]二叉树的直径","frequency":3.406128283,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","submitted":297944,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7119788608338227,"acs":2425,"articleLive":2,"columnArticles":57,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"","submitted":3406,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.42399726526891524,"acs":3721,"articleLive":2,"columnArticles":79,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"","submitted":8776,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6258061899160345,"acs":15428,"articleLive":2,"columnArticles":124,"formTitle":"[546]移除盒子","frequency":0.5299663557,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","submitted":24653,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6190224607406275,"acs":178094,"articleLive":2,"columnArticles":1246,"formTitle":"[547]省份数量","frequency":1.9963034245,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"ac","submitted":287702,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.3557672395941189,"acs":1718,"articleLive":2,"columnArticles":42,"formTitle":"[548]将数组分割成和相等的子数组","frequency":0.988662914,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","questionId":"548","status":"","submitted":4829,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.48991474318985234,"acs":2356,"articleLive":2,"columnArticles":53,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"","submitted":4809,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.43841835639130033,"acs":14292,"articleLive":2,"columnArticles":197,"formTitle":"[550]游戏玩法分析 IV","frequency":1.4805818301,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"","submitted":32599,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.5675978377577845,"acs":61321,"articleLive":2,"columnArticles":776,"formTitle":"[551]学生出勤记录 I","frequency":2.3857681912,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"ac","submitted":108036,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5770267419785783,"acs":24620,"articleLive":2,"columnArticles":289,"formTitle":"[552]学生出勤记录 II","frequency":2.3540530595,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"ac","submitted":42667,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6061614528858039,"acs":6375,"articleLive":2,"columnArticles":99,"formTitle":"[553]最优除法","frequency":0.0,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","submitted":10517,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5043019558212003,"acs":47418,"articleLive":2,"columnArticles":496,"formTitle":"[554]砖墙","frequency":2.1761588888,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"ac","submitted":94027,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.3444541995902839,"acs":1177,"articleLive":2,"columnArticles":24,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"","submitted":3417,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.3298271824275216,"acs":16337,"articleLive":2,"columnArticles":247,"formTitle":"[556]下一个更大元素 III","frequency":2.2098775248,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","submitted":49532,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.743721339130848,"acs":187806,"articleLive":2,"columnArticles":1568,"formTitle":"[557]反转字符串中的单词 III","frequency":3.3522343624,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"ac","submitted":252522,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5056234718826406,"acs":3102,"articleLive":2,"columnArticles":42,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","questionId":"773","status":"","submitted":6135,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7401149611398964,"acs":91419,"articleLive":2,"columnArticles":811,"formTitle":"[559]N 叉树的最大深度","frequency":1.9349344781,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","submitted":123520,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.446436289596059,"acs":171461,"articleLive":2,"columnArticles":1042,"formTitle":"[560]和为 K 的子数组","frequency":3.85210526,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","submitted":384066,"title":"和为 K 的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7766707975927231,"acs":95887,"articleLive":2,"columnArticles":795,"formTitle":"[561]数组拆分 I","frequency":1.3496762595,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"ac","submitted":123459,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.4723646088700691,"acs":4239,"articleLive":2,"columnArticles":70,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.5001312072,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"","submitted":8974,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.6542062157617834,"acs":60308,"articleLive":2,"columnArticles":606,"formTitle":"[563]二叉树的坡度","frequency":2.3385896309,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","submitted":92185,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.1821954124562954,"acs":4742,"articleLive":2,"columnArticles":84,"formTitle":"[564]寻找最近的回文数","frequency":1.114219448,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"notac","submitted":26027,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6068580855493145,"acs":15450,"articleLive":2,"columnArticles":151,"formTitle":"[565]数组嵌套","frequency":1.3805429075,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","submitted":25459,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.6780312225337966,"acs":81001,"articleLive":2,"columnArticles":760,"formTitle":"[566]重塑矩阵","frequency":2.5549469226,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"ac","submitted":119465,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.43376406347796864,"acs":140684,"articleLive":2,"columnArticles":1270,"formTitle":"[567]字符串的排列","frequency":3.0349522484,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"ac","submitted":324333,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.5069527214938419,"acs":1276,"articleLive":2,"columnArticles":26,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"","submitted":2517,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.5642229936695936,"acs":11052,"articleLive":2,"columnArticles":168,"formTitle":"[569]员工薪水中位数","frequency":1.9589856614,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"","submitted":19588,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.657036638896354,"acs":14669,"articleLive":2,"columnArticles":120,"formTitle":"[570]至少有5名直接下属的经理","frequency":0.4716067405,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"","submitted":22326,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.476887031408308,"acs":7531,"articleLive":2,"columnArticles":101,"formTitle":"[571]给定数字的频率查询中位数","frequency":0.5299663557,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"","submitted":15792,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.47398450352124927,"acs":95369,"articleLive":2,"columnArticles":823,"formTitle":"[572]另一棵树的子树","frequency":2.680481935,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"ac","submitted":201207,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6570915619389587,"acs":1098,"articleLive":2,"columnArticles":35,"formTitle":"[573]松鼠模拟","frequency":0.0,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"","submitted":1671,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.6501213425523147,"acs":14198,"articleLive":2,"columnArticles":121,"formTitle":"[574]当选者","frequency":0.4716067405,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"","submitted":21839,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.7118836812606611,"acs":87640,"articleLive":2,"columnArticles":844,"formTitle":"[575]分糖果","frequency":3.0397836424,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"ac","submitted":123110,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.46861627483931323,"acs":27049,"articleLive":2,"columnArticles":293,"formTitle":"[576]出界的路径数","frequency":2.062116643,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"ac","submitted":57721,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.6991912445177645,"acs":17377,"articleLive":2,"columnArticles":94,"formTitle":"[577]员工奖金","frequency":1.6143688138,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"","submitted":24853,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.485225981292071,"acs":11101,"articleLive":2,"columnArticles":125,"formTitle":"[578]查询回答率最高的问题","frequency":1.114219448,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"","submitted":22878,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.4099313762866946,"acs":8602,"articleLive":2,"columnArticles":139,"formTitle":"[579]查询员工的累计薪水","frequency":0.5299663557,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"","submitted":20984,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5230733944954128,"acs":11403,"articleLive":2,"columnArticles":87,"formTitle":"[580]统计各专业学生人数","frequency":1.4805818301,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"","submitted":21800,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.40615734334848785,"acs":106847,"articleLive":2,"columnArticles":914,"formTitle":"[581]最短无序连续子数组","frequency":3.0626548509,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"ac","submitted":263068,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.4179432052315686,"acs":9331,"articleLive":2,"columnArticles":144,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"","submitted":22326,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.6268599436397329,"acs":57169,"articleLive":2,"columnArticles":538,"formTitle":"[583]两个字符串的删除操作","frequency":3.2227117357,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"ac","submitted":91199,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7741243388883345,"acs":15515,"articleLive":2,"columnArticles":66,"formTitle":"[584]寻找用户推荐人","frequency":0.4716067405,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"","submitted":20042,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.5728351272015656,"acs":9367,"articleLive":2,"columnArticles":115,"formTitle":"[585]2016年的投资","frequency":0.4716067405,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"","submitted":16352,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7424139952207043,"acs":16466,"articleLive":2,"columnArticles":93,"formTitle":"[586]订单最多的客户","frequency":1.4125900849,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"","submitted":22179,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.3881545926049858,"acs":2320,"articleLive":2,"columnArticles":40,"formTitle":"[587]安装栅栏","frequency":0.0,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","submitted":5977,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.4240928165884967,"acs":1718,"articleLive":2,"columnArticles":31,"formTitle":"[588]设计内存文件系统","frequency":1.724369709,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"","submitted":4051,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7466759917017666,"acs":95019,"articleLive":2,"columnArticles":610,"formTitle":"[589]N 叉树的前序遍历","frequency":1.4984649962,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","submitted":127256,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7636095010796682,"acs":67190,"articleLive":2,"columnArticles":503,"formTitle":"[590]N 叉树的后序遍历","frequency":0.0,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","submitted":87990,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.34218859957776215,"acs":1945,"articleLive":2,"columnArticles":44,"formTitle":"[591]标签验证器","frequency":1.4459042916,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"ac","submitted":5684,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5276720669783626,"acs":4853,"articleLive":2,"columnArticles":117,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","submitted":9197,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.44249768822699176,"acs":9092,"articleLive":2,"columnArticles":147,"formTitle":"[593]有效的正方形","frequency":1.6143688138,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","submitted":20547,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5659813225595852,"acs":59818,"articleLive":2,"columnArticles":545,"formTitle":"[594]最长和谐子序列","frequency":2.3857681912,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","submitted":105689,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.7893958642865858,"acs":109981,"articleLive":2,"columnArticles":253,"formTitle":"[595]大的国家","frequency":1.8234606116,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","submitted":139323,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.43277722297284066,"acs":88406,"articleLive":2,"columnArticles":316,"formTitle":"[596]超过5名学生的课","frequency":2.2720093059,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","submitted":204276,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.441936964504284,"acs":11554,"articleLive":2,"columnArticles":88,"formTitle":"[597]好友申请 I:总体通过率","frequency":0.4716067405,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"","submitted":26144,"title":"好友申请 I:总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5711132177681474,"acs":42171,"articleLive":2,"columnArticles":494,"formTitle":"[598]范围求和 II","frequency":2.3857681912,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","submitted":73840,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5221096533718658,"acs":31797,"articleLive":2,"columnArticles":306,"formTitle":"[599]两个列表的最小索引总和","frequency":0.5001312072,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"ac","submitted":60901,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.4820644216691069,"acs":19755,"articleLive":2,"columnArticles":239,"formTitle":"[600]不含连续1的非负整数","frequency":2.4185938956,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"ac","submitted":40980,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.5047977561263655,"acs":34195,"articleLive":2,"columnArticles":408,"formTitle":"[601]体育馆的人流量","frequency":1.8886727603,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","submitted":67740,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6193846991560032,"acs":9100,"articleLive":2,"columnArticles":98,"formTitle":"[602]好友申请 II :谁有最多的好友","frequency":1.1853732082,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"","submitted":14692,"title":"好友申请 II :谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6685231597512299,"acs":14404,"articleLive":2,"columnArticles":126,"formTitle":"[603]连续空余座位","frequency":1.0808941382,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"","submitted":21546,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.3751587861679605,"acs":2658,"articleLive":2,"columnArticles":62,"formTitle":"[604]迭代压缩字符串","frequency":0.0,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"","submitted":7085,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.33229896393026365,"acs":117259,"articleLive":2,"columnArticles":1353,"formTitle":"[605]种花问题","frequency":2.5805565168,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","submitted":352872,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.573591962452332,"acs":31286,"articleLive":2,"columnArticles":341,"formTitle":"[606]根据二叉树创建字符串","frequency":0.4442975611,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","submitted":54544,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6620361468948279,"acs":13773,"articleLive":2,"columnArticles":96,"formTitle":"[607]销售员","frequency":1.4805818301,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"","submitted":20804,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.6225830258302583,"acs":8436,"articleLive":2,"columnArticles":109,"formTitle":"[608]树节点","frequency":1.0808941382,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"","submitted":13550,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.4887948379934781,"acs":7045,"articleLive":2,"columnArticles":110,"formTitle":"[609]在系统中查找重复文件","frequency":0.0,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","submitted":14413,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6642820643842616,"acs":11700,"articleLive":2,"columnArticles":81,"formTitle":"[610]判断三角形","frequency":0.0,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"","submitted":17613,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.532530825088942,"acs":54635,"articleLive":2,"columnArticles":425,"formTitle":"[611]有效三角形的个数","frequency":4.0170257219,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"ac","submitted":102595,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6635184888746598,"acs":8290,"articleLive":2,"columnArticles":71,"formTitle":"[612]平面上的最近距离","frequency":1.0489221055,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"","submitted":12494,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8147116541115401,"acs":12870,"articleLive":2,"columnArticles":89,"formTitle":"[613]直线上的最近距离","frequency":0.0,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"","submitted":15797,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.35203050524308865,"acs":9232,"articleLive":2,"columnArticles":75,"formTitle":"[614]二级关注者","frequency":1.4125900849,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"","submitted":26225,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.42354707269997854,"acs":5925,"articleLive":2,"columnArticles":95,"formTitle":"[615]平均工资:部门与公司比较","frequency":0.0,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"","submitted":13989,"title":"平均工资:部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.46788763766860536,"acs":3781,"articleLive":2,"columnArticles":64,"formTitle":"[616]给字符串添加加粗标签","frequency":1.3805429075,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"","submitted":8081,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7866607028941406,"acs":214568,"articleLive":2,"columnArticles":1410,"formTitle":"[617]合并二叉树","frequency":3.1663746771,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"ac","submitted":272758,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6207231254549866,"acs":5116,"articleLive":2,"columnArticles":51,"formTitle":"[618]学生地理信息报告","frequency":0.4442975611,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"","submitted":8242,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.4638541059988352,"acs":12743,"articleLive":2,"columnArticles":87,"formTitle":"[619]只出现一次的最大数字","frequency":1.0182071603,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"","submitted":27472,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7727770656100688,"acs":99468,"articleLive":2,"columnArticles":337,"formTitle":"[620]有趣的电影","frequency":1.8234606116,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","submitted":128715,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.5745969397530999,"acs":83967,"articleLive":2,"columnArticles":544,"formTitle":"[621]任务调度器","frequency":3.1305542286,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","submitted":146132,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.4405542193744224,"acs":71987,"articleLive":2,"columnArticles":474,"formTitle":"[622]设计循环队列","frequency":2.112207242,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"ac","submitted":163401,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5469042723326479,"acs":11969,"articleLive":2,"columnArticles":202,"formTitle":"[623]在二叉树中增加一行","frequency":0.0,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","submitted":21885,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.4231820667031165,"acs":2322,"articleLive":2,"columnArticles":54,"formTitle":"[624]数组列表中的最大距离","frequency":0.9327824556,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"","submitted":5487,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.34442836468885674,"acs":2618,"articleLive":2,"columnArticles":55,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"","submitted":7601,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.6841927731163301,"acs":48681,"articleLive":2,"columnArticles":386,"formTitle":"[626]换座位","frequency":0.9602114928,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","submitted":71151,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.8094116597528882,"acs":90731,"articleLive":2,"columnArticles":371,"formTitle":"[627]变更性别","frequency":0.988662914,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","submitted":112095,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5243716914856775,"acs":84793,"articleLive":2,"columnArticles":810,"formTitle":"[628]三个数的最大乘积","frequency":1.6143688138,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"ac","submitted":161704,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.5217654837998678,"acs":18938,"articleLive":2,"columnArticles":172,"formTitle":"[629]K个逆序对数组","frequency":2.8436012848,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"ac","submitted":36296,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.46375751039901403,"acs":24082,"articleLive":2,"columnArticles":227,"formTitle":"[630]课程表 III","frequency":1.2332659077,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","submitted":51928,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.2950025497195308,"acs":1157,"articleLive":2,"columnArticles":36,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"","submitted":3922,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5990697389761008,"acs":19577,"articleLive":2,"columnArticles":249,"formTitle":"[632]最小区间","frequency":0.4442975611,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","submitted":32679,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.39510063548744,"acs":98917,"articleLive":2,"columnArticles":806,"formTitle":"[633]平方数之和","frequency":1.2911800528,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"ac","submitted":250359,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.44018126888217524,"acs":1457,"articleLive":2,"columnArticles":22,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"","submitted":3310,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.5532303199902665,"acs":4547,"articleLive":2,"columnArticles":74,"formTitle":"[635]设计日志存储系统","frequency":0.5001312072,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"","submitted":8219,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.5583722481654436,"acs":10881,"articleLive":2,"columnArticles":126,"formTitle":"[636]函数的独占时间","frequency":0.0,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"ac","submitted":19487,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6912331568009653,"acs":82489,"articleLive":2,"columnArticles":705,"formTitle":"[637]二叉树的层平均值","frequency":1.3199121576,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","submitted":119336,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.6456318305244496,"acs":28770,"articleLive":2,"columnArticles":277,"formTitle":"[638]大礼包","frequency":2.3737488157,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"ac","submitted":44561,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.37614493658106796,"acs":20492,"articleLive":2,"columnArticles":275,"formTitle":"[639]解码方法 II","frequency":2.3737488157,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"ac","submitted":54479,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.42668968364168575,"acs":11370,"articleLive":2,"columnArticles":227,"formTitle":"[640]求解方程","frequency":0.4181180555,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","submitted":26647,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5315345775854297,"acs":23581,"articleLive":2,"columnArticles":269,"formTitle":"[641]设计循环双端队列","frequency":0.9327824556,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","submitted":44364,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.49886024899175874,"acs":2845,"articleLive":2,"columnArticles":60,"formTitle":"[642]设计搜索自动补全系统","frequency":0.5299663557,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"","submitted":5703,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.44814508615146387,"acs":68300,"articleLive":2,"columnArticles":617,"formTitle":"[643]子数组最大平均数 I","frequency":1.3199121576,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","submitted":152406,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.4050469103849887,"acs":1252,"articleLive":2,"columnArticles":26,"formTitle":"[644]子数组最大平均数 II","frequency":1.4984649962,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"","submitted":3091,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.4289068983173544,"acs":72876,"articleLive":2,"columnArticles":739,"formTitle":"[645]错误的集合","frequency":0.9327824556,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"ac","submitted":169911,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5804304256537507,"acs":24327,"articleLive":2,"columnArticles":222,"formTitle":"[646]最长数对链","frequency":0.0,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","submitted":41912,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6590356110637609,"acs":138410,"articleLive":2,"columnArticles":1010,"formTitle":"[647]回文子串","frequency":2.9097587375,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","submitted":210019,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.5899922128161973,"acs":23487,"articleLive":2,"columnArticles":309,"formTitle":"[648]单词替换","frequency":1.0489221055,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","submitted":39809,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.48008362324853976,"acs":30083,"articleLive":2,"columnArticles":318,"formTitle":"[649]Dota2 参议院","frequency":1.3805429075,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","submitted":62662,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5677970768671594,"acs":51552,"articleLive":2,"columnArticles":677,"formTitle":"[650]只有两个键的键盘","frequency":2.3385896309,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"ac","submitted":90793,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.5822748267898383,"acs":4034,"articleLive":2,"columnArticles":67,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"","submitted":6928,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.571478615815767,"acs":37521,"articleLive":2,"columnArticles":265,"formTitle":"[652]寻找重复的子树","frequency":2.8836066195,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"ac","submitted":65656,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.6018905030768255,"acs":47438,"articleLive":2,"columnArticles":484,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"ac","submitted":78815,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.809472674099799,"acs":70858,"articleLive":2,"columnArticles":705,"formTitle":"[654]最大二叉树","frequency":2.2648969003,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","submitted":87536,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.600153946355616,"acs":10136,"articleLive":2,"columnArticles":155,"formTitle":"[655]输出二叉树","frequency":1.6786996721,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","submitted":16889,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.31002017484868866,"acs":922,"articleLive":2,"columnArticles":27,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"","submitted":2974,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.7832531012775412,"acs":84607,"articleLive":2,"columnArticles":651,"formTitle":"[657]机器人能否返回原点","frequency":0.4442975611,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","submitted":108020,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.45410795121290964,"acs":30195,"articleLive":2,"columnArticles":268,"formTitle":"[658]找到 K 个最接近的元素","frequency":1.5839018723,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","submitted":66493,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.5420282346846264,"acs":29295,"articleLive":2,"columnArticles":270,"formTitle":"[659]分割数组为连续子序列","frequency":0.3688470065,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","submitted":54047,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.6377887788778878,"acs":773,"articleLive":2,"columnArticles":26,"formTitle":"[660]移除 9","frequency":0.7864655007,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"","submitted":1212,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.563638085019093,"acs":17860,"articleLive":2,"columnArticles":229,"formTitle":"[661]图片平滑器","frequency":0.0,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","submitted":31687,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.4095190505933791,"acs":32782,"articleLive":2,"columnArticles":316,"formTitle":"[662]二叉树最大宽度","frequency":2.2720093059,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","submitted":80050,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.4589928057553957,"acs":1914,"articleLive":2,"columnArticles":38,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"","submitted":4170,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.6537939008527244,"acs":22618,"articleLive":2,"columnArticles":195,"formTitle":"[664]奇怪的打印机","frequency":0.0,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"ac","submitted":34595,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.2716287221501622,"acs":78112,"articleLive":2,"columnArticles":981,"formTitle":"[665]非递减数列","frequency":1.9589856614,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","questionId":"665","status":"","submitted":287569,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6162381596752368,"acs":2277,"articleLive":2,"columnArticles":83,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"","submitted":3695,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.6235216337324616,"acs":8488,"articleLive":2,"columnArticles":127,"formTitle":"[667]优美的排列 II","frequency":0.0,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","submitted":13613,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5134550371872887,"acs":7594,"articleLive":2,"columnArticles":83,"formTitle":"[668]乘法表中第k小的数","frequency":0.5001312072,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","submitted":14790,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6655128961766067,"acs":41723,"articleLive":2,"columnArticles":348,"formTitle":"[669]修剪二叉搜索树","frequency":0.3688470065,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","submitted":62693,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.4561183713143968,"acs":21116,"articleLive":2,"columnArticles":316,"formTitle":"[670]最大交换","frequency":2.5805565168,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","submitted":46295,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.48511419956330365,"acs":55988,"articleLive":2,"columnArticles":701,"formTitle":"[671]二叉树中第二小的节点","frequency":2.5486512584,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"ac","submitted":115412,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5463421158218537,"acs":4085,"articleLive":2,"columnArticles":47,"formTitle":"[672]灯泡开关 Ⅱ","frequency":0.4716067405,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","submitted":7477,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.43643713176218535,"acs":52149,"articleLive":2,"columnArticles":438,"formTitle":"[673]最长递增子序列的个数","frequency":3.3797200857,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"ac","submitted":119488,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.5043274865517345,"acs":100691,"articleLive":2,"columnArticles":838,"formTitle":"[674]最长连续递增序列","frequency":2.112207242,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","submitted":199654,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.4042741527567021,"acs":3197,"articleLive":2,"columnArticles":52,"formTitle":"[675]为高尔夫比赛砍树","frequency":0.5299663557,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","submitted":7908,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5942162200381814,"acs":8404,"articleLive":2,"columnArticles":143,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","submitted":14143,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6667142296579032,"acs":37380,"articleLive":2,"columnArticles":560,"formTitle":"[677]键值映射","frequency":1.6143688138,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","submitted":56066,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.38639676513460763,"acs":46919,"articleLive":2,"columnArticles":500,"formTitle":"[678]有效的括号字符串","frequency":3.1997834966,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"ac","submitted":121427,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5400811470889466,"acs":27421,"articleLive":2,"columnArticles":270,"formTitle":"[679]24 点游戏","frequency":3.3797200857,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","submitted":50772,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.4003327264470842,"acs":94330,"articleLive":2,"columnArticles":882,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":1.5544706722,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","submitted":235629,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5027797081306463,"acs":2894,"articleLive":2,"columnArticles":68,"formTitle":"[681]最近时刻","frequency":0.6284711262,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"","submitted":5756,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6942545723258822,"acs":48854,"articleLive":2,"columnArticles":547,"formTitle":"[682]棒球比赛","frequency":1.0182071603,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"ac","submitted":70369,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.43561454921565246,"acs":2527,"articleLive":2,"columnArticles":54,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"","submitted":5801,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.6669077458749626,"acs":64548,"articleLive":2,"columnArticles":648,"formTitle":"[684]冗余连接","frequency":0.988662914,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","submitted":96787,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.4283841900471022,"acs":20918,"articleLive":2,"columnArticles":264,"formTitle":"[685]冗余连接 II","frequency":0.0,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","submitted":48830,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.4015499046648166,"acs":42541,"articleLive":2,"columnArticles":568,"formTitle":"[686]重复叠加字符串匹配","frequency":0.7109642855,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","submitted":105942,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.44374197372320456,"acs":40428,"articleLive":2,"columnArticles":286,"formTitle":"[687]最长同值路径","frequency":1.7925558035,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","submitted":91107,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5135616357053832,"acs":8653,"articleLive":2,"columnArticles":113,"formTitle":"[688]“马”在棋盘上的概率","frequency":1.6786996721,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","submitted":16849,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.5623852951972217,"acs":19918,"articleLive":2,"columnArticles":266,"formTitle":"[689]三个无重叠子数组的最大和","frequency":1.9650996448,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","submitted":35417,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6492363448097334,"acs":57684,"articleLive":2,"columnArticles":587,"formTitle":"[690]员工的重要性","frequency":1.0182071603,"frontendQuestionId":"690","leaf":true,"level":2,"nodeType":"def","questionId":"690","status":"ac","submitted":88849,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.48758278145695366,"acs":4123,"articleLive":2,"columnArticles":53,"formTitle":"[691]贴纸拼词","frequency":1.0808941382,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","submitted":8456,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5743486878238652,"acs":72156,"articleLive":2,"columnArticles":788,"formTitle":"[692]前K个高频单词","frequency":1.8886727603,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"ac","submitted":125631,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6089247381773238,"acs":28083,"articleLive":2,"columnArticles":319,"formTitle":"[693]交替位二进制数","frequency":0.0,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","submitted":46119,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5386018930322728,"acs":4723,"articleLive":2,"columnArticles":89,"formTitle":"[694]不同岛屿的数量","frequency":0.0,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"","submitted":8769,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6682086787793262,"acs":151523,"articleLive":2,"columnArticles":1500,"formTitle":"[695]岛屿的最大面积","frequency":3.2913655089,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"ac","submitted":226760,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6336814591212426,"acs":54790,"articleLive":2,"columnArticles":494,"formTitle":"[696]计数二进制子串","frequency":1.6143688138,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","submitted":86463,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.6040071376598177,"acs":69729,"articleLive":2,"columnArticles":885,"formTitle":"[697]数组的度","frequency":0.4442975611,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","submitted":115444,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.45005408828263105,"acs":34115,"articleLive":2,"columnArticles":242,"formTitle":"[698]划分为k个相等的子集","frequency":2.7584434765,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","submitted":75802,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.4830413116862241,"acs":3005,"articleLive":2,"columnArticles":45,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","submitted":6221,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.7743274781967817,"acs":126076,"articleLive":2,"columnArticles":823,"formTitle":"[700]二叉搜索树中的搜索","frequency":2.0239294907,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"ac","submitted":162820,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7215801178514033,"acs":88903,"articleLive":2,"columnArticles":656,"formTitle":"[701]二叉搜索树中的插入操作","frequency":1.2105634571,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"ac","submitted":123206,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7437916414294367,"acs":4912,"articleLive":2,"columnArticles":86,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"786","status":"","submitted":6604,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5139416426109694,"acs":64272,"articleLive":2,"columnArticles":593,"formTitle":"[703]数据流中的第 K 大元素","frequency":1.6459420757,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","submitted":125057,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.5483033231027911,"acs":380880,"articleLive":2,"columnArticles":1821,"formTitle":"[704]二分查找","frequency":4.7552022293,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"ac","submitted":694652,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6425786074743268,"acs":72835,"articleLive":2,"columnArticles":457,"formTitle":"[705]设计哈希集合","frequency":2.6333759084,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"ac","submitted":113348,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6415086824916362,"acs":64428,"articleLive":2,"columnArticles":420,"formTitle":"[706]设计哈希映射","frequency":1.3199121576,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"ac","submitted":100432,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.3259290380858349,"acs":77576,"articleLive":2,"columnArticles":521,"formTitle":"[707]设计链表","frequency":2.602439228,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"ac","submitted":238015,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.34913071474565355,"acs":2711,"articleLive":2,"columnArticles":56,"formTitle":"[708]循环有序列表的插入","frequency":0.594008722,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"850","status":"","submitted":7765,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7729545348348208,"acs":99252,"articleLive":2,"columnArticles":720,"formTitle":"[709]转换成小写字母","frequency":0.7646828925,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","submitted":128406,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.36272592592592595,"acs":6121,"articleLive":2,"columnArticles":70,"formTitle":"[710]黑名单中的随机数","frequency":0.4716067405,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","submitted":16875,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5549335199440167,"acs":793,"articleLive":2,"columnArticles":27,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"","submitted":1429,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6759731651468285,"acs":16827,"articleLive":2,"columnArticles":194,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":0.9602114928,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","submitted":24893,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.4270061462461945,"acs":29735,"articleLive":2,"columnArticles":258,"formTitle":"[713]乘积小于K的子数组","frequency":2.3585185488,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"ac","submitted":69636,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7276460090010863,"acs":112529,"articleLive":2,"columnArticles":766,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":2.0204300471,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"","submitted":154648,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.41004705231109884,"acs":2963,"articleLive":2,"columnArticles":51,"formTitle":"[715]Range 模块","frequency":0.0,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","submitted":7226,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.46643073811931246,"acs":4613,"articleLive":2,"columnArticles":84,"formTitle":"[716]最大栈","frequency":0.5001312072,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"ac","submitted":9890,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5116326054860517,"acs":32921,"articleLive":2,"columnArticles":404,"formTitle":"[717]1比特与2比特字符","frequency":0.0,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","submitted":64345,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5647651816974526,"acs":93559,"articleLive":2,"columnArticles":633,"formTitle":"[718]最长重复子数组","frequency":2.7414836515,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","submitted":165660,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.37666679329863617,"acs":9915,"articleLive":2,"columnArticles":93,"formTitle":"[719]找出第 k 小的距离对","frequency":2.2812344635,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","submitted":26323,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.4844333487181639,"acs":23091,"articleLive":2,"columnArticles":312,"formTitle":"[720]词典中最长的单词","frequency":1.2911800528,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","submitted":47666,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.4714629041010931,"acs":30407,"articleLive":2,"columnArticles":347,"formTitle":"[721]账户合并","frequency":0.988662914,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","submitted":64495,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.3220522702637601,"acs":5348,"articleLive":2,"columnArticles":75,"formTitle":"[722]删除注释","frequency":1.9963034245,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","submitted":16606,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7230392156862745,"acs":1475,"articleLive":2,"columnArticles":42,"formTitle":"[723]粉碎糖果","frequency":0.743540456,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"","submitted":2040,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.47064060286133436,"acs":150140,"articleLive":2,"columnArticles":931,"formTitle":"[724]寻找数组的中心下标","frequency":1.9349344781,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"ac","submitted":319012,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.6082434607162588,"acs":50646,"articleLive":2,"columnArticles":652,"formTitle":"[725]分隔链表","frequency":2.5486512584,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"ac","submitted":83266,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5523969059466917,"acs":22424,"articleLive":2,"columnArticles":408,"formTitle":"[726]原子的数量","frequency":2.9469188989,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"ac","submitted":40594,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.40780803182891956,"acs":3280,"articleLive":2,"columnArticles":55,"formTitle":"[727]最小窗口子序列","frequency":2.0352188407,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"","submitted":8043,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7579426394327442,"acs":35809,"articleLive":2,"columnArticles":327,"formTitle":"[728]自除数","frequency":0.4442975611,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","submitted":47245,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.5196328133290884,"acs":9793,"articleLive":2,"columnArticles":121,"formTitle":"[729]我的日程安排表 I","frequency":0.0,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","submitted":18846,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.4960322160369537,"acs":4188,"articleLive":2,"columnArticles":52,"formTitle":"[730]统计不同回文子序列","frequency":1.5167303442,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","submitted":8443,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5035694673256452,"acs":4585,"articleLive":2,"columnArticles":50,"formTitle":"[731]我的日程安排表 II","frequency":0.0,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","submitted":9105,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6175852594149022,"acs":3821,"articleLive":2,"columnArticles":59,"formTitle":"[732]我的日程安排表 III","frequency":1.4805818301,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","submitted":6187,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5794421059518876,"acs":79704,"articleLive":2,"columnArticles":668,"formTitle":"[733]图像渲染","frequency":2.8242067375,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"ac","submitted":137553,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.4764804703905922,"acs":2269,"articleLive":2,"columnArticles":41,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"","submitted":4762,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.4105423647514304,"acs":23965,"articleLive":2,"columnArticles":300,"formTitle":"[735]行星碰撞","frequency":2.8110058066,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"ac","submitted":58374,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.4703196347031963,"acs":1648,"articleLive":2,"columnArticles":48,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","submitted":3504,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.4684594953519256,"acs":4233,"articleLive":2,"columnArticles":75,"formTitle":"[737]句子相似性 II","frequency":0.5299663557,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"","submitted":9036,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.5014552321706287,"acs":45141,"articleLive":2,"columnArticles":620,"formTitle":"[738]单调递增的数字","frequency":1.712728134,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"ac","submitted":90020,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6833593322545721,"acs":234805,"articleLive":2,"columnArticles":1655,"formTitle":"[739]每日温度","frequency":3.5382051299,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"ac","submitted":343604,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.6280413344416054,"acs":61202,"articleLive":2,"columnArticles":675,"formTitle":"[740]删除并获得点数","frequency":2.8007778403,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","submitted":97449,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.3706678306416412,"acs":4246,"articleLive":2,"columnArticles":49,"formTitle":"[741]摘樱桃","frequency":1.9498913827,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","submitted":11455,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.490837327318861,"acs":1741,"articleLive":2,"columnArticles":49,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"","submitted":3547,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.5262468931234465,"acs":63518,"articleLive":2,"columnArticles":564,"formTitle":"[743]网络延迟时间","frequency":2.6653530534,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"ac","submitted":120700,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.4592627667349481,"acs":44616,"articleLive":2,"columnArticles":400,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":0.3456225535,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","submitted":97147,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.4021792966815255,"acs":3248,"articleLive":2,"columnArticles":59,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","submitted":8076,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5989223584178468,"acs":158506,"articleLive":2,"columnArticles":1482,"formTitle":"[746]使用最小花费爬楼梯","frequency":2.4209830975,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","submitted":264652,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.4202245393210486,"acs":47274,"articleLive":2,"columnArticles":431,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":0.0,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","submitted":112497,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.6820830361957108,"acs":39215,"articleLive":2,"columnArticles":496,"formTitle":"[748]最短补全词","frequency":0.845669951,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","submitted":57493,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.5048169556840078,"acs":1572,"articleLive":2,"columnArticles":37,"formTitle":"[749]隔离病毒","frequency":0.0,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","submitted":3114,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.7185929648241206,"acs":2145,"articleLive":2,"columnArticles":43,"formTitle":"[750]角矩形的数量","frequency":0.8320938533,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"","submitted":2985,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.49425675675675673,"acs":1463,"articleLive":2,"columnArticles":28,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","questionId":"752","status":"","submitted":2960,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5303628725018,"acs":75870,"articleLive":2,"columnArticles":636,"formTitle":"[752]打开转盘锁","frequency":1.2634159152,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"ac","submitted":143053,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.598127771391033,"acs":3642,"articleLive":2,"columnArticles":48,"formTitle":"[753]破解保险箱","frequency":1.0489221055,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","submitted":6089,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.4330532212885154,"acs":8503,"articleLive":2,"columnArticles":100,"formTitle":"[754]到达终点数字","frequency":0.5299663557,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","submitted":19635,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.49821683309557774,"acs":1397,"articleLive":2,"columnArticles":32,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"","submitted":2804,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.5559456398640996,"acs":4909,"articleLive":2,"columnArticles":72,"formTitle":"[756]金字塔转换矩阵","frequency":0.0,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","submitted":8830,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.4238709677419355,"acs":2628,"articleLive":2,"columnArticles":40,"formTitle":"[757]设置交集大小至少为2","frequency":0.0,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","submitted":6200,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.4645061728395062,"acs":3612,"articleLive":2,"columnArticles":71,"formTitle":"[758]字符串中的加粗单词","frequency":0.0,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","questionId":"760","status":"","submitted":7776,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6727660872217139,"acs":2206,"articleLive":2,"columnArticles":51,"formTitle":"[759]员工空闲时间","frequency":0.0,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"","submitted":3279,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.83492252681764,"acs":4203,"articleLive":2,"columnArticles":96,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"","submitted":5034,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.594760759155306,"acs":2225,"articleLive":2,"columnArticles":36,"formTitle":"[761]特殊的二进制序列","frequency":0.0,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","submitted":3741,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.7026022304832714,"acs":18900,"articleLive":2,"columnArticles":166,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"767","status":"","submitted":26900,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7633739673584525,"acs":90927,"articleLive":2,"columnArticles":1065,"formTitle":"[763]划分字母区间","frequency":2.761054444,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","submitted":119112,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.498820887142055,"acs":4442,"articleLive":2,"columnArticles":60,"formTitle":"[764]最大加号标志","frequency":0.5299663557,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","submitted":8905,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.6640468485128679,"acs":30163,"articleLive":2,"columnArticles":454,"formTitle":"[765]情侣牵手","frequency":1.6459420757,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","submitted":45423,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7064411319725191,"acs":56966,"articleLive":2,"columnArticles":652,"formTitle":"[766]托普利茨矩阵","frequency":0.4181180555,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","submitted":80638,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.47784726605083483,"acs":41642,"articleLive":2,"columnArticles":504,"formTitle":"[767]重构字符串","frequency":2.5903413307,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","submitted":87145,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.5134071340713408,"acs":6261,"articleLive":2,"columnArticles":91,"formTitle":"[768]最多能完成排序的块 II","frequency":0.4181180555,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","submitted":12195,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5847203728362184,"acs":14052,"articleLive":2,"columnArticles":170,"formTitle":"[769]最多能完成排序的块","frequency":0.4442975611,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","submitted":24032,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5640468953538862,"acs":1299,"articleLive":2,"columnArticles":26,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","submitted":2303,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8513803182851575,"acs":157284,"articleLive":2,"columnArticles":1170,"formTitle":"[771]宝石与石头","frequency":1.0182071603,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"ac","submitted":184740,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.4972843797523354,"acs":6867,"articleLive":2,"columnArticles":131,"formTitle":"[772]基本计算器 III","frequency":1.0489221055,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"","submitted":13809,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.709597416080286,"acs":24606,"articleLive":2,"columnArticles":349,"formTitle":"[773]滑动谜题","frequency":1.0182071603,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","submitted":34676,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5936739659367397,"acs":1220,"articleLive":2,"columnArticles":23,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.7030490946,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"","submitted":2055,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.4570452604611443,"acs":5352,"articleLive":2,"columnArticles":85,"formTitle":"[775]全局倒置与局部倒置","frequency":0.5299663557,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","submitted":11710,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5694110576923077,"acs":1895,"articleLive":2,"columnArticles":39,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"","submitted":3328,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.32445850837470674,"acs":5947,"articleLive":2,"columnArticles":65,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":1.1853732082,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","submitted":18329,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5929056093497211,"acs":24554,"articleLive":2,"columnArticles":356,"formTitle":"[778]水位上升的泳池中游泳","frequency":0.0,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","submitted":41413,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.43677340176280266,"acs":19574,"articleLive":2,"columnArticles":243,"formTitle":"[779]第K个语法符号","frequency":1.6459420757,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","submitted":44815,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.2877797745466427,"acs":3523,"articleLive":2,"columnArticles":54,"formTitle":"[780]到达终点","frequency":0.5612188992,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","submitted":12242,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.6131864206520395,"acs":44632,"articleLive":2,"columnArticles":682,"formTitle":"[781]森林中的兔子","frequency":2.0286164134,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","submitted":72787,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.4162826420890937,"acs":1626,"articleLive":2,"columnArticles":34,"formTitle":"[782]变为棋盘","frequency":0.0,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","submitted":3906,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5966141562722589,"acs":72034,"articleLive":2,"columnArticles":697,"formTitle":"[783]二叉搜索树节点最小距离","frequency":0.3929911054,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"ac","submitted":120738,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6906332995646579,"acs":50448,"articleLive":2,"columnArticles":583,"formTitle":"[784]字母大小写全排列","frequency":1.9963034245,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"ac","submitted":73046,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5167146671641617,"acs":44315,"articleLive":2,"columnArticles":440,"formTitle":"[785]判断二分图","frequency":1.8554735886,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"ac","submitted":85763,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.6747752794003894,"acs":25298,"articleLive":2,"columnArticles":258,"formTitle":"[786]第 K 个最小的素数分数","frequency":2.1761588888,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","submitted":37491,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.3889288343348227,"acs":45437,"articleLive":2,"columnArticles":429,"formTitle":"[787]K 站中转内最便宜的航班","frequency":2.8051965652,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"ac","submitted":116826,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.6090458089040655,"acs":18906,"articleLive":2,"columnArticles":197,"formTitle":"[788]旋转数字","frequency":0.0,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","questionId":"804","status":"","submitted":31042,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6902901604798184,"acs":21292,"articleLive":2,"columnArticles":301,"formTitle":"[789]逃脱阻碍者","frequency":2.3737488157,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"ac","submitted":30845,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.4534524949462709,"acs":4262,"articleLive":2,"columnArticles":74,"formTitle":"[790]多米诺和托米诺平铺","frequency":0.5001312072,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","submitted":9399,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6967944759445349,"acs":12412,"articleLive":2,"columnArticles":218,"formTitle":"[791]自定义字符串排序","frequency":1.0182071603,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","submitted":17813,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.4652545171486531,"acs":9862,"articleLive":2,"columnArticles":107,"formTitle":"[792]匹配子序列的单词数","frequency":1.4805818301,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","submitted":21197,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.3953423316315826,"acs":5653,"articleLive":2,"columnArticles":72,"formTitle":"[793]阶乘函数后 K 个零","frequency":0.0,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","submitted":14299,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3895283663704716,"acs":28494,"articleLive":2,"columnArticles":462,"formTitle":"[794]有效的井字游戏","frequency":0.0760722799,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","submitted":73150,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.53014131536581,"acs":8891,"articleLive":2,"columnArticles":101,"formTitle":"[795]区间子数组个数","frequency":1.8886727603,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","submitted":16771,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5398478256386993,"acs":26181,"articleLive":2,"columnArticles":330,"formTitle":"[796]旋转字符串","frequency":2.2404235771,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","submitted":48497,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.789692186266772,"acs":50027,"articleLive":2,"columnArticles":605,"formTitle":"[797]所有可能的路径","frequency":2.2098775248,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"ac","submitted":63350,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.4714503816793893,"acs":1544,"articleLive":2,"columnArticles":38,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","submitted":3275,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.4142163859548958,"acs":5804,"articleLive":2,"columnArticles":75,"formTitle":"[799]香槟塔","frequency":1.3805429075,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","submitted":14012,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7030625832223701,"acs":1584,"articleLive":2,"columnArticles":39,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"","submitted":2253,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.4207280467172406,"acs":7709,"articleLive":2,"columnArticles":92,"formTitle":"[801]使序列递增的最小交换次数","frequency":1.6786996721,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","questionId":"819","status":"","submitted":18323,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5776658715434225,"acs":32693,"articleLive":2,"columnArticles":344,"formTitle":"[802]找到最终的安全状态","frequency":2.5208278926,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"ac","submitted":56595,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.4800612323000383,"acs":12544,"articleLive":2,"columnArticles":128,"formTitle":"[803]打砖块","frequency":0.6284711262,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","submitted":26130,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7739040645827466,"acs":41222,"articleLive":2,"columnArticles":424,"formTitle":"[804]唯一摩尔斯密码词","frequency":0.988662914,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","submitted":53265,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.2982525814138205,"acs":3004,"articleLive":2,"columnArticles":45,"formTitle":"[805]数组的均值分割","frequency":0.5299663557,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","submitted":10072,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.6547139950260005,"acs":14479,"articleLive":2,"columnArticles":170,"formTitle":"[806]写字符串需要的行数","frequency":0.4442975611,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","submitted":22115,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8891336863807252,"acs":43989,"articleLive":2,"columnArticles":619,"formTitle":"[807]保持城市天际线","frequency":1.2341633724,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","submitted":49474,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.48382458662832495,"acs":4711,"articleLive":2,"columnArticles":43,"formTitle":"[808]分汤","frequency":0.594008722,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","submitted":9737,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.42083701502128684,"acs":5239,"articleLive":2,"columnArticles":100,"formTitle":"[809]情感丰富的文字","frequency":0.4181180555,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","submitted":12449,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7304927686845067,"acs":16870,"articleLive":2,"columnArticles":135,"formTitle":"[810]黑板异或游戏","frequency":0.5001312072,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"ac","submitted":23094,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7061007728509132,"acs":16354,"articleLive":2,"columnArticles":209,"formTitle":"[811]子域名访问计数","frequency":0.9602114928,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","questionId":"829","status":"","submitted":23161,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.6330939137009235,"acs":11723,"articleLive":2,"columnArticles":110,"formTitle":"[812]最大三角形面积","frequency":0.4716067405,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","submitted":18517,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5544604681498659,"acs":7651,"articleLive":2,"columnArticles":91,"formTitle":"[813]最大平均值和的分组","frequency":0.0,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","submitted":13799,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.6999575611826284,"acs":24740,"articleLive":2,"columnArticles":383,"formTitle":"[814]二叉树剪枝","frequency":1.3805429075,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","submitted":35345,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.43275506565586097,"acs":27914,"articleLive":2,"columnArticles":325,"formTitle":"[815]公交路线","frequency":2.7682715654,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"ac","submitted":64503,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.5127931769722814,"acs":3848,"articleLive":2,"columnArticles":70,"formTitle":"[816]模糊坐标","frequency":0.5299663557,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","submitted":7504,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5924394319131161,"acs":14183,"articleLive":2,"columnArticles":177,"formTitle":"[817]链表组件","frequency":0.5001312072,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"ac","submitted":23940,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.4344049633389735,"acs":3851,"articleLive":2,"columnArticles":48,"formTitle":"[818]赛车","frequency":0.5612188992,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","submitted":8865,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.42221427933160577,"acs":23625,"articleLive":2,"columnArticles":267,"formTitle":"[819]最常见的单词","frequency":0.3929911054,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","submitted":55955,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5096800597886045,"acs":57286,"articleLive":2,"columnArticles":629,"formTitle":"[820]单词的压缩编码","frequency":0.4181180555,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","submitted":112396,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.6943971541100241,"acs":27328,"articleLive":2,"columnArticles":372,"formTitle":"[821]字符的最短距离","frequency":1.3199121576,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","submitted":39355,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5086527575610545,"acs":3145,"articleLive":2,"columnArticles":42,"formTitle":"[822]翻转卡片游戏","frequency":0.6284711262,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","submitted":6183,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.4273914201971756,"acs":3208,"articleLive":2,"columnArticles":56,"formTitle":"[823]带因子的二叉树","frequency":0.5299663557,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","submitted":7506,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6173376108178964,"acs":17896,"articleLive":2,"columnArticles":249,"formTitle":"[824]山羊拉丁文","frequency":0.0,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","submitted":28989,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.45424179764882805,"acs":31414,"articleLive":2,"columnArticles":310,"formTitle":"[825]适龄的朋友","frequency":1.2716470919,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"ac","submitted":69157,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.381356302741463,"acs":8722,"articleLive":2,"columnArticles":128,"formTitle":"[826]安排工作以达到最大收益","frequency":1.6459420757,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","submitted":22871,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.39210291493158833,"acs":10546,"articleLive":2,"columnArticles":204,"formTitle":"[827]最大人工岛","frequency":1.0808941382,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","submitted":26896,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.502324926025081,"acs":3565,"articleLive":2,"columnArticles":57,"formTitle":"[828]统计子串中的唯一字符","frequency":0.4716067405,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"855","status":"","submitted":7097,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.367866927592955,"acs":9399,"articleLive":2,"columnArticles":111,"formTitle":"[829]连续整数求和","frequency":1.0182071603,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","submitted":25550,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.542944156190398,"acs":52949,"articleLive":2,"columnArticles":596,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","submitted":97522,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.4074550128534704,"acs":7925,"articleLive":2,"columnArticles":79,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","submitted":19450,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.7955357385114907,"acs":87960,"articleLive":2,"columnArticles":963,"formTitle":"[832]翻转图像","frequency":0.4442975611,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","submitted":110567,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.4381367135858154,"acs":5634,"articleLive":2,"columnArticles":84,"formTitle":"[833]字符串中的查找与替换","frequency":0.0,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","submitted":12859,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5268891446106636,"acs":13736,"articleLive":2,"columnArticles":134,"formTitle":"[834]树中距离之和","frequency":1.1853732082,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","submitted":26070,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5763677811550152,"acs":4551,"articleLive":2,"columnArticles":52,"formTitle":"[835]图像重叠","frequency":0.5001312072,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","submitted":7896,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.4810378267605118,"acs":39435,"articleLive":2,"columnArticles":675,"formTitle":"[836]矩形重叠","frequency":1.8554735886,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","submitted":81979,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.3958425297965408,"acs":19728,"articleLive":2,"columnArticles":247,"formTitle":"[837]新 21 点","frequency":1.1853732082,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","submitted":49838,"title":"新 21 点","titleSlug":"new-21-game"},{"acceptance":0.5013143553247419,"acs":7819,"articleLive":2,"columnArticles":139,"formTitle":"[838]推多米诺","frequency":2.4526082093,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","submitted":15597,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5751376868607396,"acs":19737,"articleLive":2,"columnArticles":277,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","submitted":34317,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.3606080583239617,"acs":9299,"articleLive":2,"columnArticles":118,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","submitted":25787,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.6594280076684194,"acs":58819,"articleLive":2,"columnArticles":582,"formTitle":"[841]钥匙和房间","frequency":1.3496762595,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"ac","submitted":89197,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.48743802760284066,"acs":29102,"articleLive":2,"columnArticles":325,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":1.8554735886,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","submitted":59704,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.38585047666833916,"acs":3076,"articleLive":2,"columnArticles":37,"formTitle":"[843]猜猜这个单词","frequency":0.0,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","submitted":7972,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.507216901964656,"acs":102752,"articleLive":2,"columnArticles":1094,"formTitle":"[844]比较含退格的字符串","frequency":1.1609460044,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"ac","submitted":202580,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.42202210397052803,"acs":39178,"articleLive":2,"columnArticles":575,"formTitle":"[845]数组中的最长山脉","frequency":1.8886727603,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","submitted":92834,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5730153042944157,"acs":33585,"articleLive":2,"columnArticles":477,"formTitle":"[846]一手顺子","frequency":0.8013600268,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","submitted":58611,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.6790401463706415,"acs":19299,"articleLive":2,"columnArticles":161,"formTitle":"[847]访问所有节点的最短路径","frequency":2.9563130497,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"ac","submitted":28421,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.44817017383348584,"acs":9797,"articleLive":2,"columnArticles":107,"formTitle":"[848]字母移位","frequency":1.6786996721,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","submitted":21860,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.42814624759461195,"acs":16687,"articleLive":2,"columnArticles":201,"formTitle":"[849]到最近的人的最大距离","frequency":0.0,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","submitted":38975,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.44846843797596886,"acs":2650,"articleLive":2,"columnArticles":45,"formTitle":"[850]矩形面积 II","frequency":2.1706568116,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","submitted":5909,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.6286212045793927,"acs":25258,"articleLive":2,"columnArticles":272,"formTitle":"[851]喧闹和富有","frequency":0.9546460287,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","submitted":40180,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7138801387615136,"acs":89517,"articleLive":2,"columnArticles":770,"formTitle":"[852]山脉数组的峰顶索引","frequency":0.0,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"ac","submitted":125395,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.3894641740218222,"acs":11208,"articleLive":2,"columnArticles":141,"formTitle":"[853]车队","frequency":1.6459420757,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","submitted":28778,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.36363636363636365,"acs":4584,"articleLive":2,"columnArticles":75,"formTitle":"[854]相似度为 K 的字符串","frequency":0.0,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","submitted":12606,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.4129687842678558,"acs":5649,"articleLive":2,"columnArticles":65,"formTitle":"[855]考场就座","frequency":0.4442975611,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","submitted":13679,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6295742274435404,"acs":17256,"articleLive":2,"columnArticles":235,"formTitle":"[856]括号的分数","frequency":2.6984412663,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"ac","submitted":27409,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.47176841501863,"acs":3292,"articleLive":2,"columnArticles":52,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":0.4181180555,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","submitted":6978,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.555256064690027,"acs":3090,"articleLive":2,"columnArticles":52,"formTitle":"[858]镜面反射","frequency":1.8636589498,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","submitted":5565,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.3458199665806925,"acs":59397,"articleLive":2,"columnArticles":752,"formTitle":"[859]亲密字符串","frequency":2.4185938956,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","submitted":171757,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5855984027449832,"acs":97963,"articleLive":2,"columnArticles":845,"formTitle":"[860]柠檬水找零","frequency":1.2365614551,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"ac","submitted":167287,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8093294019807968,"acs":32115,"articleLive":2,"columnArticles":454,"formTitle":"[861]翻转矩阵后的得分","frequency":1.114219448,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"ac","submitted":39681,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.19670595581921785,"acs":17640,"articleLive":2,"columnArticles":139,"formTitle":"[862]和至少为 K 的最短子数组","frequency":2.3385896309,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","submitted":89677,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.6062170333204683,"acs":37697,"articleLive":2,"columnArticles":583,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":2.5724789284,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"ac","submitted":62184,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.462975875052294,"acs":3320,"articleLive":2,"columnArticles":47,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.594008722,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","submitted":7171,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.664483357839861,"acs":9942,"articleLive":2,"columnArticles":142,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.4181180555,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","submitted":14962,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.22765527688941256,"acs":8115,"articleLive":2,"columnArticles":96,"formTitle":"[866]回文素数","frequency":0.5001312072,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","submitted":35646,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6687424981683839,"acs":85801,"articleLive":2,"columnArticles":770,"formTitle":"[867]转置矩阵","frequency":1.3805429075,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","submitted":128302,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6264426217609058,"acs":17261,"articleLive":2,"columnArticles":252,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","submitted":27554,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.6424491392801251,"acs":32842,"articleLive":2,"columnArticles":470,"formTitle":"[869]重新排序得到 2 的幂","frequency":1.8886727603,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"ac","submitted":51120,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.4385413146882229,"acs":16872,"articleLive":2,"columnArticles":217,"formTitle":"[870]优势洗牌","frequency":1.6143688138,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"ac","submitted":38473,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.34680997929198304,"acs":10551,"articleLive":2,"columnArticles":135,"formTitle":"[871]最低加油次数","frequency":2.062116643,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","submitted":30423,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.651963094452648,"acs":62254,"articleLive":2,"columnArticles":745,"formTitle":"[872]叶子相似的树","frequency":0.0,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"ac","submitted":95487,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.519743534416325,"acs":16861,"articleLive":2,"columnArticles":126,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":1.9231446693,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","submitted":32441,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.41956930472369214,"acs":21646,"articleLive":2,"columnArticles":243,"formTitle":"[874]模拟行走机器人","frequency":1.4125900849,"frontendQuestionId":"874","leaf":true,"level":2,"nodeType":"def","questionId":"906","status":"","submitted":51591,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.48224458530946984,"acs":52569,"articleLive":2,"columnArticles":414,"formTitle":"[875]爱吃香蕉的珂珂","frequency":1.8234606116,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","submitted":109009,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7058248913208458,"acs":181361,"articleLive":2,"columnArticles":1881,"formTitle":"[876]链表的中间结点","frequency":2.4354472802,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"ac","submitted":256949,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7581929311719373,"acs":71327,"articleLive":2,"columnArticles":500,"formTitle":"[877]石子游戏","frequency":1.2911800528,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"ac","submitted":94075,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.28574844571975133,"acs":4780,"articleLive":2,"columnArticles":67,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","submitted":16728,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5526943726386956,"acs":22236,"articleLive":2,"columnArticles":188,"formTitle":"[879]盈利计划","frequency":1.9231446693,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"ac","submitted":40232,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.2552117000646412,"acs":6317,"articleLive":2,"columnArticles":83,"formTitle":"[880]索引处的解码字符串","frequency":0.0,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"ac","submitted":24752,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.5380060500740169,"acs":50154,"articleLive":2,"columnArticles":608,"formTitle":"[881]救生艇","frequency":3.5333413071,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"ac","submitted":93222,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.49301444470755384,"acs":2082,"articleLive":2,"columnArticles":35,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","submitted":4223,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.6935144557312015,"acs":11538,"articleLive":2,"columnArticles":124,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","submitted":16637,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.662828894913092,"acs":20783,"articleLive":2,"columnArticles":270,"formTitle":"[884]两句话中的不常见单词","frequency":1.0489221055,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","submitted":31355,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6979209131675499,"acs":5136,"articleLive":2,"columnArticles":75,"formTitle":"[885]螺旋矩阵 III","frequency":1.0808941382,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","submitted":7359,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.4404863481228669,"acs":10325,"articleLive":2,"columnArticles":138,"formTitle":"[886]可能的二分法","frequency":1.8886727603,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","submitted":23440,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.2907366431072633,"acs":54134,"articleLive":2,"columnArticles":355,"formTitle":"[887]鸡蛋掉落","frequency":2.6984412663,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","submitted":186196,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6410431535930973,"acs":56315,"articleLive":2,"columnArticles":480,"formTitle":"[888]公平的糖果交换","frequency":0.0,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","submitted":87849,"title":"公平的糖果交换","titleSlug":"fair-candy-swap"},{"acceptance":0.6746737128673232,"acs":16852,"articleLive":2,"columnArticles":167,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":1.8554735886,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"925","status":"","submitted":24978,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.7278890115087499,"acs":9234,"articleLive":2,"columnArticles":133,"formTitle":"[890]查找和替换模式","frequency":0.5612188992,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","submitted":12686,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.33152173913043476,"acs":2989,"articleLive":2,"columnArticles":40,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","submitted":9016,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6385356309729852,"acs":33942,"articleLive":2,"columnArticles":693,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","submitted":53156,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.7246918436926305,"acs":11053,"articleLive":2,"columnArticles":112,"formTitle":"[893]特殊等价字符串组","frequency":0.0,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","questionId":"929","status":"","submitted":15252,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7756449375866852,"acs":13981,"articleLive":2,"columnArticles":131,"formTitle":"[894]所有可能的满二叉树","frequency":0.4716067405,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","submitted":18025,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.5585149313962873,"acs":8304,"articleLive":2,"columnArticles":93,"formTitle":"[895]最大频率栈","frequency":2.1761588888,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","submitted":14868,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5846616370752737,"acs":61842,"articleLive":2,"columnArticles":737,"formTitle":"[896]单调数列","frequency":0.3929911054,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","submitted":105774,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.7429719800532067,"acs":64513,"articleLive":2,"columnArticles":741,"formTitle":"[897]递增顺序搜索树","frequency":0.0,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"ac","submitted":86831,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.3427260812581914,"acs":5753,"articleLive":2,"columnArticles":41,"formTitle":"[898]子数组按位或操作","frequency":0.4442975611,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","submitted":16786,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5417169037858693,"acs":4493,"articleLive":2,"columnArticles":53,"formTitle":"[899]有序队列","frequency":0.0,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","submitted":8294,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.4993279569892473,"acs":3715,"articleLive":2,"columnArticles":60,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","submitted":7440,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.5503857721982477,"acs":21044,"articleLive":2,"columnArticles":254,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"ac","submitted":38235,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.3398923333952107,"acs":3662,"articleLive":2,"columnArticles":83,"formTitle":"[902]最大为 N 的数字组合","frequency":1.114219448,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","submitted":10774,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.5372507869884575,"acs":3072,"articleLive":2,"columnArticles":45,"formTitle":"[903]DI 序列的有效排列","frequency":0.8807415775,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","submitted":5718,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.4480458365668808,"acs":27135,"articleLive":2,"columnArticles":387,"formTitle":"[904]水果成篮","frequency":2.3954958944,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","submitted":60563,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.6999200730760448,"acs":61299,"articleLive":2,"columnArticles":650,"formTitle":"[905]按奇偶排序数组","frequency":1.4125900849,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","submitted":87580,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.2885068299576072,"acs":2450,"articleLive":2,"columnArticles":44,"formTitle":"[906]超级回文数","frequency":0.0,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","submitted":8492,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.3228254524226503,"acs":12719,"articleLive":2,"columnArticles":138,"formTitle":"[907]子数组的最小值之和","frequency":1.9963034245,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"ac","submitted":39399,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.6980424041528551,"acs":22322,"articleLive":2,"columnArticles":207,"formTitle":"[908]最小差值 I","frequency":0.0,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","submitted":31978,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.45934072006852533,"acs":16624,"articleLive":2,"columnArticles":199,"formTitle":"[909]蛇梯棋","frequency":0.5612188992,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"ac","submitted":36191,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.3212707182320442,"acs":6978,"articleLive":2,"columnArticles":71,"formTitle":"[910]最小差值 II","frequency":0.4442975611,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","submitted":21720,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.5426705034762335,"acs":25836,"articleLive":2,"columnArticles":320,"formTitle":"[911]在线选举","frequency":0.9969893568,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","submitted":47609,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.5573849756237635,"acs":263987,"articleLive":2,"columnArticles":1196,"formTitle":"[912]排序数组","frequency":3.9153614522,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"ac","submitted":473617,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.4040187280530628,"acs":2071,"articleLive":2,"columnArticles":35,"formTitle":"[913]猫和老鼠","frequency":0.8320938533,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","submitted":5126,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.3888086949138151,"acs":50369,"articleLive":2,"columnArticles":633,"formTitle":"[914]卡牌分组","frequency":1.0182071603,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"950","status":"ac","submitted":129547,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.46856190387998886,"acs":10120,"articleLive":2,"columnArticles":126,"formTitle":"[915]分割数组","frequency":0.4716067405,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","submitted":21598,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.44671186886972547,"acs":6786,"articleLive":2,"columnArticles":81,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","submitted":15191,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5694469628286492,"acs":31405,"articleLive":2,"columnArticles":464,"formTitle":"[917]仅仅反转字母","frequency":1.3805429075,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","submitted":55150,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.3620974133115069,"acs":27871,"articleLive":2,"columnArticles":281,"formTitle":"[918]环形子数组的最大和","frequency":2.4560782663,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","submitted":76971,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6450425822731574,"acs":6135,"articleLive":2,"columnArticles":109,"formTitle":"[919]完全二叉树插入器","frequency":0.4716067405,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","submitted":9511,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.48849042888296584,"acs":2016,"articleLive":2,"columnArticles":22,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","submitted":4127,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.7442031299904184,"acs":23301,"articleLive":2,"columnArticles":343,"formTitle":"[921]使括号有效的最少添加","frequency":1.0182071603,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"ac","submitted":31310,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7139863438473851,"acs":92332,"articleLive":2,"columnArticles":862,"formTitle":"[922]按奇偶排序数组 II","frequency":1.3496762595,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"ac","submitted":129319,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.3440530883103624,"acs":6740,"articleLive":2,"columnArticles":88,"formTitle":"[923]三数之和的多种可能","frequency":1.114219448,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","submitted":19590,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.35878413189077796,"acs":6964,"articleLive":2,"columnArticles":99,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.5299663557,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","submitted":19410,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.3868352619460982,"acs":51916,"articleLive":2,"columnArticles":694,"formTitle":"[925]长按键入","frequency":1.3805429075,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","submitted":134207,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.5338014594520171,"acs":7754,"articleLive":2,"columnArticles":146,"formTitle":"[926]将字符串翻转到单调递增","frequency":1.0808941382,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","submitted":14526,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.3417591642570656,"acs":3664,"articleLive":2,"columnArticles":77,"formTitle":"[927]三等分","frequency":1.4459042916,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","submitted":10721,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.42380106571936055,"acs":2386,"articleLive":2,"columnArticles":46,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","submitted":5630,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6447930157816473,"acs":26884,"articleLive":2,"columnArticles":240,"formTitle":"[929]独特的电子邮件地址","frequency":0.4181180555,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","submitted":41694,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.5455882808386757,"acs":35233,"articleLive":2,"columnArticles":356,"formTitle":"[930]和相同的二元子数组","frequency":2.7766672155,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"ac","submitted":64578,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6712394766203469,"acs":26471,"articleLive":2,"columnArticles":336,"formTitle":"[931]下降路径最小和","frequency":0.9602114928,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","submitted":39436,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6379405286343612,"acs":9268,"articleLive":2,"columnArticles":89,"formTitle":"[932]漂亮数组","frequency":1.0182071603,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","submitted":14528,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.7277666362807658,"acs":39918,"articleLive":2,"columnArticles":345,"formTitle":"[933]最近的请求次数","frequency":2.0286164134,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","submitted":54850,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.4711502334818314,"acs":26334,"articleLive":2,"columnArticles":293,"formTitle":"[934]最短的桥","frequency":0.4442975611,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","submitted":55893,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.4804920658028825,"acs":6601,"articleLive":2,"columnArticles":88,"formTitle":"[935]骑士拨号器","frequency":0.988662914,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","submitted":13738,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.3791599724581134,"acs":1652,"articleLive":2,"columnArticles":28,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","submitted":4357,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.5877728865331058,"acs":13085,"articleLive":2,"columnArticles":137,"formTitle":"[937]重新排列日志文件","frequency":1.0182071603,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","submitted":22262,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8201159599174963,"acs":100994,"articleLive":2,"columnArticles":836,"formTitle":"[938]二叉搜索树的范围和","frequency":1.0182071603,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"ac","submitted":123146,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.4572898539759401,"acs":6044,"articleLive":2,"columnArticles":65,"formTitle":"[939]最小面积矩形","frequency":1.0182071603,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","submitted":13217,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.42547943025383944,"acs":5347,"articleLive":2,"columnArticles":67,"formTitle":"[940]不同的子序列 II","frequency":0.0,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"notac","submitted":12567,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.3929710492937801,"acs":63824,"articleLive":2,"columnArticles":637,"formTitle":"[941]有效的山脉数组","frequency":1.3805429075,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","submitted":162414,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7323130498533724,"acs":23973,"articleLive":2,"columnArticles":227,"formTitle":"[942]增减字符串匹配","frequency":0.4442975611,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","submitted":32736,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.4564737074679629,"acs":2066,"articleLive":2,"columnArticles":46,"formTitle":"[943]最短超级串","frequency":0.6284711262,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","submitted":4526,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6867828567884389,"acs":22146,"articleLive":2,"columnArticles":190,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","submitted":32246,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.4854549562120427,"acs":36530,"articleLive":2,"columnArticles":548,"formTitle":"[945]使数组唯一的最小增量","frequency":0.4442975611,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","submitted":75249,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.6280930192974618,"acs":29521,"articleLive":2,"columnArticles":338,"formTitle":"[946]验证栈序列","frequency":1.7925558035,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"ac","submitted":47001,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6128988024499498,"acs":26818,"articleLive":2,"columnArticles":344,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"","submitted":43756,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.39368305410601484,"acs":7167,"articleLive":2,"columnArticles":103,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","submitted":18205,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.3732824427480916,"acs":8802,"articleLive":2,"columnArticles":126,"formTitle":"[949]给定数字能组成的最大时间","frequency":1.6786996721,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","submitted":23580,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7772299417301658,"acs":10404,"articleLive":2,"columnArticles":161,"formTitle":"[950]按递增顺序显示卡牌","frequency":0.988662914,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","submitted":13386,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6630194518125553,"acs":11998,"articleLive":2,"columnArticles":182,"formTitle":"[951]翻转等价二叉树","frequency":0.0,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","submitted":18096,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.36363636363636365,"acs":3436,"articleLive":2,"columnArticles":66,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","submitted":9449,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.551565921651778,"acs":15868,"articleLive":2,"columnArticles":187,"formTitle":"[953]验证外星语词典","frequency":0.4442975611,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","submitted":28769,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.30548829701372077,"acs":7570,"articleLive":2,"columnArticles":109,"formTitle":"[954]二倍数对数组","frequency":1.4459042916,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","submitted":24780,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.3334292014188477,"acs":3478,"articleLive":2,"columnArticles":56,"formTitle":"[955]删列造序 II","frequency":0.0,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","submitted":10431,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.44158926728586173,"acs":4279,"articleLive":2,"columnArticles":55,"formTitle":"[956]最高的广告牌","frequency":0.5299663557,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","submitted":9690,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.3612661127220449,"acs":14826,"articleLive":2,"columnArticles":148,"formTitle":"[957]N 天后的牢房","frequency":2.2812344635,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","submitted":41039,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5377062358840868,"acs":28093,"articleLive":2,"columnArticles":271,"formTitle":"[958]二叉树的完全性检验","frequency":1.9231446693,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","submitted":52246,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7442409923213231,"acs":20160,"articleLive":2,"columnArticles":309,"formTitle":"[959]由斜杠划分区域","frequency":1.0182071603,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","submitted":27088,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5601365546218487,"acs":2133,"articleLive":2,"columnArticles":35,"formTitle":"[960]删列造序 III","frequency":0.0,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","submitted":3808,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6776085650683722,"acs":38354,"articleLive":2,"columnArticles":331,"formTitle":"[961]在长度 2N 的数组中找出重复 N 次的元素","frequency":0.0,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","submitted":56602,"title":"在长度 2N 的数组中找出重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.44676857878008175,"acs":14759,"articleLive":2,"columnArticles":149,"formTitle":"[962]最大宽度坡","frequency":1.114219448,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","submitted":33035,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5137476459510358,"acs":2728,"articleLive":2,"columnArticles":33,"formTitle":"[963]最小面积矩形 II","frequency":1.724369709,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","submitted":5310,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.4405594405594406,"acs":1575,"articleLive":2,"columnArticles":29,"formTitle":"[964]表示数字的最少运算符","frequency":0.0,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","submitted":3575,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6846059490953695,"acs":35720,"articleLive":2,"columnArticles":420,"formTitle":"[965]单值二叉树","frequency":1.3805429075,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","submitted":52176,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.41047276337014516,"acs":3308,"articleLive":2,"columnArticles":54,"formTitle":"[966]元音拼写检查器","frequency":0.0,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","submitted":8059,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.47187661257955393,"acs":8230,"articleLive":2,"columnArticles":167,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","submitted":17441,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.5028705967581273,"acs":27766,"articleLive":2,"columnArticles":357,"formTitle":"[968]监控二叉树","frequency":1.3496762595,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"ac","submitted":55215,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6478681643281899,"acs":16669,"articleLive":2,"columnArticles":208,"formTitle":"[969]煎饼排序","frequency":0.0,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","submitted":25729,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.41256232736664633,"acs":11501,"articleLive":2,"columnArticles":130,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","submitted":27877,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.4446738734361715,"acs":7322,"articleLive":2,"columnArticles":113,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":0.0,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","submitted":16466,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.40590619571511294,"acs":1402,"articleLive":2,"columnArticles":32,"formTitle":"[972]相等的有理数","frequency":0.7030490946,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","submitted":3454,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.643098977092638,"acs":71420,"articleLive":2,"columnArticles":662,"formTitle":"[973]最接近原点的 K 个点","frequency":1.3496762595,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"ac","submitted":111056,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.46660483463845875,"acs":39744,"articleLive":2,"columnArticles":401,"formTitle":"[974]和可被 K 整除的子数组","frequency":2.1761588888,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","submitted":85177,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.4524130493394446,"acs":3356,"articleLive":2,"columnArticles":52,"formTitle":"[975]奇偶跳","frequency":0.5001312072,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","submitted":7418,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.597952057582314,"acs":55826,"articleLive":2,"columnArticles":522,"formTitle":"[976]三角形的最大周长","frequency":1.5839018723,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"ac","submitted":93362,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7017069746665816,"acs":219929,"articleLive":2,"columnArticles":1639,"formTitle":"[977]有序数组的平方","frequency":3.1277449223,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"ac","submitted":313420,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.4732195283391517,"acs":44326,"articleLive":2,"columnArticles":607,"formTitle":"[978]最长湍流子数组","frequency":0.4716067405,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","submitted":93669,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7149381841089849,"acs":9079,"articleLive":2,"columnArticles":142,"formTitle":"[979]在二叉树中分配硬币","frequency":1.3805429075,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","submitted":12699,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7351019025027835,"acs":15185,"articleLive":2,"columnArticles":229,"formTitle":"[980]不同路径 III","frequency":2.2720093059,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","submitted":20657,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5306156525057845,"acs":22245,"articleLive":2,"columnArticles":322,"formTitle":"[981]基于时间的键值存储","frequency":2.5903413307,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"ac","submitted":41923,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5508236239453596,"acs":2742,"articleLive":2,"columnArticles":32,"formTitle":"[982]按位与为零的三元组","frequency":0.5001312072,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","submitted":4978,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6336388547670793,"acs":33529,"articleLive":2,"columnArticles":463,"formTitle":"[983]最低票价","frequency":1.4125900849,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","submitted":52915,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.4201964395334561,"acs":9583,"articleLive":2,"columnArticles":155,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":1.6143688138,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","submitted":22806,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.6018277705533882,"acs":16661,"articleLive":2,"columnArticles":192,"formTitle":"[985]查询后的偶数和","frequency":0.5001312072,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","questionId":"1027","status":"","submitted":27684,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6828567072506697,"acs":31352,"articleLive":2,"columnArticles":293,"formTitle":"[986]区间列表的交集","frequency":1.7058163011,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"ac","submitted":45913,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5329942618675013,"acs":24522,"articleLive":2,"columnArticles":426,"formTitle":"[987]二叉树的垂序遍历","frequency":2.5805565168,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"ac","submitted":46008,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.5017119039348981,"acs":10111,"articleLive":2,"columnArticles":123,"formTitle":"[988]从叶结点开始的最小字符串","frequency":0.4442975611,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","submitted":20153,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.46950284526527414,"acs":55114,"articleLive":2,"columnArticles":623,"formTitle":"[989]数组形式的整数加法","frequency":0.988662914,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","submitted":117388,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.508169888126619,"acs":35703,"articleLive":2,"columnArticles":528,"formTitle":"[990]等式方程的可满足性","frequency":0.4442975611,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","submitted":70258,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5209063170979772,"acs":9219,"articleLive":2,"columnArticles":114,"formTitle":"[991]坏了的计算器","frequency":0.4442975611,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","submitted":17698,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.45575262327049865,"acs":24540,"articleLive":2,"columnArticles":279,"formTitle":"[992]K 个不同整数的子数组","frequency":1.0182071603,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","submitted":53845,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.557333025627039,"acs":53130,"articleLive":2,"columnArticles":836,"formTitle":"[993]二叉树的堂兄弟节点","frequency":1.3496762595,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"ac","submitted":95329,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5106569860673505,"acs":63371,"articleLive":2,"columnArticles":1509,"formTitle":"[994]腐烂的橘子","frequency":1.9650996448,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"ac","submitted":124097,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5340551276461755,"acs":22049,"articleLive":2,"columnArticles":255,"formTitle":"[995]K 连续位的最小翻转次数","frequency":0.5299663557,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","submitted":41286,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.4943796394485684,"acs":4662,"articleLive":2,"columnArticles":95,"formTitle":"[996]正方形数组的数目","frequency":0.0,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","submitted":9430,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5355188542572127,"acs":64688,"articleLive":2,"columnArticles":692,"formTitle":"[997]找到小镇的法官","frequency":1.1450646723,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","submitted":120795,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6184331093463653,"acs":8099,"articleLive":2,"columnArticles":121,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","submitted":13096,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6912908242612753,"acs":31115,"articleLive":2,"columnArticles":580,"formTitle":"[999]可以被一步捕获的棋子数","frequency":0.0,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","submitted":45010,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.4118457300275482,"acs":3887,"articleLive":2,"columnArticles":44,"formTitle":"[1000]合并石头的最低成本","frequency":1.5544706722,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","submitted":9438,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.29730083857442346,"acs":2269,"articleLive":2,"columnArticles":59,"formTitle":"[1001]网格照明","frequency":0.6284711262,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","submitted":7632,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7301345673750228,"acs":59955,"articleLive":2,"columnArticles":632,"formTitle":"[1002]查找共用字符","frequency":2.1436281392,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","submitted":82115,"title":"查找共用字符","titleSlug":"find-common-characters"},{"acceptance":0.579220306600555,"acs":12733,"articleLive":2,"columnArticles":193,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"ac","submitted":21983,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5956401045068582,"acs":72954,"articleLive":2,"columnArticles":762,"formTitle":"[1004]最大连续1的个数 III","frequency":2.5486512584,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"ac","submitted":122480,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5205962234868081,"acs":64404,"articleLive":2,"columnArticles":1021,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":0.8253985953,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","submitted":123712,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.6267648950149579,"acs":44835,"articleLive":2,"columnArticles":612,"formTitle":"[1006]笨阶乘","frequency":0.0,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"ac","submitted":71534,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.4666435024322446,"acs":6715,"articleLive":2,"columnArticles":89,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","submitted":14390,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7221117822463491,"acs":18889,"articleLive":2,"columnArticles":243,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":1.2911800528,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","submitted":26158,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5888409961685823,"acs":17213,"articleLive":2,"columnArticles":246,"formTitle":"[1009]十进制整数的反码","frequency":1.0182071603,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","submitted":29232,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.45587084844605646,"acs":19230,"articleLive":2,"columnArticles":257,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":0.4442975611,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","questionId":"1055","status":"","submitted":42183,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6254427562179425,"acs":64627,"articleLive":2,"columnArticles":616,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":1.6459420757,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"ac","submitted":103330,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.33949719509661336,"acs":3268,"articleLive":2,"columnArticles":68,"formTitle":"[1012]至少有 1 位重复的数字","frequency":1.2634159152,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","submitted":9626,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.39411013386794286,"acs":48753,"articleLive":2,"columnArticles":941,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":1.6786996721,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1062","status":"","submitted":123704,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5571614962694602,"acs":43984,"articleLive":2,"columnArticles":505,"formTitle":"[1014]最佳观光组合","frequency":0.9327824556,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","submitted":78943,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.3597623437820119,"acs":5268,"articleLive":2,"columnArticles":44,"formTitle":"[1015]可被 K 整除的最小整数","frequency":0.6284711262,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","submitted":14643,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5845211698870235,"acs":5536,"articleLive":2,"columnArticles":90,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.5001312072,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1065","status":"","submitted":9471,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.5622770511296076,"acs":3783,"articleLive":2,"columnArticles":58,"formTitle":"[1017]负二进制转换","frequency":0.5299663557,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","submitted":6728,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.5156503247313063,"acs":44859,"articleLive":2,"columnArticles":385,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","submitted":86995,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.6002934337282693,"acs":21685,"articleLive":2,"columnArticles":290,"formTitle":"[1019]链表中的下一个更大节点","frequency":0.5001312072,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"ac","submitted":36124,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5522648953703241,"acs":11058,"articleLive":2,"columnArticles":170,"formTitle":"[1020]飞地的数量","frequency":0.9327824556,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","submitted":20023,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7831864779586012,"acs":59819,"articleLive":2,"columnArticles":678,"formTitle":"[1021]删除最外层的括号","frequency":0.0,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"ac","submitted":76379,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7081226716338478,"acs":21289,"articleLive":2,"columnArticles":284,"formTitle":"[1022]从根到叶的二进制数之和","frequency":0.4442975611,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","submitted":30064,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5677017712888164,"acs":7660,"articleLive":2,"columnArticles":177,"formTitle":"[1023]驼峰式匹配","frequency":0.0,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","submitted":13493,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5555679022144615,"acs":34998,"articleLive":2,"columnArticles":399,"formTitle":"[1024]视频拼接","frequency":0.0,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","submitted":62995,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7089619261019839,"acs":78151,"articleLive":2,"columnArticles":666,"formTitle":"[1025]除数博弈","frequency":0.988662914,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","submitted":110233,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6766365688487584,"acs":10791,"articleLive":2,"columnArticles":187,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","submitted":15948,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.434807375206116,"acs":14503,"articleLive":2,"columnArticles":133,"formTitle":"[1027]最长等差数列","frequency":1.6459420757,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"ac","submitted":33355,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7320901482793346,"acs":21082,"articleLive":2,"columnArticles":441,"formTitle":"[1028]从先序遍历还原二叉树","frequency":1.6786996721,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","submitted":28797,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6605263157894737,"acs":17821,"articleLive":2,"columnArticles":195,"formTitle":"[1029]两地调度","frequency":0.3929911054,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"ac","submitted":26980,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7097017096503688,"acs":41470,"articleLive":2,"columnArticles":456,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":0.4716067405,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","submitted":58433,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5737179487179487,"acs":5370,"articleLive":2,"columnArticles":88,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","submitted":9360,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.41126400907930205,"acs":2899,"articleLive":2,"columnArticles":47,"formTitle":"[1032]字符流","frequency":1.0808941382,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","submitted":7049,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.39370378049623334,"acs":11393,"articleLive":2,"columnArticles":172,"formTitle":"[1033]移动石子直到连续","frequency":0.5001312072,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","questionId":"1103","status":"","submitted":28938,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.5606469002695418,"acs":28496,"articleLive":2,"columnArticles":460,"formTitle":"[1034]边界着色","frequency":1.2105634571,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","submitted":50827,"title":"边界着色","titleSlug":"coloring-a-border"},{"acceptance":0.6405313408053134,"acs":38576,"articleLive":2,"columnArticles":413,"formTitle":"[1035]不相交的线","frequency":0.4442975611,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"ac","submitted":60225,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.30213270142180093,"acs":3570,"articleLive":2,"columnArticles":60,"formTitle":"[1036]逃离大迷宫","frequency":1.1853732082,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","submitted":11816,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.4394200462281992,"acs":10456,"articleLive":2,"columnArticles":135,"formTitle":"[1037]有效的回旋镖","frequency":1.4125900849,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","submitted":23795,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.795935914705798,"acs":27771,"articleLive":2,"columnArticles":346,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":0.9327824556,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","submitted":34891,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5586805555555555,"acs":4827,"articleLive":2,"columnArticles":65,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","submitted":8640,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.5229788032264115,"acs":2788,"articleLive":2,"columnArticles":32,"formTitle":"[1040]移动石子直到连续 II","frequency":0.6284711262,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","submitted":5331,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.487739291888085,"acs":7618,"articleLive":2,"columnArticles":125,"formTitle":"[1041]困于环中的机器人","frequency":1.4459042916,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","submitted":15619,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5348816979819068,"acs":12298,"articleLive":2,"columnArticles":160,"formTitle":"[1042]不邻接植花","frequency":0.4716067405,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","submitted":22992,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.692809364548495,"acs":8286,"articleLive":2,"columnArticles":104,"formTitle":"[1043]分隔数组以得到最大和","frequency":1.4459042916,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","submitted":11960,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.3472677457852184,"acs":20660,"articleLive":2,"columnArticles":185,"formTitle":"[1044]最长重复子串","frequency":2.4132640318,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"ac","submitted":59493,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6411616676868667,"acs":9427,"articleLive":2,"columnArticles":117,"formTitle":"[1045]买下所有产品的客户","frequency":0.4442975611,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"","submitted":14703,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6591175172254956,"acs":68684,"articleLive":2,"columnArticles":958,"formTitle":"[1046]最后一块石头的重量","frequency":0.988662914,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","submitted":104206,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.7244828818173978,"acs":117614,"articleLive":2,"columnArticles":1040,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":2.5724789284,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"ac","submitted":162342,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.46470637373652995,"acs":11126,"articleLive":2,"columnArticles":158,"formTitle":"[1048]最长字符串链","frequency":2.6477779086,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","submitted":23942,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6519619757487375,"acs":48283,"articleLive":2,"columnArticles":445,"formTitle":"[1049]最后一块石头的重量 II","frequency":0.9602114928,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"ac","submitted":74058,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7607189776663084,"acs":12739,"articleLive":2,"columnArticles":60,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":1.3496762595,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1136","status":"","submitted":16746,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7563148346280877,"acs":32517,"articleLive":2,"columnArticles":385,"formTitle":"[1051]高度检查器","frequency":0.9602114928,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","submitted":42994,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5801592175857794,"acs":50066,"articleLive":2,"columnArticles":775,"formTitle":"[1052]爱生气的书店老板","frequency":1.0808941382,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","submitted":86297,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.4600667408231368,"acs":6204,"articleLive":2,"columnArticles":98,"formTitle":"[1053]交换一次的先前排列","frequency":0.0,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","submitted":13485,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.38204414931801867,"acs":8515,"articleLive":2,"columnArticles":113,"formTitle":"[1054]距离相等的条形码","frequency":0.4442975611,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","submitted":22288,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5952618177792538,"acs":5377,"articleLive":2,"columnArticles":100,"formTitle":"[1055]形成字符串的最短路径","frequency":1.0489221055,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"","submitted":9033,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.4173347275473452,"acs":3592,"articleLive":2,"columnArticles":70,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"","submitted":8607,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.47214464206967516,"acs":3212,"articleLive":2,"columnArticles":42,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"","submitted":6803,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.34585365853658534,"acs":1418,"articleLive":2,"columnArticles":37,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"","submitted":4100,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.36595114729829753,"acs":2472,"articleLive":2,"columnArticles":40,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"511","status":"","submitted":6755,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.529491263635486,"acs":5485,"articleLive":2,"columnArticles":80,"formTitle":"[1060]有序数组中的缺失元素","frequency":0.0,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"","submitted":10359,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.6060293206690068,"acs":2935,"articleLive":2,"columnArticles":65,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"","submitted":4843,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.5478653650007286,"acs":3760,"articleLive":2,"columnArticles":53,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"","submitted":6863,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.7091167080525009,"acs":1999,"articleLive":2,"columnArticles":43,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"","submitted":2819,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6467807869187532,"acs":5063,"articleLive":2,"columnArticles":72,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"","submitted":7828,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5442697558957386,"acs":2631,"articleLive":2,"columnArticles":73,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"","submitted":4834,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.4781202845440828,"acs":2218,"articleLive":2,"columnArticles":43,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"","submitted":4639,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.41821649976156416,"acs":877,"articleLive":2,"columnArticles":26,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"","submitted":2097,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.8673252924419662,"acs":14310,"articleLive":2,"columnArticles":69,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"","submitted":16499,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8184021000201925,"acs":12159,"articleLive":2,"columnArticles":60,"formTitle":"[1069]产品销售分析 II","frequency":0.0,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"","submitted":14857,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.47943920075067614,"acs":8686,"articleLive":2,"columnArticles":76,"formTitle":"[1070]产品销售分析 III","frequency":0.0,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"","submitted":18117,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5876000529205531,"acs":35531,"articleLive":2,"columnArticles":683,"formTitle":"[1071]字符串的最大公因子","frequency":0.988662914,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"ac","submitted":60468,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5895595432300164,"acs":3614,"articleLive":2,"columnArticles":61,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":0.0,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1147","status":"","submitted":6130,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.34203689269940246,"acs":2633,"articleLive":2,"columnArticles":56,"formTitle":"[1073]负二进制数相加","frequency":0.0,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","submitted":7698,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6687402799377916,"acs":18920,"articleLive":2,"columnArticles":195,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":0.0,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"ac","submitted":28292,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6946084218811491,"acs":10590,"articleLive":2,"columnArticles":78,"formTitle":"[1075]项目员工 I","frequency":0.4442975611,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"","submitted":15246,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.4940225188018954,"acs":11364,"articleLive":2,"columnArticles":94,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"","submitted":23003,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7230218965366833,"acs":8288,"articleLive":2,"columnArticles":91,"formTitle":"[1077]项目员工 III","frequency":0.4716067405,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"","submitted":11463,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.6574875856691427,"acs":32042,"articleLive":2,"columnArticles":443,"formTitle":"[1078]Bigram 分词","frequency":0.3088049655,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","submitted":48734,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.735391866578041,"acs":12170,"articleLive":2,"columnArticles":204,"formTitle":"[1079]活字印刷","frequency":0.4442975611,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","submitted":16549,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.49634107540566336,"acs":4680,"articleLive":2,"columnArticles":102,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","submitted":9429,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.5722793335696561,"acs":16144,"articleLive":2,"columnArticles":164,"formTitle":"[1081]不同字符的最小子序列","frequency":1.6143688138,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"ac","submitted":28210,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7605693263373741,"acs":12611,"articleLive":2,"columnArticles":99,"formTitle":"[1082]销售分析 I ","frequency":1.0808941382,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"","submitted":16581,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.5284545576467432,"acs":11821,"articleLive":2,"columnArticles":110,"formTitle":"[1083]销售分析 II","frequency":1.0489221055,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"","submitted":22369,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5358326233077724,"acs":11320,"articleLive":2,"columnArticles":105,"formTitle":"[1084]销售分析III","frequency":0.4716067405,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"","submitted":21126,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.7721724979658259,"acs":3796,"articleLive":2,"columnArticles":76,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"","submitted":4916,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.685743484925907,"acs":5368,"articleLive":2,"columnArticles":86,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"","submitted":7828,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.5388228792484112,"acs":1950,"articleLive":2,"columnArticles":56,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"","submitted":3619,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.4571778140293638,"acs":1121,"articleLive":2,"columnArticles":36,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"","submitted":2452,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.5839105704792477,"acs":20737,"articleLive":2,"columnArticles":308,"formTitle":"[1089]复写零","frequency":0.0,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","submitted":35514,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5523809523809524,"acs":4176,"articleLive":2,"columnArticles":87,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","submitted":7560,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.38047282419747364,"acs":32831,"articleLive":2,"columnArticles":330,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":2.42529903,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"ac","submitted":86290,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.4951190272306902,"acs":2891,"articleLive":2,"columnArticles":57,"formTitle":"[1092]最短公共超序列","frequency":1.8234606116,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","submitted":5839,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.37107095802747975,"acs":3943,"articleLive":2,"columnArticles":63,"formTitle":"[1093]大样本统计","frequency":0.0,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","submitted":10626,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.5905380023431834,"acs":31755,"articleLive":2,"columnArticles":442,"formTitle":"[1094]拼车","frequency":2.2098775248,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","submitted":53773,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.3723343146406261,"acs":20742,"articleLive":2,"columnArticles":398,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","submitted":55708,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5503231763619575,"acs":1788,"articleLive":2,"columnArticles":49,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","submitted":3249,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.5222696309604012,"acs":6977,"articleLive":2,"columnArticles":123,"formTitle":"[1097]游戏玩法分析 V","frequency":1.9963034245,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"","submitted":13359,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.4749693323208131,"acs":8131,"articleLive":2,"columnArticles":108,"formTitle":"[1098]小众书籍","frequency":0.5299663557,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"","submitted":17119,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5866536033093839,"acs":5389,"articleLive":2,"columnArticles":99,"formTitle":"[1099]小于 K 的两数之和","frequency":0.4716067405,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"","submitted":9186,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.6995007914282235,"acs":5745,"articleLive":2,"columnArticles":116,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":1.0489221055,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1084","status":"","submitted":8213,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6745929180666839,"acs":2610,"articleLive":2,"columnArticles":64,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1085","status":"","submitted":3869,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.37503222480020626,"acs":5819,"articleLive":2,"columnArticles":70,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"","submitted":15516,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6373250442815962,"acs":36701,"articleLive":2,"columnArticles":1120,"formTitle":"[1103]分糖果 II","frequency":1.3805429075,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","submitted":57586,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.7605824232969319,"acs":29252,"articleLive":2,"columnArticles":687,"formTitle":"[1104]二叉树寻路","frequency":2.2404235771,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"ac","submitted":38460,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5625129372800662,"acs":5435,"articleLive":2,"columnArticles":71,"formTitle":"[1105]填充书架","frequency":1.1853732082,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","submitted":9662,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.5818558302057719,"acs":4496,"articleLive":2,"columnArticles":131,"formTitle":"[1106]解析布尔表达式","frequency":0.7864655007,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","submitted":7727,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.4126296154057168,"acs":7521,"articleLive":2,"columnArticles":99,"formTitle":"[1107]每日新用户统计","frequency":1.0808941382,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"","submitted":18227,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.8389497771889678,"acs":69658,"articleLive":2,"columnArticles":707,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","submitted":83030,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.5843044060705045,"acs":63681,"articleLive":2,"columnArticles":626,"formTitle":"[1109]航班预订统计","frequency":2.4878976863,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"ac","submitted":108986,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.630905211825663,"acs":12420,"articleLive":2,"columnArticles":225,"formTitle":"[1110]删点成林","frequency":0.988662914,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","submitted":19686,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7716278193126845,"acs":24564,"articleLive":2,"columnArticles":406,"formTitle":"[1111]有效括号的嵌套深度","frequency":1.1490055641,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"","submitted":31834,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.645968992248062,"acs":8333,"articleLive":2,"columnArticles":96,"formTitle":"[1112]每位学生的最高成绩","frequency":0.0,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"","submitted":12900,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5401967673928321,"acs":7687,"articleLive":2,"columnArticles":53,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"","submitted":14230,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.653178638022535,"acs":81970,"articleLive":2,"columnArticles":602,"formTitle":"[1114]按序打印","frequency":3.2279989767,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","submitted":125494,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5616347813314728,"acs":45885,"articleLive":2,"columnArticles":494,"formTitle":"[1115]交替打印 FooBar","frequency":0.9602114928,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","submitted":81699,"title":"交替打印 FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.521069587628866,"acs":24261,"articleLive":2,"columnArticles":383,"formTitle":"[1116]打印零与奇偶数","frequency":2.4526082093,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","submitted":46560,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.5236214880259084,"acs":18432,"articleLive":2,"columnArticles":261,"formTitle":"[1117]H2O 生成","frequency":1.8554735886,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","submitted":35201,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.6352295409181636,"acs":2546,"articleLive":2,"columnArticles":42,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"","submitted":4008,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8655681704008842,"acs":8615,"articleLive":2,"columnArticles":152,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"","submitted":9953,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.6161703977396218,"acs":2835,"articleLive":2,"columnArticles":52,"formTitle":"[1120]子树的最大平均值","frequency":0.0,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"","submitted":4601,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5712151394422311,"acs":1147,"articleLive":2,"columnArticles":20,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"","submitted":2008,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.7068963721395315,"acs":67867,"articleLive":2,"columnArticles":902,"formTitle":"[1122]数组的相对排序","frequency":1.9349344781,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","submitted":96007,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7049180327868853,"acs":8858,"articleLive":2,"columnArticles":115,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.4181180555,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","submitted":12566,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.32195451579830364,"acs":13817,"articleLive":2,"columnArticles":149,"formTitle":"[1124]表现良好的最长时间段","frequency":0.5001312072,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"ac","submitted":42916,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.49395747284687164,"acs":3229,"articleLive":2,"columnArticles":52,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","submitted":6537,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6905175053587833,"acs":6765,"articleLive":2,"columnArticles":99,"formTitle":"[1126]查询活跃业务","frequency":0.4181180555,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"","submitted":9797,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.4246666036129764,"acs":4490,"articleLive":2,"columnArticles":78,"formTitle":"[1127]用户购买平台","frequency":1.0808941382,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"","submitted":10573,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.5445796935414579,"acs":38028,"articleLive":2,"columnArticles":488,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":1.0182071603,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","submitted":69830,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.38467317806160783,"acs":6656,"articleLive":2,"columnArticles":124,"formTitle":"[1129]颜色交替的最短路径","frequency":0.5299663557,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","submitted":17303,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6323543953327401,"acs":6395,"articleLive":2,"columnArticles":114,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.4442975611,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"ac","submitted":10113,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.45805369127516776,"acs":3276,"articleLive":2,"columnArticles":49,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","submitted":7152,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.39162652834383105,"acs":5285,"articleLive":2,"columnArticles":56,"formTitle":"[1132]报告的记录 II","frequency":0.5612188992,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"","submitted":13495,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6442268461852305,"acs":3158,"articleLive":2,"columnArticles":68,"formTitle":"[1133]最大唯一数","frequency":0.594008722,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"","submitted":4902,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7724121996303143,"acs":3343,"articleLive":2,"columnArticles":56,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"","submitted":4328,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.5420496847223277,"acs":7135,"articleLive":2,"columnArticles":80,"formTitle":"[1135]最低成本联通所有城市","frequency":0.4716067405,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"","submitted":13163,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5748449955713021,"acs":3245,"articleLive":2,"columnArticles":56,"formTitle":"[1136]平行课程","frequency":0.5001312072,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"","submitted":5645,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.6093577158172199,"acs":96401,"articleLive":2,"columnArticles":987,"formTitle":"[1137]第 N 个泰波那契数","frequency":2.2849502823,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"ac","submitted":158201,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.4356941271334498,"acs":6484,"articleLive":2,"columnArticles":144,"formTitle":"[1138]字母板上的路径","frequency":0.0,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","submitted":14882,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.4816158684083212,"acs":9955,"articleLive":2,"columnArticles":158,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":1.6786996721,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","submitted":20670,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6515906824979607,"acs":7189,"articleLive":2,"columnArticles":99,"formTitle":"[1140]石子游戏 II","frequency":1.0182071603,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","submitted":11033,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.508329455560726,"acs":10924,"articleLive":2,"columnArticles":70,"formTitle":"[1141]查询近30天活跃用户数","frequency":1.0182071603,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1245","status":"","submitted":21490,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.3718298868513461,"acs":7624,"articleLive":2,"columnArticles":52,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1246","status":"","submitted":20504,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6386243660972359,"acs":184489,"articleLive":2,"columnArticles":1220,"formTitle":"[1143]最长公共子序列","frequency":3.3228098672,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"ac","submitted":288885,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.4432216108054027,"acs":10632,"articleLive":2,"columnArticles":148,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":0.5299663557,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"notac","submitted":23988,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.4700596794742842,"acs":7010,"articleLive":2,"columnArticles":110,"formTitle":"[1145]二叉树着色游戏","frequency":0.0,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","submitted":14913,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.2910619744627842,"acs":4673,"articleLive":2,"columnArticles":67,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","submitted":16055,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5628325310362301,"acs":4443,"articleLive":2,"columnArticles":91,"formTitle":"[1147]段式回文","frequency":2.1330348198,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","submitted":7894,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7122374124708236,"acs":8544,"articleLive":2,"columnArticles":38,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"","submitted":11996,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.44245619245619244,"acs":5959,"articleLive":2,"columnArticles":50,"formTitle":"[1149]文章浏览 II","frequency":0.4442975611,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"","submitted":13468,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.6003055588200729,"acs":5108,"articleLive":2,"columnArticles":90,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":0.5001312072,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1102","status":"","submitted":8509,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.49748592115848755,"acs":4947,"articleLive":2,"columnArticles":75,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":0.4442975611,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"","submitted":9944,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.3921019108280255,"acs":1539,"articleLive":2,"columnArticles":37,"formTitle":"[1152]用户网站访问行为分析","frequency":0.594008722,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"","submitted":3925,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.37001259974800504,"acs":1762,"articleLive":2,"columnArticles":24,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"","submitted":4762,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.6488834284888343,"acs":44893,"articleLive":2,"columnArticles":531,"formTitle":"[1154]一年中的第几天","frequency":1.3154263365,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","submitted":69185,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.4806042188058634,"acs":10754,"articleLive":2,"columnArticles":136,"formTitle":"[1155]掷骰子的N种方法","frequency":1.5167303442,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","submitted":22376,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.42953235105701476,"acs":5364,"articleLive":2,"columnArticles":98,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.4442975611,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","submitted":12488,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.32275449101796405,"acs":3234,"articleLive":2,"columnArticles":49,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":0.0,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","submitted":10020,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5524856857220758,"acs":6079,"articleLive":2,"columnArticles":64,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"","submitted":11003,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.4943305463291719,"acs":4316,"articleLive":2,"columnArticles":89,"formTitle":"[1159]市场分析 II","frequency":1.0489221055,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"","submitted":8731,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6871321757261202,"acs":61297,"articleLive":2,"columnArticles":930,"formTitle":"[1160]拼写单词","frequency":1.6143688138,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1112","status":"","submitted":89207,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6325016857720837,"acs":11256,"articleLive":2,"columnArticles":185,"formTitle":"[1161]最大层内元素和","frequency":1.0182071603,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","submitted":17796,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.4711126329834339,"acs":39899,"articleLive":2,"columnArticles":506,"formTitle":"[1162]地图分析","frequency":0.4181180555,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","submitted":84691,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.2677900194426442,"acs":6198,"articleLive":2,"columnArticles":106,"formTitle":"[1163]按字典序排在最后的子串","frequency":0.0,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","submitted":23145,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6105585309869931,"acs":6384,"articleLive":2,"columnArticles":92,"formTitle":"[1164]指定日期的产品价格","frequency":1.4125900849,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"","submitted":10456,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8354753053637812,"acs":7866,"articleLive":2,"columnArticles":120,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"","submitted":9415,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.4764797507788162,"acs":3059,"articleLive":2,"columnArticles":55,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"","submitted":6420,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.4487467588591184,"acs":2596,"articleLive":2,"columnArticles":40,"formTitle":"[1167]连接棒材的最低费用","frequency":0.5612188992,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"","submitted":5785,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5688583578671901,"acs":1739,"articleLive":2,"columnArticles":32,"formTitle":"[1168]水资源分配优化","frequency":0.988662914,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"","submitted":3057,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.3227564102564103,"acs":7049,"articleLive":2,"columnArticles":83,"formTitle":"[1169]查询无效交易","frequency":0.4442975611,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","submitted":21840,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6163563248535712,"acs":14101,"articleLive":2,"columnArticles":224,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":0.4716067405,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","questionId":"1273","status":"","submitted":22878,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.4768291841941935,"acs":13829,"articleLive":2,"columnArticles":166,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":2.062116643,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"ac","submitted":29002,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.26308952837729815,"acs":2633,"articleLive":2,"columnArticles":59,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","submitted":10008,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.7544007411774615,"acs":8957,"articleLive":2,"columnArticles":81,"formTitle":"[1173]即时食物配送 I","frequency":0.4442975611,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"","submitted":11873,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.6224290474549006,"acs":5417,"articleLive":2,"columnArticles":68,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"","submitted":8703,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.49131976852716075,"acs":7896,"articleLive":2,"columnArticles":123,"formTitle":"[1175]质数排列","frequency":1.0182071603,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","submitted":16071,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.4546268656716418,"acs":4569,"articleLive":2,"columnArticles":70,"formTitle":"[1176]健身计划评估","frequency":0.0,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"","submitted":10050,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.26959774704720274,"acs":6414,"articleLive":2,"columnArticles":98,"formTitle":"[1177]构建回文串检测","frequency":1.1490055641,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","submitted":23791,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.46264374862074886,"acs":18868,"articleLive":2,"columnArticles":186,"formTitle":"[1178]猜字谜","frequency":0.0,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","submitted":40783,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.63713792441972,"acs":33214,"articleLive":2,"columnArticles":199,"formTitle":"[1179]重新格式化部门表","frequency":2.4878976863,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","submitted":52130,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7743310442813166,"acs":3270,"articleLive":2,"columnArticles":76,"formTitle":"[1180]统计只含单一字母的子串","frequency":0.0,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1131","status":"","submitted":4223,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.3731234866828087,"acs":1541,"articleLive":2,"columnArticles":30,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"","submitted":4130,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.42045821232655695,"acs":2606,"articleLive":2,"columnArticles":46,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"","submitted":6198,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.5892080069625761,"acs":677,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"","submitted":1149,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5837294861725435,"acs":14121,"articleLive":2,"columnArticles":276,"formTitle":"[1184]公交站间的距离","frequency":0.4442975611,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","submitted":24191,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6005769606884412,"acs":12283,"articleLive":2,"columnArticles":221,"formTitle":"[1185]一周中的第几天","frequency":0.3929911054,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","submitted":20452,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.39798121829960326,"acs":7925,"articleLive":2,"columnArticles":116,"formTitle":"[1186]删除一次得到子数组最大和","frequency":1.0489221055,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","submitted":19913,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.44441964285714286,"acs":1991,"articleLive":2,"columnArticles":35,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","submitted":4480,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.6981719175418125,"acs":3590,"articleLive":2,"columnArticles":68,"formTitle":"[1188]设计有限阻塞队列","frequency":1.3496762595,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"","submitted":5142,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6457430612483898,"acs":22056,"articleLive":2,"columnArticles":346,"formTitle":"[1189]“气球” 的最大数量","frequency":1.0182071603,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","submitted":34156,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6506395073424918,"acs":46699,"articleLive":2,"columnArticles":628,"formTitle":"[1190]反转每对括号间的子串","frequency":2.0968906614,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"ac","submitted":71774,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.2665011557229689,"acs":6226,"articleLive":2,"columnArticles":96,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","submitted":23362,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.5031493541155119,"acs":4713,"articleLive":2,"columnArticles":54,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","submitted":9367,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.6051292090837901,"acs":6182,"articleLive":2,"columnArticles":76,"formTitle":"[1193]每月交易 I","frequency":0.5299663557,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"","submitted":10216,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5126367899947889,"acs":3935,"articleLive":2,"columnArticles":67,"formTitle":"[1194]锦标赛优胜者","frequency":0.4181180555,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"","submitted":7676,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6379872917739997,"acs":14860,"articleLive":2,"columnArticles":284,"formTitle":"[1195]交替打印字符串","frequency":1.9963034245,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","submitted":23292,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6873270614277809,"acs":3726,"articleLive":2,"columnArticles":62,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.5612188992,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"","submitted":5421,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.3751161294933181,"acs":5249,"articleLive":2,"columnArticles":63,"formTitle":"[1197]进击的骑士","frequency":0.4716067405,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"","submitted":13993,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7397830018083182,"acs":4091,"articleLive":2,"columnArticles":63,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"","submitted":5530,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.43855693348365277,"acs":778,"articleLive":2,"columnArticles":20,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"","submitted":1774,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6844675884359849,"acs":19059,"articleLive":2,"columnArticles":270,"formTitle":"[1200]最小绝对差","frequency":1.3496762595,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","submitted":27845,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.249450337512054,"acs":6467,"articleLive":2,"columnArticles":90,"formTitle":"[1201]丑数 III","frequency":1.9231446693,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","submitted":25925,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.5033446649851957,"acs":27540,"articleLive":2,"columnArticles":303,"formTitle":"[1202]交换字符串中的元素","frequency":0.5299663557,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","submitted":54714,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.618052423194507,"acs":12332,"articleLive":2,"columnArticles":146,"formTitle":"[1203]项目管理","frequency":0.0,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","submitted":19953,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7313184198000952,"acs":6146,"articleLive":2,"columnArticles":85,"formTitle":"[1204]最后一个能进入电梯的人","frequency":0.0,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1327","status":"","submitted":8404,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.46814116895560526,"acs":5863,"articleLive":2,"columnArticles":88,"formTitle":"[1205]每月交易II","frequency":0.0,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"","submitted":12524,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.614416917496334,"acs":7961,"articleLive":2,"columnArticles":99,"formTitle":"[1206]设计跳表","frequency":0.0,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","submitted":12957,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7297435288530041,"acs":61459,"articleLive":2,"columnArticles":860,"formTitle":"[1207]独一无二的出现次数","frequency":1.6143688138,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","submitted":84220,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.497011902997975,"acs":50315,"articleLive":2,"columnArticles":633,"formTitle":"[1208]尽可能使字符串相等","frequency":0.0,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","submitted":101235,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5237621793597137,"acs":13170,"articleLive":2,"columnArticles":166,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":0.5299663557,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"ac","submitted":25145,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.45328096874488627,"acs":2770,"articleLive":2,"columnArticles":57,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":0.743540456,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","submitted":6111,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6595315024232633,"acs":8165,"articleLive":2,"columnArticles":65,"formTitle":"[1211]查询结果的质量和占比","frequency":0.4442975611,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"","submitted":12380,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5146585791747083,"acs":5600,"articleLive":2,"columnArticles":106,"formTitle":"[1212]查询球队积分","frequency":0.4716067405,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"","submitted":10881,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7764082336990016,"acs":6299,"articleLive":2,"columnArticles":136,"formTitle":"[1213]三个有序数组的交集","frequency":0.5001312072,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"","submitted":8113,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.639028620988725,"acs":3684,"articleLive":2,"columnArticles":75,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":0.5612188992,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"","submitted":5765,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.41294642857142855,"acs":2035,"articleLive":2,"columnArticles":43,"formTitle":"[1215]步进数","frequency":0.0,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"","submitted":4928,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5400857802705378,"acs":1637,"articleLive":2,"columnArticles":39,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"","submitted":3031,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6954229571052001,"acs":23216,"articleLive":2,"columnArticles":371,"formTitle":"[1217]玩筹码","frequency":0.988662914,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1329","status":"ac","submitted":33384,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.5147358075277897,"acs":37184,"articleLive":2,"columnArticles":359,"formTitle":"[1218]最长定差子序列","frequency":2.8160133283,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"ac","submitted":72239,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6294243485025282,"acs":12946,"articleLive":2,"columnArticles":185,"formTitle":"[1219]黄金矿工","frequency":1.3496762595,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","submitted":20568,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5307633392902732,"acs":4158,"articleLive":2,"columnArticles":79,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","submitted":7834,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.8438683990838453,"acs":78846,"articleLive":2,"columnArticles":1138,"formTitle":"[1221]分割平衡字符串","frequency":2.4878976863,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"ac","submitted":93434,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6758277429127895,"acs":6246,"articleLive":2,"columnArticles":136,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.5612188992,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","submitted":9242,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.47503045066991473,"acs":3510,"articleLive":2,"columnArticles":60,"formTitle":"[1223]掷骰子模拟","frequency":0.743540456,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","questionId":"1343","status":"","submitted":7389,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.3261696589468064,"acs":4887,"articleLive":2,"columnArticles":71,"formTitle":"[1224]最大相等频率","frequency":1.3496762595,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","submitted":14983,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5395558136159094,"acs":3717,"articleLive":2,"columnArticles":86,"formTitle":"[1225]报告系统状态的连续日期","frequency":1.0182071603,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"","submitted":6889,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.5938412279875694,"acs":12612,"articleLive":2,"columnArticles":140,"formTitle":"[1226]哲学家进餐","frequency":2.1761588888,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","submitted":21238,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.664522977022977,"acs":10643,"articleLive":2,"columnArticles":167,"formTitle":"[1227]飞机座位分配概率","frequency":1.3805429075,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","submitted":16016,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5375751503006012,"acs":3219,"articleLive":2,"columnArticles":57,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"","submitted":5988,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.43491250533504056,"acs":3057,"articleLive":2,"columnArticles":57,"formTitle":"[1229]安排会议日程","frequency":0.4442975611,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"","submitted":7029,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.5027746947835738,"acs":3624,"articleLive":2,"columnArticles":71,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"","submitted":7208,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.5702748874048765,"acs":3672,"articleLive":2,"columnArticles":50,"formTitle":"[1231]分享巧克力","frequency":0.5001312072,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"","submitted":6439,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.4687444877135375,"acs":34546,"articleLive":2,"columnArticles":428,"formTitle":"[1232]缀点成线","frequency":0.4716067405,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","submitted":73699,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.48679181654676257,"acs":8661,"articleLive":2,"columnArticles":127,"formTitle":"[1233]删除子文件夹","frequency":0.0,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","submitted":17792,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.3471051616812648,"acs":6301,"articleLive":2,"columnArticles":97,"formTitle":"[1234]替换子串得到平衡字符串","frequency":1.6786996721,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","submitted":18153,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.46773772204806685,"acs":7162,"articleLive":2,"columnArticles":124,"formTitle":"[1235]规划兼职工作","frequency":1.8636589498,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","submitted":15312,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.5711050724637681,"acs":1261,"articleLive":2,"columnArticles":33,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"","submitted":2208,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.7120704966186215,"acs":10424,"articleLive":2,"columnArticles":139,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","questionId":"1358","status":"","submitted":14639,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.6623845845042152,"acs":3300,"articleLive":2,"columnArticles":78,"formTitle":"[1238]循环码排列","frequency":0.6284711262,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","submitted":4982,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.49144207258441164,"acs":35776,"articleLive":2,"columnArticles":392,"formTitle":"[1239]串联字符串的最大长度","frequency":0.0,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","questionId":"1360","status":"","submitted":72798,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.49633699633699635,"acs":2710,"articleLive":2,"columnArticles":41,"formTitle":"[1240]铺瓷砖","frequency":1.4459042916,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","submitted":5460,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5925988509631632,"acs":7014,"articleLive":2,"columnArticles":69,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"","submitted":11836,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.46941580756013745,"acs":1366,"articleLive":2,"columnArticles":21,"formTitle":"[1242]多线程网页爬虫","frequency":0.9327824556,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"","submitted":2910,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5381112650960206,"acs":2718,"articleLive":2,"columnArticles":62,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"","submitted":5051,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6257283729269386,"acs":2792,"articleLive":2,"columnArticles":46,"formTitle":"[1244]力扣排行榜","frequency":0.6284711262,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"","submitted":4462,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.512614063338701,"acs":3820,"articleLive":2,"columnArticles":69,"formTitle":"[1245]树的直径","frequency":0.5299663557,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"","submitted":7452,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.4822649912517894,"acs":3032,"articleLive":2,"columnArticles":44,"formTitle":"[1246]删除回文子数组","frequency":0.8807415775,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"","submitted":6287,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.6217572676313388,"acs":9539,"articleLive":2,"columnArticles":163,"formTitle":"[1247]交换字符使得字符串相同","frequency":0.0,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"ac","submitted":15342,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5628977368107803,"acs":36885,"articleLive":2,"columnArticles":497,"formTitle":"[1248]统计「优美子数组」","frequency":1.3805429075,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","submitted":65527,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5791580949852899,"acs":26182,"articleLive":2,"columnArticles":363,"formTitle":"[1249]移除无效的括号","frequency":1.0182071603,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"ac","submitted":45207,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5663324334747397,"acs":2937,"articleLive":2,"columnArticles":41,"formTitle":"[1250]检查「好数组」","frequency":0.5612188992,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","submitted":5186,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7712615166548548,"acs":8706,"articleLive":2,"columnArticles":101,"formTitle":"[1251]平均售价","frequency":0.0,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"","submitted":11288,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.7487666947419083,"acs":18669,"articleLive":2,"columnArticles":329,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","submitted":24933,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.39551652745056043,"acs":5540,"articleLive":2,"columnArticles":85,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":0.0,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","submitted":14007,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.6056063505563825,"acs":17089,"articleLive":2,"columnArticles":266,"formTitle":"[1254]统计封闭岛屿的数目","frequency":0.4181180555,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"ac","submitted":28218,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6879723601813863,"acs":3186,"articleLive":2,"columnArticles":70,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","submitted":4631,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6658415841584159,"acs":1614,"articleLive":2,"columnArticles":40,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"","submitted":2424,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.5645067133683596,"acs":1934,"articleLive":2,"columnArticles":44,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"","submitted":3426,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.5538784067085953,"acs":1321,"articleLive":2,"columnArticles":48,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"","submitted":2385,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.48310185185185184,"acs":2087,"articleLive":2,"columnArticles":45,"formTitle":"[1259]不相交的握手","frequency":0.0,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"","submitted":4320,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6034126627750337,"acs":13438,"articleLive":2,"columnArticles":266,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","submitted":22270,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.7303419545217844,"acs":8415,"articleLive":2,"columnArticles":114,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","submitted":11522,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5292918057100482,"acs":14275,"articleLive":2,"columnArticles":206,"formTitle":"[1262]可被三整除的最大和","frequency":1.4125900849,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","submitted":26970,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.425991922071751,"acs":3586,"articleLive":2,"columnArticles":66,"formTitle":"[1263]推箱子","frequency":1.2634159152,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","questionId":"1389","status":"","submitted":8418,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.5670376258611552,"acs":5350,"articleLive":2,"columnArticles":91,"formTitle":"[1264]页面推荐","frequency":0.0,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"","submitted":9435,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.9179954441913439,"acs":3224,"articleLive":2,"columnArticles":76,"formTitle":"[1265]逆序打印不可变链表","frequency":0.594008722,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"","submitted":3512,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8246347118132312,"acs":30589,"articleLive":2,"columnArticles":462,"formTitle":"[1266]访问所有点的最小时间","frequency":0.0,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","submitted":37094,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6091323638156273,"acs":9885,"articleLive":2,"columnArticles":155,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","submitted":16228,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.5876795906317654,"acs":8958,"articleLive":2,"columnArticles":152,"formTitle":"[1268]搜索推荐系统","frequency":1.0182071603,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"ac","submitted":15243,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.4909002982187475,"acs":30453,"articleLive":2,"columnArticles":324,"formTitle":"[1269]停在原地的方案数","frequency":0.0,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","questionId":"1398","status":"ac","submitted":62035,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.8038437693738376,"acs":6483,"articleLive":2,"columnArticles":88,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":0.0,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","questionId":"1405","status":"","submitted":8065,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.5070590574666932,"acs":2550,"articleLive":2,"columnArticles":46,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"","submitted":5029,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.5238819592333435,"acs":1722,"articleLive":2,"columnArticles":34,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"","submitted":3287,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.5415715683077926,"acs":1661,"articleLive":2,"columnArticles":49,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"","submitted":3067,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.6096413874191652,"acs":1037,"articleLive":2,"columnArticles":25,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"","submitted":1701,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5456498388829216,"acs":8636,"articleLive":2,"columnArticles":176,"formTitle":"[1275]找出井字棋的获胜者","frequency":0.3929911054,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","questionId":"1400","status":"","submitted":15827,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5039016489988222,"acs":6845,"articleLive":2,"columnArticles":104,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","questionId":"1401","status":"","submitted":13584,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7283126110124334,"acs":20502,"articleLive":2,"columnArticles":250,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":1.3496762595,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","submitted":28150,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.6041603401153963,"acs":3979,"articleLive":2,"columnArticles":61,"formTitle":"[1278]分割回文串 III","frequency":1.5167303442,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","submitted":6586,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6252305422353375,"acs":1695,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":0.0,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1410","status":"","submitted":2711,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.5044971934807602,"acs":7460,"articleLive":2,"columnArticles":76,"formTitle":"[1280]学生们参加各科测试的次数","frequency":0.0,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"","submitted":14787,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.8314897875306017,"acs":46531,"articleLive":2,"columnArticles":633,"formTitle":"[1281]整数的各位积和之差","frequency":1.0182071603,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","questionId":"1406","status":"","submitted":55961,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8105549712305884,"acs":13101,"articleLive":2,"columnArticles":246,"formTitle":"[1282]用户分组","frequency":0.0,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","questionId":"1407","status":"","submitted":16163,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.4218266253869969,"acs":7630,"articleLive":2,"columnArticles":104,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":0.4716067405,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","submitted":18088,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6681212121212121,"acs":2756,"articleLive":2,"columnArticles":62,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":0.6647595781,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","questionId":"1409","status":"","submitted":4125,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8125416944629753,"acs":4872,"articleLive":2,"columnArticles":66,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","questionId":"1420","status":"","submitted":5996,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.6508097165991903,"acs":5144,"articleLive":2,"columnArticles":104,"formTitle":"[1286]字母组合迭代器","frequency":0.594008722,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","submitted":7904,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6020300120486327,"acs":16489,"articleLive":2,"columnArticles":228,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":1.3805429075,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","questionId":"1221","status":"","submitted":27389,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.5645597177389085,"acs":15041,"articleLive":2,"columnArticles":181,"formTitle":"[1288]删除被覆盖区间","frequency":1.4125900849,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","submitted":26642,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.6211062710610669,"acs":7557,"articleLive":2,"columnArticles":111,"formTitle":"[1289]下降路径最小和 II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","submitted":12167,"title":"下降路径最小和 II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8076475100139201,"acs":56860,"articleLive":2,"columnArticles":736,"formTitle":"[1290]二进制链表转整数","frequency":0.3929911054,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","questionId":"1411","status":"ac","submitted":70402,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5207857785155979,"acs":7529,"articleLive":2,"columnArticles":170,"formTitle":"[1291]顺次数","frequency":0.4716067405,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","submitted":14457,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.4769264416417584,"acs":6542,"articleLive":2,"columnArticles":101,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":0.0,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","questionId":"1413","status":"","submitted":13717,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.36521608493164404,"acs":14586,"articleLive":2,"columnArticles":130,"formTitle":"[1293]网格中的最短路径","frequency":2.6477779086,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","questionId":"1414","status":"","submitted":39938,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6541545811295001,"acs":7668,"articleLive":2,"columnArticles":81,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"","submitted":11722,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.8079926953742805,"acs":49555,"articleLive":2,"columnArticles":663,"formTitle":"[1295]统计位数为偶数的数字","frequency":0.4181180555,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","submitted":61331,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.47888675623800386,"acs":9481,"articleLive":2,"columnArticles":149,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.3929911054,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","questionId":"1422","status":"","submitted":19798,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.461906979838978,"acs":6942,"articleLive":2,"columnArticles":96,"formTitle":"[1297]子串的最大出现次数","frequency":1.0489221055,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","submitted":15029,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5909577887293764,"acs":2758,"articleLive":2,"columnArticles":96,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","submitted":4667,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7875383043922369,"acs":31611,"articleLive":2,"columnArticles":449,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","questionId":"1231","status":"","submitted":40139,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.4648792460607423,"acs":24812,"articleLive":2,"columnArticles":376,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":0.4442975611,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","submitted":53373,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.3613470274540786,"acs":3659,"articleLive":2,"columnArticles":88,"formTitle":"[1301]最大得分的路径数目","frequency":0.4442975611,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","submitted":10126,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8209446380178087,"acs":21205,"articleLive":2,"columnArticles":314,"formTitle":"[1302]层数最深叶子节点的和","frequency":1.0182071603,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","submitted":25830,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8233630442235174,"acs":9607,"articleLive":2,"columnArticles":90,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"","submitted":11668,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7228923476005188,"acs":22294,"articleLive":2,"columnArticles":400,"formTitle":"[1304]和为零的N个唯一整数","frequency":0.0,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","questionId":"1426","status":"","submitted":30840,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7480126064255139,"acs":15902,"articleLive":2,"columnArticles":239,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":0.4716067405,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","submitted":21259,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5762028409958759,"acs":18862,"articleLive":2,"columnArticles":290,"formTitle":"[1306]跳跃游戏 III","frequency":0.988662914,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","submitted":32735,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.3302083333333333,"acs":1902,"articleLive":2,"columnArticles":58,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","submitted":5760,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7523636834606916,"acs":5809,"articleLive":2,"columnArticles":63,"formTitle":"[1308]不同性别每日分数总计","frequency":0.0,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"","submitted":7721,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.754399721205785,"acs":17318,"articleLive":2,"columnArticles":300,"formTitle":"[1309]解码字母到整数映射","frequency":0.4442975611,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","submitted":22956,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.7144589958872695,"acs":37697,"articleLive":2,"columnArticles":507,"formTitle":"[1310]子数组异或查询","frequency":0.0,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"ac","submitted":52763,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.3834405667121596,"acs":5900,"articleLive":2,"columnArticles":91,"formTitle":"[1311]获取你好友已观看的视频","frequency":0.0,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","submitted":15387,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6695696721311475,"acs":11763,"articleLive":2,"columnArticles":156,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":0.4181180555,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","questionId":"1437","status":"","submitted":17568,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8328210579834069,"acs":36037,"articleLive":2,"columnArticles":553,"formTitle":"[1313]解压缩编码列表","frequency":0.0,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","submitted":43271,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7490137541315706,"acs":14050,"articleLive":2,"columnArticles":225,"formTitle":"[1314]矩阵区域和","frequency":1.4459042916,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","submitted":18758,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.8112980769230769,"acs":13500,"articleLive":2,"columnArticles":282,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","submitted":16640,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.44330965068087624,"acs":2995,"articleLive":2,"columnArticles":64,"formTitle":"[1316]不同的循环子字符串","frequency":0.6647595781,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","submitted":6756,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6172188467270434,"acs":10768,"articleLive":2,"columnArticles":205,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","questionId":"1440","status":"ac","submitted":17446,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6574833919499805,"acs":6730,"articleLive":2,"columnArticles":123,"formTitle":"[1318]或运算的最小翻转次数","frequency":1.114219448,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","questionId":"1441","status":"","submitted":10236,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6184308131241084,"acs":32514,"articleLive":2,"columnArticles":524,"formTitle":"[1319]连通网络的操作次数","frequency":0.0,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","submitted":52575,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5930549251021334,"acs":2613,"articleLive":2,"columnArticles":62,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","questionId":"1443","status":"","submitted":4406,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.6195885396945602,"acs":4909,"articleLive":2,"columnArticles":90,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.5001312072,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"","submitted":7923,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5946847210994342,"acs":5885,"articleLive":2,"columnArticles":68,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"","submitted":9896,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.7535072463768115,"acs":25996,"articleLive":2,"columnArticles":505,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":0.3929911054,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","submitted":34500,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5897507963275248,"acs":6295,"articleLive":2,"columnArticles":128,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","submitted":10674,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.7294193966915342,"acs":11244,"articleLive":2,"columnArticles":196,"formTitle":"[1325]删除给定值的叶子节点","frequency":0.0,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","submitted":15415,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.4739442600169845,"acs":6139,"articleLive":2,"columnArticles":97,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":0.0,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","questionId":"1451","status":"","submitted":12953,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6901327838827839,"acs":6029,"articleLive":2,"columnArticles":58,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","questionId":"1462","status":"","submitted":8736,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.46645912089541175,"acs":6293,"articleLive":2,"columnArticles":125,"formTitle":"[1328]破坏回文串","frequency":0.4442975611,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","submitted":13491,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7712771484983892,"acs":7422,"articleLive":2,"columnArticles":168,"formTitle":"[1329]将矩阵按对角线排序","frequency":0.9602114928,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","submitted":9623,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.38492555831265507,"acs":1241,"articleLive":2,"columnArticles":32,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":1.114219448,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","submitted":3224,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5327875630530059,"acs":12886,"articleLive":2,"columnArticles":222,"formTitle":"[1331]数组序号转换","frequency":1.3805429075,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","submitted":24186,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6924489795918367,"acs":10179,"articleLive":2,"columnArticles":141,"formTitle":"[1332]删除回文子序列","frequency":0.4442975611,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"ac","submitted":14700,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.54907306434024,"acs":6042,"articleLive":2,"columnArticles":127,"formTitle":"[1333]餐厅过滤器","frequency":1.1490055641,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","questionId":"1455","status":"","submitted":11004,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.4997617913292044,"acs":6294,"articleLive":2,"columnArticles":97,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":1.4459042916,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","questionId":"1456","status":"","submitted":12594,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5903501945525291,"acs":3793,"articleLive":2,"columnArticles":61,"formTitle":"[1335]工作计划的最低难度","frequency":0.5612188992,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","submitted":6425,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.43361308370992035,"acs":2015,"articleLive":2,"columnArticles":50,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"","submitted":4647,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.7045502348734488,"acs":40196,"articleLive":2,"columnArticles":646,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":2.1761588888,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"ac","submitted":57052,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6404867992285695,"acs":9631,"articleLive":2,"columnArticles":143,"formTitle":"[1338]数组大小减半","frequency":0.0,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"ac","submitted":15037,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.4020186545307079,"acs":8922,"articleLive":2,"columnArticles":142,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":0.4716067405,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","submitted":22193,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5741792150086399,"acs":4652,"articleLive":2,"columnArticles":100,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","submitted":8102,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.4362902268139176,"acs":3674,"articleLive":2,"columnArticles":52,"formTitle":"[1341]电影评分","frequency":0.4716067405,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"","submitted":8421,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.818937939859245,"acs":43520,"articleLive":2,"columnArticles":653,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.4442975611,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","questionId":"1444","status":"","submitted":53142,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.5487373529653697,"acs":13342,"articleLive":2,"columnArticles":227,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","questionId":"1445","status":"","submitted":24314,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.5966786355475763,"acs":6647,"articleLive":2,"columnArticles":124,"formTitle":"[1344]时钟指针的夹角","frequency":1.0489221055,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","submitted":11140,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.3637479541734861,"acs":6223,"articleLive":2,"columnArticles":115,"formTitle":"[1345]跳跃游戏 IV","frequency":0.5299663557,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","submitted":17108,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.4330426381226005,"acs":17032,"articleLive":2,"columnArticles":291,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","submitted":39331,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7445294431595801,"acs":8370,"articleLive":2,"columnArticles":130,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","questionId":"1469","status":"ac","submitted":11242,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.3117999479030998,"acs":3591,"articleLive":2,"columnArticles":58,"formTitle":"[1348]推文计数","frequency":1.4459042916,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","submitted":11517,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5060205143451761,"acs":3404,"articleLive":2,"columnArticles":99,"formTitle":"[1349]参加考试的最大学生数","frequency":0.0,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","submitted":6727,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.8460600375234522,"acs":9019,"articleLive":2,"columnArticles":89,"formTitle":"[1350]院系无效的学生","frequency":0.0,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"","submitted":10660,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.753632967827449,"acs":31272,"articleLive":2,"columnArticles":566,"formTitle":"[1351]统计有序矩阵中的负数","frequency":0.4442975611,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","submitted":41495,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.45038643729743205,"acs":7226,"articleLive":2,"columnArticles":80,"formTitle":"[1352]最后 K 个数的乘积","frequency":0.0,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","submitted":16044,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.28662199630314233,"acs":12405,"articleLive":2,"columnArticles":162,"formTitle":"[1353]最多可以参加的会议数目","frequency":1.8554735886,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","questionId":"1478","status":"","submitted":43280,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.2815398886827458,"acs":3035,"articleLive":2,"columnArticles":75,"formTitle":"[1354]多次求和构造目标数组","frequency":0.743540456,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","submitted":10780,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6637757472510454,"acs":4286,"articleLive":2,"columnArticles":63,"formTitle":"[1355]活动参与者","frequency":0.4716067405,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"","submitted":6457,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.7307009898524559,"acs":46949,"articleLive":2,"columnArticles":526,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":1.0489221055,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","questionId":"1458","status":"","submitted":64252,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5335586110463761,"acs":4579,"articleLive":2,"columnArticles":45,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.4442975611,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","submitted":8582,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.49630257279309814,"acs":6443,"articleLive":2,"columnArticles":121,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":0.0,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","submitted":12982,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5541926034419626,"acs":3027,"articleLive":2,"columnArticles":73,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","submitted":5462,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.5066673923692374,"acs":9309,"articleLive":2,"columnArticles":151,"formTitle":"[1360]日期之间隔几天","frequency":1.3805429075,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","submitted":18373,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.4007184685793022,"acs":8143,"articleLive":2,"columnArticles":214,"formTitle":"[1361]验证二叉树","frequency":0.4442975611,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","submitted":20321,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5310073979358846,"acs":5814,"articleLive":2,"columnArticles":75,"formTitle":"[1362]最接近的因数","frequency":0.5612188992,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","submitted":10949,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.36773841217830566,"acs":5387,"articleLive":2,"columnArticles":102,"formTitle":"[1363]形成三的最大倍数","frequency":0.5612188992,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","submitted":14649,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6835308685653635,"acs":3864,"articleLive":2,"columnArticles":73,"formTitle":"[1364]顾客的可信联系人数量","frequency":0.0,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","questionId":"1495","status":"","submitted":5653,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.824552697856882,"acs":88068,"articleLive":2,"columnArticles":1115,"formTitle":"[1365]有多少小于当前数字的数字","frequency":0.4716067405,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","questionId":"1482","status":"","submitted":106807,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5409229429690902,"acs":7455,"articleLive":2,"columnArticles":144,"formTitle":"[1366]通过投票对团队排名","frequency":0.4442975611,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","submitted":13782,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.4197650383317198,"acs":16043,"articleLive":2,"columnArticles":235,"formTitle":"[1367]二叉树中的列表","frequency":0.0,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"ac","submitted":38219,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5368663594470046,"acs":3961,"articleLive":2,"columnArticles":96,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.4716067405,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","questionId":"1485","status":"","submitted":7378,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.6040468161079151,"acs":3045,"articleLive":2,"columnArticles":44,"formTitle":"[1369]获取最近第二次的活动","frequency":0.4716067405,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"","submitted":5041,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7904004406142682,"acs":48793,"articleLive":2,"columnArticles":583,"formTitle":"[1370]上升下降字符串","frequency":0.4716067405,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","submitted":61732,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5810014138234588,"acs":21780,"articleLive":2,"columnArticles":280,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":1.0489221055,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","questionId":"1473","status":"","submitted":37487,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5187253806808161,"acs":8823,"articleLive":2,"columnArticles":172,"formTitle":"[1372]二叉树中的最长交错路径","frequency":0.0,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","submitted":17009,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.40543838242984137,"acs":9304,"articleLive":2,"columnArticles":193,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":1.4125900849,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","submitted":22948,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7408765276021914,"acs":17581,"articleLive":2,"columnArticles":233,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","questionId":"1490","status":"","submitted":23730,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.5794416570178824,"acs":9008,"articleLive":2,"columnArticles":178,"formTitle":"[1375]二进制字符串前缀一致的次数","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","submitted":15546,"title":"二进制字符串前缀一致的次数","titleSlug":"number-of-times-binary-string-is-prefix-aligned"},{"acceptance":0.5077462543831687,"acs":7964,"articleLive":2,"columnArticles":162,"formTitle":"[1376]通知所有员工所需的时间","frequency":0.0,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","submitted":15685,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.32783641160949867,"acs":4473,"articleLive":2,"columnArticles":136,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.5299663557,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","submitted":13644,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.8649011062688569,"acs":7740,"articleLive":2,"columnArticles":64,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","questionId":"1509","status":"","submitted":8949,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8387072068622194,"acs":10951,"articleLive":2,"columnArticles":171,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","questionId":"1498","status":"","submitted":13057,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.7275667606568254,"acs":17546,"articleLive":2,"columnArticles":268,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","submitted":24116,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.7309555011110478,"acs":12829,"articleLive":2,"columnArticles":176,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.4442975611,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"ac","submitted":17551,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.7029674934873712,"acs":12413,"articleLive":2,"columnArticles":189,"formTitle":"[1382]将二叉搜索树变平衡","frequency":0.0,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","submitted":17658,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.32623626373626374,"acs":4750,"articleLive":2,"columnArticles":92,"formTitle":"[1383]最大的团队表现值","frequency":1.2234585423,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","submitted":14560,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5494477911646586,"acs":2189,"articleLive":2,"columnArticles":50,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"","submitted":3984,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.6988956822598228,"acs":14746,"articleLive":2,"columnArticles":222,"formTitle":"[1385]两个数组间的距离值","frequency":0.0,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","submitted":21099,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.31773151471643934,"acs":6639,"articleLive":2,"columnArticles":135,"formTitle":"[1386]安排电影院座位","frequency":1.4125900849,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","submitted":20895,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6947955890263583,"acs":10333,"articleLive":2,"columnArticles":189,"formTitle":"[1387]将整数按权重排序","frequency":0.0,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","submitted":14872,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5485287138111058,"acs":4623,"articleLive":2,"columnArticles":56,"formTitle":"[1388]3n 块披萨","frequency":0.5299663557,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","submitted":8428,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8307328739821195,"acs":29177,"articleLive":2,"columnArticles":496,"formTitle":"[1389]按既定顺序创建目标数组","frequency":0.4442975611,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","submitted":35122,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.3649035210901337,"acs":7016,"articleLive":2,"columnArticles":124,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","submitted":19227,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.4020291693088142,"acs":6974,"articleLive":2,"columnArticles":210,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":0.5001312072,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","questionId":"1507","status":"","submitted":17347,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.41214842826754905,"acs":8719,"articleLive":2,"columnArticles":159,"formTitle":"[1392]最长快乐前缀","frequency":1.114219448,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","submitted":21155,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8568965517241379,"acs":4473,"articleLive":2,"columnArticles":66,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"","submitted":5220,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.6656086972383349,"acs":18245,"articleLive":2,"columnArticles":298,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","submitted":27411,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7388103942298192,"acs":14955,"articleLive":2,"columnArticles":214,"formTitle":"[1395]统计作战单位数","frequency":0.4442975611,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","submitted":20242,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.40676067474960464,"acs":12346,"articleLive":2,"columnArticles":169,"formTitle":"[1396]设计地铁系统","frequency":0.4181180555,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","submitted":30352,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.38605619146722164,"acs":1113,"articleLive":2,"columnArticles":38,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","submitted":2883,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7598865605798015,"acs":4823,"articleLive":2,"columnArticles":76,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","questionId":"1536","status":"","submitted":6347,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6703627012223632,"acs":10036,"articleLive":2,"columnArticles":162,"formTitle":"[1399]统计最大组的数目","frequency":0.4442975611,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","submitted":14971,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.6075405352607931,"acs":6220,"articleLive":2,"columnArticles":105,"formTitle":"[1400]构造 K 个回文字符串","frequency":0.0,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"ac","submitted":10238,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.41937109453739163,"acs":4161,"articleLive":2,"columnArticles":96,"formTitle":"[1401]圆和矩形是否有重叠","frequency":0.0,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","submitted":9922,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7543678584592702,"acs":10233,"articleLive":2,"columnArticles":186,"formTitle":"[1402]做菜顺序","frequency":0.0,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","submitted":13565,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6894168466522678,"acs":22344,"articleLive":2,"columnArticles":375,"formTitle":"[1403]非递增顺序的最小子序列","frequency":1.0489221055,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","submitted":32410,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.4946777248089858,"acs":7575,"articleLive":2,"columnArticles":161,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":0.0,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","questionId":"1520","status":"","submitted":15313,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5093752627596065,"acs":6058,"articleLive":2,"columnArticles":145,"formTitle":"[1405]最长快乐字符串","frequency":1.3964137374,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","submitted":11893,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.5688194520849378,"acs":5170,"articleLive":2,"columnArticles":85,"formTitle":"[1406]石子游戏 III","frequency":0.0,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","submitted":9089,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6708342088674091,"acs":6385,"articleLive":2,"columnArticles":71,"formTitle":"[1407]排名靠前的旅行者","frequency":0.0,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"","submitted":9518,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.6148683754762729,"acs":14201,"articleLive":2,"columnArticles":215,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","submitted":23096,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.8070425208807896,"acs":8503,"articleLive":2,"columnArticles":140,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","submitted":10536,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.475349931871671,"acs":7675,"articleLive":2,"columnArticles":121,"formTitle":"[1410]HTML 实体解析器","frequency":0.6284711262,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"ac","submitted":16146,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5516816220289061,"acs":8054,"articleLive":2,"columnArticles":146,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":1.1853732082,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","questionId":"1527","status":"","submitted":14599,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5488881044828804,"acs":3110,"articleLive":2,"columnArticles":73,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","questionId":"1546","status":"","submitted":5666,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.6959016393442623,"acs":11886,"articleLive":2,"columnArticles":247,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":0.4181180555,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","questionId":"1514","status":"","submitted":17080,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.6053738317757009,"acs":7773,"articleLive":2,"columnArticles":155,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":1.3805429075,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","questionId":"1515","status":"","submitted":12840,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.6861895855891328,"acs":6971,"articleLive":2,"columnArticles":188,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":0.5001312072,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","questionId":"1516","status":"","submitted":10159,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.41119017720106044,"acs":2947,"articleLive":2,"columnArticles":55,"formTitle":"[1416]恢复数组","frequency":0.0,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","submitted":7167,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.5209991242432319,"acs":13683,"articleLive":2,"columnArticles":191,"formTitle":"[1417]重新格式化字符串","frequency":0.4442975611,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","submitted":26263,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7314727825366123,"acs":26472,"articleLive":2,"columnArticles":420,"formTitle":"[1418]点菜展示表","frequency":2.5549469226,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","questionId":"1533","status":"ac","submitted":36190,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.4212752943575106,"acs":8265,"articleLive":2,"columnArticles":159,"formTitle":"[1419]数青蛙","frequency":1.0489221055,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","submitted":19619,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.603017444601603,"acs":2558,"articleLive":2,"columnArticles":47,"formTitle":"[1420]生成数组","frequency":0.8807415775,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","questionId":"1535","status":"","submitted":4242,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.741878059635069,"acs":3334,"articleLive":2,"columnArticles":41,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":1,"nodeType":"def","questionId":"1551","status":"","submitted":4494,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.5410988797827457,"acs":11158,"articleLive":2,"columnArticles":209,"formTitle":"[1422]分割字符串的最大得分","frequency":0.4442975611,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","submitted":20621,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.554607586112837,"acs":36598,"articleLive":2,"columnArticles":534,"formTitle":"[1423]可获得的最大点数","frequency":0.0,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"ac","submitted":65989,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.4020307966971658,"acs":7206,"articleLive":2,"columnArticles":158,"formTitle":"[1424]对角线遍历 II","frequency":0.988662914,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","submitted":17924,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.4448727833461835,"acs":3462,"articleLive":2,"columnArticles":76,"formTitle":"[1425]带限制的子序列和","frequency":0.5001312072,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","submitted":7782,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.6988783433994823,"acs":1620,"articleLive":2,"columnArticles":55,"formTitle":"[1426]数元素","frequency":1.3496762595,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"","submitted":2318,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6442262739597943,"acs":1378,"articleLive":2,"columnArticles":53,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"","submitted":2139,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5993167398731089,"acs":1228,"articleLive":2,"columnArticles":23,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","questionId":"1374","status":"","submitted":2049,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.4979712283290299,"acs":1350,"articleLive":2,"columnArticles":51,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"","submitted":2711,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.5686411149825784,"acs":816,"articleLive":2,"columnArticles":31,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","questionId":"1432","status":"","submitted":1435,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.8460741617690584,"acs":80042,"articleLive":2,"columnArticles":1052,"formTitle":"[1431]拥有最多糖果的孩子","frequency":0.0,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","submitted":94604,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.39652593085106386,"acs":4771,"articleLive":2,"columnArticles":104,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","questionId":"1529","status":"","submitted":12032,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6407914764079148,"acs":6315,"articleLive":2,"columnArticles":114,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","questionId":"1530","status":"","submitted":9855,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.4697559250088433,"acs":2656,"articleLive":2,"columnArticles":46,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","questionId":"1531","status":"","submitted":5654,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6236016371077763,"acs":4571,"articleLive":2,"columnArticles":51,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"","submitted":7330,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.8225055944304337,"acs":46312,"articleLive":2,"columnArticles":659,"formTitle":"[1436]旅行终点站","frequency":0.988662914,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"ac","submitted":56306,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5829670613785615,"acs":11274,"articleLive":2,"columnArticles":191,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":0.0,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","questionId":"1548","status":"","submitted":19339,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.48244686102765905,"acs":34205,"articleLive":2,"columnArticles":483,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":1.0182071603,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","questionId":"1549","status":"","submitted":70899,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.5421447944919675,"acs":5197,"articleLive":2,"columnArticles":71,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":1.0808941382,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","questionId":"1550","status":"","submitted":9586,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.7034951911799202,"acs":2999,"articleLive":2,"columnArticles":42,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"","submitted":4263,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.6490869446715727,"acs":19052,"articleLive":2,"columnArticles":384,"formTitle":"[1441]用栈操作构建数组","frequency":0.0,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"ac","submitted":29352,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.791478358628443,"acs":35201,"articleLive":2,"columnArticles":379,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":0.0,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","questionId":"1553","status":"ac","submitted":44475,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.41198658843252306,"acs":5898,"articleLive":2,"columnArticles":146,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","questionId":"1554","status":"","submitted":14316,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5296021321149819,"acs":2782,"articleLive":2,"columnArticles":64,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","submitted":5253,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8569215876089061,"acs":4426,"articleLive":2,"columnArticles":56,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"","submitted":5165,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.6107544237927172,"acs":50703,"articleLive":2,"columnArticles":686,"formTitle":"[1446]连续字符","frequency":1.6020533872,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","submitted":83017,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.6138369554901775,"acs":6468,"articleLive":2,"columnArticles":84,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","submitted":10537,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7140035677879715,"acs":11207,"articleLive":2,"columnArticles":181,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":1.0182071603,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","submitted":15696,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6273426416784887,"acs":16804,"articleLive":2,"columnArticles":207,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":0.0,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","questionId":"1545","status":"ac","submitted":26786,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.8027747376553145,"acs":24939,"articleLive":2,"columnArticles":353,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":0.0,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","questionId":"1560","status":"ac","submitted":31066,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.5254703541779241,"acs":10697,"articleLive":2,"columnArticles":164,"formTitle":"[1451]重新排列句子中的单词","frequency":0.4442975611,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","submitted":20357,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.5012602650622002,"acs":6165,"articleLive":2,"columnArticles":92,"formTitle":"[1452]收藏清单","frequency":0.0,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","questionId":"1562","status":"","submitted":12299,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.36721241760578355,"acs":1727,"articleLive":2,"columnArticles":36,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":0.8807415775,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","questionId":"1563","status":"","submitted":4703,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.39377537212449254,"acs":5529,"articleLive":2,"columnArticles":87,"formTitle":"[1454]活跃用户","frequency":1.1490055641,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"","submitted":14041,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6277523274715531,"acs":12744,"articleLive":2,"columnArticles":225,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","questionId":"1566","status":"","submitted":20301,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.5257454445057979,"acs":15234,"articleLive":2,"columnArticles":227,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.4442975611,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","questionId":"1567","status":"","submitted":28976,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.6298449612403101,"acs":8450,"articleLive":2,"columnArticles":147,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","submitted":13416,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.4432643080919997,"acs":5801,"articleLive":2,"columnArticles":92,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","submitted":13087,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.5995797338314266,"acs":2568,"articleLive":2,"columnArticles":51,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"","submitted":4283,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7416879795396419,"acs":16240,"articleLive":2,"columnArticles":329,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","questionId":"1556","status":"ac","submitted":21896,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.5068307102340817,"acs":6344,"articleLive":2,"columnArticles":91,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","questionId":"1557","status":"","submitted":12517,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.43669219722355196,"acs":7298,"articleLive":2,"columnArticles":145,"formTitle":"[1462]课程表 IV","frequency":0.0,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","submitted":16712,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.595448798988622,"acs":2826,"articleLive":2,"columnArticles":69,"formTitle":"[1463]摘樱桃 II","frequency":0.0,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","submitted":4746,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7675364834807139,"acs":28296,"articleLive":2,"columnArticles":401,"formTitle":"[1464]数组中两元素的最大乘积","frequency":1.0182071603,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","questionId":"1574","status":"","submitted":36866,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.31365708437994233,"acs":6743,"articleLive":2,"columnArticles":85,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.4716067405,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","questionId":"1575","status":"","submitted":21498,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.4832416208104052,"acs":6762,"articleLive":2,"columnArticles":127,"formTitle":"[1466]重新规划路线","frequency":0.5001312072,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","questionId":"1576","status":"","submitted":13993,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6178343949044586,"acs":1746,"articleLive":2,"columnArticles":50,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","questionId":"1577","status":"","submitted":2826,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.7010156580617859,"acs":3313,"articleLive":2,"columnArticles":56,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"","submitted":4726,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.80078125,"acs":2665,"articleLive":2,"columnArticles":98,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"","submitted":3328,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.842306119667439,"acs":55620,"articleLive":2,"columnArticles":749,"formTitle":"[1470]重新排列数组","frequency":0.4442975611,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","submitted":66033,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.5467017344327552,"acs":7691,"articleLive":2,"columnArticles":111,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.5612188992,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","submitted":14068,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6206331519958052,"acs":9469,"articleLive":2,"columnArticles":154,"formTitle":"[1472]设计浏览器历史记录","frequency":1.3199121576,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","submitted":15257,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.6726618705035972,"acs":15708,"articleLive":2,"columnArticles":168,"formTitle":"[1473]粉刷房子 III","frequency":0.0,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","submitted":23352,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7151474530831099,"acs":2134,"articleLive":2,"columnArticles":73,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","questionId":"1618","status":"","submitted":2984,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7212578074520783,"acs":16744,"articleLive":2,"columnArticles":257,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","questionId":"1570","status":"","submitted":23215,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8642105959388848,"acs":13066,"articleLive":2,"columnArticles":123,"formTitle":"[1476]子矩形查询","frequency":0.0,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","submitted":15119,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.2909480449919657,"acs":5432,"articleLive":2,"columnArticles":105,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":1.0182071603,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","questionId":"1573","status":"","submitted":18670,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5855945730247406,"acs":2935,"articleLive":2,"columnArticles":63,"formTitle":"[1478]安排邮筒","frequency":0.594008722,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","submitted":5012,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5634233316352522,"acs":2212,"articleLive":2,"columnArticles":44,"formTitle":"[1479]周内每天的销售情况","frequency":0.5001312072,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"","submitted":3926,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.869187364106337,"acs":132319,"articleLive":2,"columnArticles":1347,"formTitle":"[1480]一维数组的动态和","frequency":1.8554735886,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"ac","submitted":152233,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5168787515006003,"acs":10764,"articleLive":2,"columnArticles":153,"formTitle":"[1481]不同整数的最少数目","frequency":1.3805429075,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","questionId":"1604","status":"","submitted":20825,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5876107168399626,"acs":32043,"articleLive":2,"columnArticles":418,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":0.0,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","questionId":"1605","status":"ac","submitted":54531,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.3029916709161992,"acs":3565,"articleLive":2,"columnArticles":78,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","submitted":11766,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8135135135135135,"acs":903,"articleLive":2,"columnArticles":27,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"","submitted":1110,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.6570138564533707,"acs":4220,"articleLive":2,"columnArticles":49,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"","submitted":6423,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.8586015881318054,"acs":72229,"articleLive":2,"columnArticles":705,"formTitle":"[1486]数组异或操作","frequency":0.3688470065,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"ac","submitted":84124,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.31326423663677655,"acs":8070,"articleLive":2,"columnArticles":108,"formTitle":"[1487]保证文件名唯一","frequency":1.114219448,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","submitted":25761,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.2441923774954628,"acs":8073,"articleLive":2,"columnArticles":120,"formTitle":"[1488]避免洪水泛滥","frequency":3.1492421696,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","submitted":33060,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6889915769770707,"acs":11779,"articleLive":2,"columnArticles":129,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.594008722,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","questionId":"1613","status":"","submitted":17096,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8522427440633246,"acs":1292,"articleLive":2,"columnArticles":32,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"","submitted":1516,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.6720218931101095,"acs":20873,"articleLive":2,"columnArticles":309,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","questionId":"1584","status":"","submitted":31060,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.65201741168592,"acs":7789,"articleLive":2,"columnArticles":90,"formTitle":"[1492]n 的第 k 个因子","frequency":1.3496762595,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","submitted":11946,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.5748471842892444,"acs":8840,"articleLive":2,"columnArticles":167,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":0.9602114928,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","questionId":"1586","status":"","submitted":15378,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.37333537425378843,"acs":2439,"articleLive":2,"columnArticles":39,"formTitle":"[1494]并行课程 II","frequency":1.2234585423,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","submitted":6533,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5411895086811969,"acs":4395,"articleLive":2,"columnArticles":42,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"","submitted":8121,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5357110112771615,"acs":11686,"articleLive":2,"columnArticles":177,"formTitle":"[1496]判断路径是否相交","frequency":0.0,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","submitted":21814,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.39425828893487735,"acs":8954,"articleLive":2,"columnArticles":119,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":1.0182071603,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","questionId":"1620","status":"","submitted":22711,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.33536328007235455,"acs":5562,"articleLive":2,"columnArticles":74,"formTitle":"[1498]满足条件的子序列数目","frequency":0.0,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","questionId":"1621","status":"","submitted":16585,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.37770193401592717,"acs":2988,"articleLive":2,"columnArticles":66,"formTitle":"[1499]满足不等式的最大值","frequency":0.5299663557,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","submitted":7911,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.30329542140565763,"acs":1040,"articleLive":2,"columnArticles":33,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"","submitted":3429,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.5967720597962693,"acs":4511,"articleLive":2,"columnArticles":65,"formTitle":"[1501]可以放心投资的国家","frequency":0.5001312072,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"","submitted":7559,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7162049600988796,"acs":26655,"articleLive":2,"columnArticles":314,"formTitle":"[1502]判断能否形成等差数列","frequency":1.6459420757,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","submitted":37217,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5162653391988886,"acs":8919,"articleLive":2,"columnArticles":92,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":0.4442975611,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","questionId":"1627","status":"","submitted":17276,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.6000151480724077,"acs":7922,"articleLive":2,"columnArticles":139,"formTitle":"[1504]统计全 1 子矩形","frequency":1.0182071603,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","submitted":13203,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.3637038608400509,"acs":3429,"articleLive":2,"columnArticles":74,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":0.0,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","questionId":"1629","status":"","submitted":9428,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.8374512353706112,"acs":644,"articleLive":2,"columnArticles":18,"formTitle":"[1506]找到 N 叉树的根节点","frequency":0.0,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"","submitted":769,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5877476073892722,"acs":10563,"articleLive":2,"columnArticles":136,"formTitle":"[1507]转变日期格式","frequency":0.4181180555,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","submitted":17972,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.553594489883771,"acs":6430,"articleLive":2,"columnArticles":58,"formTitle":"[1508]子数组和排序后的区间和","frequency":0.0,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","submitted":11615,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5520437030533607,"acs":5659,"articleLive":2,"columnArticles":84,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.5299663557,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","questionId":"1616","status":"","submitted":10251,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.5808210391276459,"acs":5433,"articleLive":2,"columnArticles":67,"formTitle":"[1510]石子游戏 IV","frequency":1.0489221055,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","submitted":9354,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.682141302770927,"acs":4702,"articleLive":2,"columnArticles":65,"formTitle":"[1511]消费者下单频率","frequency":0.4716067405,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"","submitted":6893,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.8482384445870178,"acs":60817,"articleLive":2,"columnArticles":778,"formTitle":"[1512]好数对的数目","frequency":1.4125900849,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","submitted":71698,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.3828358705045536,"acs":11518,"articleLive":2,"columnArticles":164,"formTitle":"[1513]仅含 1 的子串数","frequency":0.0,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","submitted":30086,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.33877400295420973,"acs":9174,"articleLive":2,"columnArticles":160,"formTitle":"[1514]概率最大的路径","frequency":0.988662914,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","submitted":27080,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.3449795081967213,"acs":3367,"articleLive":2,"columnArticles":62,"formTitle":"[1515]服务中心的最佳位置","frequency":0.0,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","submitted":9760,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.585812356979405,"acs":256,"articleLive":2,"columnArticles":14,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","questionId":"1655","status":"","submitted":437,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.6593521421107628,"acs":3786,"articleLive":2,"columnArticles":39,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"","submitted":5742,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.703093485606517,"acs":53684,"articleLive":2,"columnArticles":802,"formTitle":"[1518]换酒问题","frequency":0.1682349471,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","submitted":76354,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.3017648912700914,"acs":5745,"articleLive":2,"columnArticles":127,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.5001312072,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","questionId":"1643","status":"","submitted":19038,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.3356876846025427,"acs":2614,"articleLive":2,"columnArticles":74,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","submitted":7787,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.39386625017748117,"acs":2774,"articleLive":2,"columnArticles":55,"formTitle":"[1521]找到最接近目标值的函数值","frequency":0.0,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","questionId":"1645","status":"","submitted":7043,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.7086280056577087,"acs":1002,"articleLive":2,"columnArticles":33,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"","submitted":1414,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5746905676483142,"acs":10772,"articleLive":2,"columnArticles":183,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","submitted":18744,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.43526768420237083,"acs":5618,"articleLive":2,"columnArticles":112,"formTitle":"[1524]和为奇数的子数组数目","frequency":0.4181180555,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","submitted":12907,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6590396753832282,"acs":5847,"articleLive":2,"columnArticles":117,"formTitle":"[1525]字符串的好分割数目","frequency":0.0,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","questionId":"1632","status":"","submitted":8872,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.6212370005473454,"acs":3405,"articleLive":2,"columnArticles":55,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","questionId":"1633","status":"","submitted":5481,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.49194044542881754,"acs":3998,"articleLive":2,"columnArticles":42,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"","submitted":8127,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.7853897326471696,"acs":31286,"articleLive":2,"columnArticles":383,"formTitle":"[1528]重新排列字符串","frequency":1.3805429075,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","submitted":39835,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.69377990430622,"acs":9280,"articleLive":2,"columnArticles":139,"formTitle":"[1529]最少的后缀翻转次数","frequency":0.5001312072,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","submitted":13376,"title":"最少的后缀翻转次数","titleSlug":"minimum-suffix-flips"},{"acceptance":0.57101739456889,"acs":9126,"articleLive":2,"columnArticles":152,"formTitle":"[1530]好叶子节点对的数量","frequency":1.4805818301,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","submitted":15982,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.34375,"acs":2079,"articleLive":2,"columnArticles":36,"formTitle":"[1531]压缩字符串 II","frequency":2.4102792222,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","submitted":6048,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6181248776668624,"acs":3158,"articleLive":2,"columnArticles":52,"formTitle":"[1532]最近的三笔订单","frequency":1.593939094,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"","submitted":5109,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6043405676126878,"acs":362,"articleLive":2,"columnArticles":20,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","questionId":"1672","status":"","submitted":599,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.7861219195849546,"acs":18183,"articleLive":2,"columnArticles":169,"formTitle":"[1534]统计好三元组","frequency":1.0489221055,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","submitted":23130,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.45497504159733776,"acs":13672,"articleLive":2,"columnArticles":186,"formTitle":"[1535]找出数组游戏的赢家","frequency":0.4181180555,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","submitted":30050,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.44450245379555187,"acs":4257,"articleLive":2,"columnArticles":83,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.7030490946,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","submitted":9577,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.3690298213864191,"acs":4690,"articleLive":2,"columnArticles":97,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","submitted":12709,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.6068376068376068,"acs":142,"articleLive":2,"columnArticles":7,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","questionId":"1681","status":"","submitted":234,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5398529237338394,"acs":18206,"articleLive":2,"columnArticles":265,"formTitle":"[1539]第 k 个缺失的正整数","frequency":1.0808941382,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","submitted":33724,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.3190068061507436,"acs":5062,"articleLive":2,"columnArticles":91,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","submitted":15868,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.46683537559936067,"acs":7010,"articleLive":2,"columnArticles":106,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"ac","submitted":15016,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.3882387361029842,"acs":2654,"articleLive":2,"columnArticles":51,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","submitted":6836,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5552792971987403,"acs":3350,"articleLive":2,"columnArticles":46,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"","submitted":6033,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.5506065496954236,"acs":21151,"articleLive":2,"columnArticles":336,"formTitle":"[1544]整理字符串","frequency":1.4125900849,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"ac","submitted":38414,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5553191489361702,"acs":7830,"articleLive":2,"columnArticles":104,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":1.0489221055,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","submitted":14100,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.4186064377352693,"acs":5449,"articleLive":2,"columnArticles":82,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","questionId":"1649","status":"","submitted":13017,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5388461538461539,"acs":4203,"articleLive":2,"columnArticles":73,"formTitle":"[1547]切棍子的最小成本","frequency":0.0,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","submitted":7800,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.712707182320442,"acs":387,"articleLive":2,"columnArticles":16,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","questionId":"1687","status":"","submitted":543,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.6671511627906976,"acs":2754,"articleLive":2,"columnArticles":53,"formTitle":"[1549]每件商品的最新订单","frequency":0.0,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","questionId":"1688","status":"","submitted":4128,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6559880415030189,"acs":22381,"articleLive":2,"columnArticles":302,"formTitle":"[1550]存在连续三个奇数的数组","frequency":0.0,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","submitted":34118,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8175182481751825,"acs":11760,"articleLive":2,"columnArticles":164,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":0.0,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","submitted":14385,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.513988597972973,"acs":9737,"articleLive":2,"columnArticles":130,"formTitle":"[1552]两球之间的磁力","frequency":1.0182071603,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","submitted":18944,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.2982215635420526,"acs":8049,"articleLive":2,"columnArticles":126,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":1.4125900849,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","questionId":"1676","status":"","submitted":26990,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.7092896174863388,"acs":649,"articleLive":2,"columnArticles":22,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"","submitted":915,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.44102701257020593,"acs":3298,"articleLive":2,"columnArticles":62,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"","submitted":7478,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.5749916383964834,"acs":12034,"articleLive":2,"columnArticles":185,"formTitle":"[1556]千位分隔数","frequency":2.1761588888,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","submitted":20929,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7766200762388819,"acs":9168,"articleLive":2,"columnArticles":130,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":1.3199121576,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","questionId":"1661","status":"","submitted":11805,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6243225380039656,"acs":4723,"articleLive":2,"columnArticles":77,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":0.594008722,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","questionId":"1662","status":"","submitted":7565,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.37637938896488826,"acs":4127,"articleLive":2,"columnArticles":75,"formTitle":"[1559]二维网格图中探测环","frequency":0.0,"frontendQuestionId":"1559","leaf":true,"level":2,"nodeType":"def","questionId":"1663","status":"","submitted":10965,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5716813041005876,"acs":9048,"articleLive":2,"columnArticles":93,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":0.0,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","submitted":15827,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7787090317738303,"acs":12450,"articleLive":2,"columnArticles":185,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":1.0489221055,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","submitted":15988,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.3109643516545945,"acs":4379,"articleLive":2,"columnArticles":89,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":0.0,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","submitted":14082,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.38304495102078184,"acs":4184,"articleLive":2,"columnArticles":67,"formTitle":"[1563]石子游戏 V","frequency":0.0,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","submitted":10923,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5527272727272727,"acs":760,"articleLive":2,"columnArticles":28,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"","submitted":1375,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.7312059514487079,"acs":3735,"articleLive":2,"columnArticles":46,"formTitle":"[1565]按月统计订单数与顾客数","frequency":0.0,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"","submitted":5108,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.4450129226225012,"acs":8437,"articleLive":2,"columnArticles":126,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":0.4442975611,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","questionId":"1689","status":"","submitted":18959,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.4095070748173495,"acs":17712,"articleLive":2,"columnArticles":266,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":1.7925558035,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","submitted":43252,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.4593052525591542,"acs":2737,"articleLive":2,"columnArticles":51,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","submitted":5959,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.4734905864531487,"acs":2188,"articleLive":2,"columnArticles":47,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","questionId":"1692","status":"","submitted":4621,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.896578843885175,"acs":2280,"articleLive":2,"columnArticles":40,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.4442975611,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"","submitted":2543,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.7601126987321393,"acs":3777,"articleLive":2,"columnArticles":46,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"","submitted":4969,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.8010465070873521,"acs":20514,"articleLive":2,"columnArticles":339,"formTitle":"[1572]矩阵对角线元素的和","frequency":1.0182071603,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","submitted":25609,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.2983278439321003,"acs":4710,"articleLive":2,"columnArticles":67,"formTitle":"[1573]分割字符串的方案数","frequency":0.0,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","submitted":15788,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.33173015262280364,"acs":5173,"articleLive":2,"columnArticles":90,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":0.5001312072,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","questionId":"1679","status":"","submitted":15594,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.5943598286530224,"acs":4995,"articleLive":2,"columnArticles":72,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","submitted":8404,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.47679012975094953,"acs":18704,"articleLive":2,"columnArticles":267,"formTitle":"[1576]替换所有的问号","frequency":0.0,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","questionId":"1698","status":"","submitted":39229,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.32840529506371396,"acs":5309,"articleLive":2,"columnArticles":85,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":0.743540456,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","questionId":"1699","status":"","submitted":16166,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5857113529049477,"acs":11412,"articleLive":2,"columnArticles":213,"formTitle":"[1578]使绳子变成彩色的最短时间","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","submitted":19484,"title":"使绳子变成彩色的最短时间","titleSlug":"minimum-time-to-make-rope-colorful"},{"acceptance":0.6196244700181708,"acs":16368,"articleLive":2,"columnArticles":298,"formTitle":"[1579]保证图可完全遍历","frequency":0.0,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","questionId":"1701","status":"","submitted":26416,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.5962616822429907,"acs":319,"articleLive":2,"columnArticles":23,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"","submitted":535,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8078423321699856,"acs":3935,"articleLive":2,"columnArticles":55,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","questionId":"1724","status":"","submitted":4871,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6694728662090402,"acs":10338,"articleLive":2,"columnArticles":122,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":0.4716067405,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","submitted":15442,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6851456486339786,"acs":18934,"articleLive":2,"columnArticles":246,"formTitle":"[1583]统计不开心的朋友","frequency":2.6477779086,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","submitted":27635,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6637528047868362,"acs":28398,"articleLive":2,"columnArticles":361,"formTitle":"[1584]连接所有点的最小费用","frequency":1.6459420757,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","submitted":42784,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.4309829435554774,"acs":2451,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","questionId":"1707","status":"","submitted":5687,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6288951841359773,"acs":444,"articleLive":2,"columnArticles":24,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"","submitted":706,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.8320871608630634,"acs":3895,"articleLive":2,"columnArticles":44,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"","submitted":4681,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8390276316518079,"acs":45456,"articleLive":2,"columnArticles":722,"formTitle":"[1588]所有奇数长度子数组的和","frequency":2.1436281392,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"ac","submitted":54177,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.2975840562047459,"acs":4151,"articleLive":2,"columnArticles":60,"formTitle":"[1589]所有排列中的最大和","frequency":0.4716067405,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","submitted":13949,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.2708599905717557,"acs":4022,"articleLive":2,"columnArticles":61,"formTitle":"[1590]使数组和能被 P 整除","frequency":0.5299663557,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","submitted":14849,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5858015984955336,"acs":1246,"articleLive":2,"columnArticles":37,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","submitted":2127,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.4450199633106723,"acs":8248,"articleLive":2,"columnArticles":131,"formTitle":"[1592]重新排列单词间的空格","frequency":0.4716067405,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","submitted":18534,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.54160096466005,"acs":5839,"articleLive":2,"columnArticles":95,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":1.0182071603,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","questionId":"1715","status":"","submitted":10781,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.3143366619115549,"acs":4407,"articleLive":2,"columnArticles":103,"formTitle":"[1594]矩阵的最大非负积","frequency":0.5612188992,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","submitted":14020,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.4693157770985187,"acs":1996,"articleLive":2,"columnArticles":40,"formTitle":"[1595]连通两组点的最小成本","frequency":0.8320938533,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","questionId":"1717","status":"","submitted":4253,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7560433453737149,"acs":2721,"articleLive":2,"columnArticles":47,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","questionId":"1735","status":"","submitted":3599,"title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.6611909650924025,"acs":322,"articleLive":2,"columnArticles":21,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","questionId":"1736","status":"","submitted":487,"title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6733079068708374,"acs":11828,"articleLive":2,"columnArticles":158,"formTitle":"[1598]文件夹操作日志搜集器","frequency":0.0,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"ac","submitted":17567,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.42092508692445474,"acs":3995,"articleLive":2,"columnArticles":71,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","submitted":9491,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.6756566328727444,"acs":17261,"articleLive":2,"columnArticles":210,"formTitle":"[1600]皇位继承顺序","frequency":0.0,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","submitted":25547,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.4905254091300603,"acs":2278,"articleLive":2,"columnArticles":41,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","submitted":4644,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7485477178423237,"acs":902,"articleLive":2,"columnArticles":36,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","questionId":"1745","status":"","submitted":1205,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8439083025671846,"acs":58974,"articleLive":2,"columnArticles":470,"formTitle":"[1603]设计停车系统","frequency":1.3805429075,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"ac","submitted":69882,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.4152354010911295,"acs":4110,"articleLive":2,"columnArticles":69,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":1.1490055641,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","questionId":"1709","status":"","submitted":9898,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7405743309240086,"acs":3791,"articleLive":2,"columnArticles":75,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","questionId":"1711","status":"ac","submitted":5119,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.3501769563507668,"acs":1781,"articleLive":2,"columnArticles":38,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","questionId":"1710","status":"","submitted":5086,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5411313198731854,"acs":3243,"articleLive":2,"columnArticles":44,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"","submitted":5993,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6388109592311825,"acs":10702,"articleLive":2,"columnArticles":179,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","questionId":"1730","status":"","submitted":16753,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.593497890203109,"acs":27146,"articleLive":2,"columnArticles":432,"formTitle":"[1609]奇偶树","frequency":0.553266571,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"ac","submitted":45739,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.44680323806377004,"acs":16227,"articleLive":2,"columnArticles":154,"formTitle":"[1610]可见点的最大数目","frequency":0.7976076772,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","submitted":36318,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.607993430057487,"acs":2221,"articleLive":2,"columnArticles":58,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","questionId":"1732","status":"","submitted":3653,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.7289586305278174,"acs":511,"articleLive":2,"columnArticles":23,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","questionId":"1750","status":"","submitted":701,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.7335307179866766,"acs":1982,"articleLive":2,"columnArticles":38,"formTitle":"[1613]找到遗失的ID","frequency":0.5612188992,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"","submitted":2702,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.8212973747872054,"acs":18333,"articleLive":2,"columnArticles":303,"formTitle":"[1614]括号的最大嵌套深度","frequency":0.0,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","submitted":22322,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.5036419482229048,"acs":5739,"articleLive":2,"columnArticles":69,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","submitted":11395,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.27746092099704267,"acs":5254,"articleLive":2,"columnArticles":97,"formTitle":"[1616]分割两个字符串得到回文串","frequency":1.7849943308,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","submitted":18936,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6264406779661017,"acs":1848,"articleLive":2,"columnArticles":35,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","submitted":2950,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5781990521327014,"acs":366,"articleLive":2,"columnArticles":18,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","questionId":"1384","status":"","submitted":633,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6718555932764759,"acs":8114,"articleLive":2,"columnArticles":138,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","submitted":12077,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.3737388091516271,"acs":2630,"articleLive":2,"columnArticles":44,"formTitle":"[1620]网络信号最好的坐标","frequency":0.0,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","submitted":7037,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.44226731980405876,"acs":1896,"articleLive":2,"columnArticles":37,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","questionId":"1725","status":"","submitted":4287,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.15479690732875967,"acs":2843,"articleLive":2,"columnArticles":61,"formTitle":"[1622]奇妙序列","frequency":1.8886727603,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","submitted":18366,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.7846919726197884,"acs":3783,"articleLive":2,"columnArticles":48,"formTitle":"[1623]三人国家代表队","frequency":0.0,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","questionId":"1763","status":"","submitted":4821,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.621226549852395,"acs":13047,"articleLive":2,"columnArticles":226,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":1.0182071603,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","submitted":21002,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5478818084727661,"acs":3078,"articleLive":2,"columnArticles":69,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","submitted":5618,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.3910677425408144,"acs":4168,"articleLive":2,"columnArticles":87,"formTitle":"[1626]无矛盾的最佳球队","frequency":0.5001312072,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","submitted":10658,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.3846729531507259,"acs":2570,"articleLive":2,"columnArticles":40,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","submitted":6681,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8330404217926186,"acs":474,"articleLive":2,"columnArticles":21,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","questionId":"1768","status":"","submitted":569,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.5241703984383971,"acs":9130,"articleLive":2,"columnArticles":106,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","submitted":17418,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.7622124326970142,"acs":7786,"articleLive":2,"columnArticles":124,"formTitle":"[1630]等差子数组","frequency":1.4125900849,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","submitted":10215,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.4937716637781629,"acs":27351,"articleLive":2,"columnArticles":315,"formTitle":"[1631]最小体力消耗路径","frequency":1.5167303442,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"ac","submitted":55392,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.3254755996691481,"acs":1574,"articleLive":2,"columnArticles":29,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","submitted":4836,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6567036720751495,"acs":3076,"articleLive":2,"columnArticles":32,"formTitle":"[1633]各赛事的用户注册率","frequency":0.0,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"","submitted":4684,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5319715808170515,"acs":599,"articleLive":2,"columnArticles":30,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","questionId":"1774","status":"","submitted":1126,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.547760602457392,"acs":1382,"articleLive":2,"columnArticles":38,"formTitle":"[1635]Hopper 公司查询 I","frequency":0.0,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"","submitted":2523,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7056443173097049,"acs":10114,"articleLive":2,"columnArticles":199,"formTitle":"[1636]按照频率将数组升序排序","frequency":1.3805429075,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","submitted":14333,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8074003795066413,"acs":5957,"articleLive":2,"columnArticles":82,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","questionId":"1742","status":"","submitted":7378,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7151445086705203,"acs":3093,"articleLive":2,"columnArticles":52,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":0.594008722,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","submitted":4325,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.4005805515239477,"acs":1380,"articleLive":2,"columnArticles":33,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","questionId":"1744","status":"","submitted":3445,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.6548335044741088,"acs":13392,"articleLive":2,"columnArticles":228,"formTitle":"[1640]能否连接形成数组","frequency":0.0,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","submitted":20451,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.773379301853106,"acs":12562,"articleLive":2,"columnArticles":291,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":1.0489221055,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","submitted":16243,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.451971163213613,"acs":6959,"articleLive":2,"columnArticles":112,"formTitle":"[1642]可以到达的最远建筑","frequency":0.0,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","submitted":15397,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.4571155682903534,"acs":2393,"articleLive":2,"columnArticles":49,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","submitted":5235,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.5597602098164106,"acs":1494,"articleLive":2,"columnArticles":29,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":0.0,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","questionId":"1780","status":"","submitted":2669,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.41980533220482436,"acs":992,"articleLive":2,"columnArticles":28,"formTitle":"[1645]Hopper Company Queries II","frequency":0.0,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1785","status":"","submitted":2363,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5338408003479774,"acs":36819,"articleLive":2,"columnArticles":368,"formTitle":"[1646]获取生成数组中的最大值","frequency":2.4560782663,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"ac","submitted":68970,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5188371789857906,"acs":7960,"articleLive":2,"columnArticles":121,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":1.0489221055,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","submitted":15342,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.2818047337278107,"acs":3810,"articleLive":2,"columnArticles":94,"formTitle":"[1648]销售价值减少的颜色球","frequency":1.0182071603,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","submitted":13520,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.4749075541468568,"acs":2697,"articleLive":2,"columnArticles":68,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","submitted":5679,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.8005804311774462,"acs":1931,"articleLive":2,"columnArticles":36,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":0.4442975611,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","questionId":"1790","status":"","submitted":2412,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.6612305411415864,"acs":892,"articleLive":2,"columnArticles":25,"formTitle":"[1651]Hopper Company Queries III","frequency":0.6647595781,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1795","status":"","submitted":1349,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6508930061759306,"acs":7799,"articleLive":2,"columnArticles":193,"formTitle":"[1652]拆炸弹","frequency":0.4442975611,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","submitted":11982,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.5155358275206088,"acs":4065,"articleLive":2,"columnArticles":93,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":0.0,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","submitted":7885,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.2812586254485233,"acs":4076,"articleLive":2,"columnArticles":55,"formTitle":"[1654]到家的最少跳跃次数","frequency":1.4125900849,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","submitted":14492,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.37964512889186475,"acs":2268,"articleLive":2,"columnArticles":34,"formTitle":"[1655]分配重复整数","frequency":0.7864655007,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","submitted":5974,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.782297761679205,"acs":8423,"articleLive":2,"columnArticles":100,"formTitle":"[1656]设计有序流","frequency":0.0,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","submitted":10767,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.46538554313741254,"acs":5788,"articleLive":2,"columnArticles":83,"formTitle":"[1657]确定两个字符串是否接近","frequency":0.4442975611,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","submitted":12437,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.30668301655426117,"acs":10004,"articleLive":2,"columnArticles":161,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":1.0489221055,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","submitted":32620,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.406628242074928,"acs":1411,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":1.114219448,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","submitted":3470,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7417503586800573,"acs":517,"articleLive":2,"columnArticles":25,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"","submitted":697,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.7345971563981043,"acs":3100,"articleLive":2,"columnArticles":61,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":1.0182071603,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"","submitted":4220,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.812532081836181,"acs":22161,"articleLive":2,"columnArticles":317,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":0.0,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","submitted":27274,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5731958762886598,"acs":8062,"articleLive":2,"columnArticles":136,"formTitle":"[1663]具有给定数值的最小字符串","frequency":0.5299663557,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","submitted":14065,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.55,"acs":5687,"articleLive":2,"columnArticles":110,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","submitted":10340,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.6592995169082125,"acs":5459,"articleLive":2,"columnArticles":88,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":0.0,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","submitted":8280,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.711943793911007,"acs":304,"articleLive":2,"columnArticles":14,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","questionId":"1810","status":"","submitted":427,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.604440200525185,"acs":2532,"articleLive":2,"columnArticles":35,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"","submitted":4189,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.4452066842568162,"acs":7593,"articleLive":2,"columnArticles":143,"formTitle":"[1668]最大重复子字符串","frequency":0.4181180555,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","submitted":17055,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.753375902857741,"acs":14394,"articleLive":2,"columnArticles":267,"formTitle":"[1669]合并两个链表","frequency":0.0,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"ac","submitted":19106,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.527388397670908,"acs":4891,"articleLive":2,"columnArticles":86,"formTitle":"[1670]设计前中后队列","frequency":0.4716067405,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"ac","submitted":9274,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.46875,"acs":2220,"articleLive":2,"columnArticles":46,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":0.594008722,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","questionId":"1766","status":"","submitted":4736,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.8490083441653739,"acs":40496,"articleLive":2,"columnArticles":469,"formTitle":"[1672]最富有客户的资产总量","frequency":0.3688470065,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","submitted":47698,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.36121335757683265,"acs":8145,"articleLive":2,"columnArticles":178,"formTitle":"[1673]找出最具竞争力的子序列","frequency":0.0,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"ac","submitted":22549,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.3705562526139691,"acs":2658,"articleLive":2,"columnArticles":56,"formTitle":"[1674]使数组互补的最少操作次数","frequency":0.5612188992,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","submitted":7173,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.4339564817652467,"acs":2832,"articleLive":2,"columnArticles":47,"formTitle":"[1675]数组的最小偏移量","frequency":0.6647595781,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","submitted":6526,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.768790264853257,"acs":1074,"articleLive":2,"columnArticles":27,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":0.0,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","questionId":"1816","status":"","submitted":1397,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.37716484926234767,"acs":2352,"articleLive":2,"columnArticles":38,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"","submitted":6236,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.8280679616025959,"acs":18374,"articleLive":2,"columnArticles":302,"formTitle":"[1678]设计 Goal 解析器","frequency":0.4442975611,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","submitted":22189,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.49899705803690825,"acs":7463,"articleLive":2,"columnArticles":120,"formTitle":"[1679]K 和数对的最大数目","frequency":0.4181180555,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","submitted":14956,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.47102925596935863,"acs":5780,"articleLive":2,"columnArticles":74,"formTitle":"[1680]连接连续二进制数字","frequency":0.0,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","submitted":12271,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.3870315658529,"acs":2489,"articleLive":2,"columnArticles":50,"formTitle":"[1681]最小不兼容性","frequency":0.0,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","submitted":6431,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5025510204081632,"acs":394,"articleLive":2,"columnArticles":17,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"","submitted":784,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8983786252569079,"acs":3934,"articleLive":2,"columnArticles":42,"formTitle":"[1683]无效的推文","frequency":0.4442975611,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"","submitted":4379,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.8269358775238518,"acs":18635,"articleLive":2,"columnArticles":384,"formTitle":"[1684]统计一致字符串的数目","frequency":0.0,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","submitted":22535,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.6124436691379561,"acs":4213,"articleLive":2,"columnArticles":94,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","questionId":"1787","status":"","submitted":6879,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.47635244574020086,"acs":2941,"articleLive":2,"columnArticles":51,"formTitle":"[1686]石子游戏 VI","frequency":0.0,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","submitted":6174,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.39895405304445275,"acs":1068,"articleLive":2,"columnArticles":26,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","submitted":2677,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.8068718573822947,"acs":21182,"articleLive":2,"columnArticles":281,"formTitle":"[1688]比赛中的配对次数","frequency":1.0182071603,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","submitted":26252,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8652344831404684,"acs":15627,"articleLive":2,"columnArticles":207,"formTitle":"[1689]十-二进制数的最少数目","frequency":0.0,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","questionId":"1807","status":"","submitted":18061,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5226045883940621,"acs":4647,"articleLive":2,"columnArticles":109,"formTitle":"[1690]石子游戏 VII","frequency":0.6284711262,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","submitted":8892,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.4932898773006135,"acs":2573,"articleLive":2,"columnArticles":63,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","submitted":5216,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.6091954022988506,"acs":212,"articleLive":2,"columnArticles":13,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"","submitted":348,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.8051867860450757,"acs":2608,"articleLive":2,"columnArticles":36,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"","submitted":3239,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.637157298207995,"acs":8320,"articleLive":2,"columnArticles":144,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","submitted":13058,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.47220569766673276,"acs":7144,"articleLive":2,"columnArticles":144,"formTitle":"[1695]删除子数组的最大得分","frequency":0.4181180555,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","submitted":15129,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.3955249569707401,"acs":6894,"articleLive":2,"columnArticles":122,"formTitle":"[1696]跳跃游戏 VI","frequency":0.4716067405,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","submitted":17430,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.5314076111875287,"acs":2318,"articleLive":2,"columnArticles":46,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","submitted":4362,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5168949771689497,"acs":566,"articleLive":2,"columnArticles":18,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.7864655007,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","questionId":"1838","status":"","submitted":1095,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.8016284233900814,"acs":2166,"articleLive":2,"columnArticles":45,"formTitle":"[1699]两人之间的通话次数","frequency":0.4716067405,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"","submitted":2702,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7039793662490789,"acs":9553,"articleLive":2,"columnArticles":198,"formTitle":"[1700]无法吃午餐的学生数量","frequency":0.4442975611,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","submitted":13570,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6147776183644189,"acs":4285,"articleLive":2,"columnArticles":86,"formTitle":"[1701]平均等待时间","frequency":0.4442975611,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","submitted":6970,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.4796625489605303,"acs":3184,"articleLive":2,"columnArticles":68,"formTitle":"[1702]修改后的最大二进制字符串","frequency":0.0,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","submitted":6638,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.388647474198805,"acs":1431,"articleLive":2,"columnArticles":25,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.8320938533,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","submitted":3682,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.780336104299982,"acs":13048,"articleLive":2,"columnArticles":203,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","submitted":16721,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.45279532079804796,"acs":25237,"articleLive":2,"columnArticles":341,"formTitle":"[1705]吃苹果的最大数目","frequency":0.8089232152,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"ac","submitted":55736,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5936675461741425,"acs":4725,"articleLive":2,"columnArticles":119,"formTitle":"[1706]球会落何处","frequency":0.0,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","submitted":7959,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5032886723507917,"acs":14462,"articleLive":2,"columnArticles":152,"formTitle":"[1707]与数组中元素的最大异或值","frequency":0.0,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","submitted":28735,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.690978886756238,"acs":1080,"articleLive":2,"columnArticles":27,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"","submitted":1563,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.7183741186229781,"acs":1732,"articleLive":2,"columnArticles":43,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.4442975611,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"","submitted":2411,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.6960234854550307,"acs":13040,"articleLive":2,"columnArticles":203,"formTitle":"[1710]卡车上的最大单元数","frequency":0.4442975611,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"ac","submitted":18735,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.3588845258529474,"acs":30526,"articleLive":2,"columnArticles":365,"formTitle":"[1711]大餐计数","frequency":2.5903413307,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"ac","submitted":85058,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.265262686232777,"acs":7104,"articleLive":2,"columnArticles":107,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.4716067405,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","submitted":26781,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.49434511821026866,"acs":15954,"articleLive":2,"columnArticles":173,"formTitle":"[1713]得到子序列的最少操作次数","frequency":2.602439228,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"ac","submitted":32273,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.6062639821029083,"acs":271,"articleLive":2,"columnArticles":10,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","questionId":"1809","status":"","submitted":447,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.7257203842049093,"acs":2040,"articleLive":2,"columnArticles":39,"formTitle":"[1715]苹果和橘子的个数","frequency":0.0,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"","submitted":2811,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6686046511627907,"acs":9085,"articleLive":2,"columnArticles":201,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","submitted":13588,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.44051976573938506,"acs":2407,"articleLive":2,"columnArticles":54,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.6284711262,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","submitted":5464,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.4983035512327528,"acs":2203,"articleLive":2,"columnArticles":52,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.594008722,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","submitted":4421,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.3764772087788407,"acs":669,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","questionId":"1820","status":"","submitted":1777,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.8686147383800567,"acs":47561,"articleLive":2,"columnArticles":501,"formTitle":"[1720]解码异或后的数组","frequency":0.4181180555,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"ac","submitted":54755,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6445921892995498,"acs":12313,"articleLive":2,"columnArticles":191,"formTitle":"[1721]交换链表中的节点","frequency":1.0182071603,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"ac","submitted":19102,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5164501257334451,"acs":4929,"articleLive":2,"columnArticles":119,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","submitted":9544,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5051782932682187,"acs":23999,"articleLive":2,"columnArticles":180,"formTitle":"[1723]完成所有工作的最短时间","frequency":1.5167303442,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"ac","submitted":47506,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5568181818181818,"acs":392,"articleLive":2,"columnArticles":14,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","questionId":"1865","status":"","submitted":704,"title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.7890528057355577,"acs":11446,"articleLive":2,"columnArticles":156,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":0.0,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","questionId":"1843","status":"","submitted":14506,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.4898868983736481,"acs":5934,"articleLive":2,"columnArticles":115,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","submitted":12113,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.5776847528578328,"acs":3588,"articleLive":2,"columnArticles":84,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":0.594008722,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","submitted":6211,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.3650015323322096,"acs":1191,"articleLive":2,"columnArticles":26,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","submitted":3263,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.6241806263656228,"acs":2571,"articleLive":2,"columnArticles":25,"formTitle":"[1729]求关注者的数量","frequency":0.0,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"","submitted":4119,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.525279054497702,"acs":800,"articleLive":2,"columnArticles":25,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"","submitted":1523,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.46278726544381193,"acs":2195,"articleLive":2,"columnArticles":33,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","questionId":"1882","status":"","submitted":4743,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.7892430518038298,"acs":13148,"articleLive":2,"columnArticles":223,"formTitle":"[1732]找到最高海拔","frequency":0.4442975611,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","submitted":16659,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.4662638469284995,"acs":2315,"articleLive":2,"columnArticles":57,"formTitle":"[1733]需要教语言的最少人数","frequency":0.0,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","submitted":4965,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7233928022147031,"acs":28221,"articleLive":2,"columnArticles":370,"formTitle":"[1734]解码异或后的排列","frequency":0.5001312072,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"ac","submitted":39012,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.4902139280837506,"acs":1077,"articleLive":2,"columnArticles":26,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","submitted":2197,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.4484355828220859,"acs":29238,"articleLive":2,"columnArticles":358,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":1.8886727603,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"ac","submitted":65200,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.3263516804676084,"acs":4020,"articleLive":2,"columnArticles":107,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":0.0,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","questionId":"1859","status":"","submitted":12318,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6537520391517129,"acs":28854,"articleLive":2,"columnArticles":393,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":0.0,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"ac","submitted":44136,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.47525083612040137,"acs":2842,"articleLive":2,"columnArticles":62,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","submitted":5980,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.6538152610441768,"acs":814,"articleLive":2,"columnArticles":26,"formTitle":"[1740]找到二叉树中的距离","frequency":0.7864655007,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"","submitted":1245,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8407599309153714,"acs":2434,"articleLive":2,"columnArticles":33,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","questionId":"1892","status":"","submitted":2895,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7107020813917365,"acs":9151,"articleLive":2,"columnArticles":137,"formTitle":"[1742]盒子中小球的最大数量","frequency":0.0,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","submitted":12876,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6965823754789272,"acs":22726,"articleLive":2,"columnArticles":332,"formTitle":"[1743]从相邻元素对还原数组","frequency":2.4482885482,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"ac","submitted":32625,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.36266440067472444,"acs":28595,"articleLive":2,"columnArticles":369,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗?","frequency":0.0,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","questionId":"1872","status":"ac","submitted":78847,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗?","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.4851564589462423,"acs":3628,"articleLive":2,"columnArticles":76,"formTitle":"[1745]回文串分割 IV","frequency":0.4716067405,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","submitted":7478,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.5731930466605673,"acs":1253,"articleLive":2,"columnArticles":48,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":1.114219448,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"","submitted":2186,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.6972076788830716,"acs":1598,"articleLive":2,"columnArticles":37,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"","submitted":2292,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.74378223495702,"acs":12979,"articleLive":2,"columnArticles":251,"formTitle":"[1748]唯一元素的和","frequency":0.0,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","submitted":17450,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5369736842105263,"acs":4081,"articleLive":2,"columnArticles":94,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":0.0,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","submitted":7600,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.4535937699476573,"acs":3553,"articleLive":2,"columnArticles":82,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","questionId":"1850","status":"","submitted":7833,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.4781772736012305,"acs":2487,"articleLive":2,"columnArticles":36,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":0.7030490946,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","questionId":"1851","status":"","submitted":5201,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.6693187136457845,"acs":10011,"articleLive":2,"columnArticles":119,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":0.4442975611,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","submitted":14957,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6297651135926069,"acs":6542,"articleLive":2,"columnArticles":136,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","submitted":10388,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.42422802850356295,"acs":4465,"articleLive":2,"columnArticles":93,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":0.594008722,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","submitted":10525,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.4189916789035732,"acs":3424,"articleLive":2,"columnArticles":58,"formTitle":"[1755]最接近目标值的子序列和","frequency":1.2634159152,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","submitted":8172,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.7854077253218884,"acs":549,"articleLive":2,"columnArticles":18,"formTitle":"[1756]设计最近使用(MRU)队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"","submitted":699,"title":"设计最近使用(MRU)队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9228556485355649,"acs":3529,"articleLive":2,"columnArticles":37,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"","submitted":3824,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6436638432154127,"acs":7751,"articleLive":2,"columnArticles":119,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","submitted":12042,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.4350322409681124,"acs":4925,"articleLive":2,"columnArticles":103,"formTitle":"[1759]统计同构子字符串的数目","frequency":0.0,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","submitted":11321,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5465591915303176,"acs":4543,"articleLive":2,"columnArticles":80,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","submitted":8312,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.43928908461780436,"acs":2793,"articleLive":2,"columnArticles":43,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":0.8807415775,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","questionId":"1887","status":"","submitted":6358,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.7283511269276394,"acs":1228,"articleLive":2,"columnArticles":25,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"","submitted":1686,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.5883490452018371,"acs":4868,"articleLive":2,"columnArticles":90,"formTitle":"[1763]最长的美好子字符串","frequency":0.4716067405,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","submitted":8274,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.4753574115876599,"acs":2527,"articleLive":2,"columnArticles":62,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.594008722,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","questionId":"1874","status":"","submitted":5316,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5471044610695484,"acs":3949,"articleLive":2,"columnArticles":90,"formTitle":"[1765]地图中的最高点","frequency":1.0808941382,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","submitted":7218,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.37989523571963085,"acs":1523,"articleLive":2,"columnArticles":29,"formTitle":"[1766]互质树","frequency":1.3964137374,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","submitted":4009,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7941176470588235,"acs":1026,"articleLive":2,"columnArticles":25,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","questionId":"1914","status":"","submitted":1292,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7597177371127856,"acs":12704,"articleLive":2,"columnArticles":225,"formTitle":"[1768]交替合并字符串","frequency":0.3929911054,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","submitted":16722,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8547721137049389,"acs":10765,"articleLive":2,"columnArticles":188,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":0.0,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","questionId":"1895","status":"","submitted":12594,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.3735637075495787,"acs":4389,"articleLive":2,"columnArticles":110,"formTitle":"[1770]执行乘法运算的最大分数","frequency":0.0,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","submitted":11749,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.36746440472584063,"acs":2426,"articleLive":2,"columnArticles":48,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","submitted":6602,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.49440715883668906,"acs":442,"articleLive":2,"columnArticles":13,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"","submitted":894,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8431603773584906,"acs":17160,"articleLive":2,"columnArticles":213,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":0.0,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","submitted":20352,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5452362576108396,"acs":6358,"articleLive":2,"columnArticles":93,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":0.0,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","submitted":11661,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.4766217354675653,"acs":4526,"articleLive":2,"columnArticles":98,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":0.0,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","questionId":"1901","status":"","submitted":9496,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.4617041646720919,"acs":1929,"articleLive":2,"columnArticles":46,"formTitle":"[1776]车队 II","frequency":0.9327824556,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","submitted":4178,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.7863582908663269,"acs":6018,"articleLive":2,"columnArticles":65,"formTitle":"[1777]每家商店的产品价格","frequency":1.0182071603,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"","submitted":7653,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5035128805620609,"acs":215,"articleLive":2,"columnArticles":10,"formTitle":"[1778]未知网格中的最短路径","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","questionId":"1931","status":"","submitted":427,"title":"未知网格中的最短路径","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.645883969142978,"acs":6112,"articleLive":2,"columnArticles":76,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":0.4442975611,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","questionId":"1888","status":"","submitted":9463,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.669219827114564,"acs":6116,"articleLive":2,"columnArticles":118,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","questionId":"1889","status":"","submitted":9139,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5264437689969604,"acs":4330,"articleLive":2,"columnArticles":62,"formTitle":"[1781]所有子字符串美丽值之和","frequency":0.7030490946,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","submitted":8225,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.2976078799249531,"acs":1269,"articleLive":2,"columnArticles":36,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","submitted":4264,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7977407208176439,"acs":1483,"articleLive":2,"columnArticles":34,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"","submitted":1859,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.42330210772833726,"acs":9399,"articleLive":2,"columnArticles":111,"formTitle":"[1784]检查二进制字符串字段","frequency":0.0,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","questionId":"1910","status":"","submitted":22204,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.3536095550153261,"acs":6691,"articleLive":2,"columnArticles":68,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","questionId":"1911","status":"","submitted":18922,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.3433876896974267,"acs":3643,"articleLive":2,"columnArticles":94,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.5001312072,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","questionId":"1912","status":"","submitted":10609,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.6527143721467467,"acs":11867,"articleLive":2,"columnArticles":61,"formTitle":"[1787]使所有区间的异或结果为零","frequency":1.1853732082,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","questionId":"1913","status":"ac","submitted":18181,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.6208425720620843,"acs":280,"articleLive":2,"columnArticles":19,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"","submitted":451,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7149090909090909,"acs":1966,"articleLive":2,"columnArticles":35,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"","submitted":2750,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6344472773629576,"acs":13935,"articleLive":2,"columnArticles":161,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":0.0,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","questionId":"1915","status":"","submitted":21964,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8095442512699434,"acs":11315,"articleLive":2,"columnArticles":156,"formTitle":"[1791]找出星型图的中心节点","frequency":0.0,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","questionId":"1916","status":"","submitted":13977,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.513118664281455,"acs":6884,"articleLive":2,"columnArticles":110,"formTitle":"[1792]最大平均通过率","frequency":1.9231446693,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","submitted":13416,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.41945659916556427,"acs":4122,"articleLive":2,"columnArticles":100,"formTitle":"[1793]好子数组的最大分数","frequency":0.0,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","submitted":9827,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.5525,"acs":221,"articleLive":2,"columnArticles":9,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","questionId":"1943","status":"","submitted":400,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7867445054945055,"acs":2291,"articleLive":2,"columnArticles":32,"formTitle":"[1795]每个产品在不同商店的价格","frequency":0.4442975611,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"","submitted":2912,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.4920105242892896,"acs":7667,"articleLive":2,"columnArticles":139,"formTitle":"[1796]字符串中第二大的数字","frequency":0.0,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"ac","submitted":15583,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.5693135935397039,"acs":5499,"articleLive":2,"columnArticles":85,"formTitle":"[1797]设计一个验证系统","frequency":1.0489221055,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"ac","submitted":9659,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5268936982813495,"acs":3311,"articleLive":2,"columnArticles":52,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":1.0808941382,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","questionId":"1930","status":"","submitted":6284,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5156765676567657,"acs":2500,"articleLive":2,"columnArticles":34,"formTitle":"[1799]N 次操作后的最大分数和","frequency":1.3496762595,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","submitted":4848,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6804901644630764,"acs":10551,"articleLive":2,"columnArticles":177,"formTitle":"[1800]最大升序子数组和","frequency":0.0,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"ac","submitted":15505,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.38382963988919666,"acs":4434,"articleLive":2,"columnArticles":116,"formTitle":"[1801]积压订单中的订单总数","frequency":0.5001312072,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"notac","submitted":11552,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.2644771476429768,"acs":4421,"articleLive":2,"columnArticles":110,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","questionId":"1929","status":"","submitted":16716,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.40861208649048236,"acs":2211,"articleLive":2,"columnArticles":55,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":0.0,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"ac","submitted":5411,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5798548094373865,"acs":639,"articleLive":2,"columnArticles":37,"formTitle":"[1804]实现 Trie (前缀树) II","frequency":0.7030490946,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"","submitted":1102,"title":"实现 Trie (前缀树) II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.4764171526042286,"acs":12010,"articleLive":2,"columnArticles":164,"formTitle":"[1805]字符串中不同整数的数目","frequency":0.0,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","submitted":25209,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.662608695652174,"acs":5334,"articleLive":2,"columnArticles":83,"formTitle":"[1806]还原排列的最少操作步数","frequency":0.0,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","questionId":"1935","status":"","submitted":8050,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5858664085188771,"acs":6052,"articleLive":2,"columnArticles":93,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","submitted":10330,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.26896624695799387,"acs":2542,"articleLive":2,"columnArticles":48,"formTitle":"[1808]好因子的最大数目","frequency":0.0,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","submitted":9451,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6258581235697941,"acs":2188,"articleLive":2,"columnArticles":36,"formTitle":"[1809]没有广告的剧集","frequency":0.4716067405,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"","submitted":3496,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.615819209039548,"acs":218,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":0.0,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","questionId":"1959","status":"","submitted":354,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6599888703394546,"acs":1186,"articleLive":2,"columnArticles":33,"formTitle":"[1811]寻找面试候选人","frequency":0.5299663557,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"","submitted":1797,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7923654786862334,"acs":9071,"articleLive":2,"columnArticles":223,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.4181180555,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"ac","submitted":11448,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5008517887563884,"acs":5586,"articleLive":2,"columnArticles":85,"formTitle":"[1813]句子相似性 III","frequency":1.114219448,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"ac","submitted":11153,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.3510667271901952,"acs":3867,"articleLive":2,"columnArticles":89,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":0.0,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"ac","submitted":11015,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.2945673389720234,"acs":1811,"articleLive":2,"columnArticles":40,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","submitted":6148,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.7348541163352537,"acs":47451,"articleLive":2,"columnArticles":645,"formTitle":"[1816]截断句子","frequency":0.8253985953,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"ac","submitted":64572,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6975551189696573,"acs":6391,"articleLive":2,"columnArticles":107,"formTitle":"[1817]查找用户活跃分钟数","frequency":0.5001312072,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"ac","submitted":9162,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.37170782766132,"acs":26279,"articleLive":2,"columnArticles":342,"formTitle":"[1818]绝对差值和","frequency":2.5549469226,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"ac","submitted":70698,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.38064708513493367,"acs":2553,"articleLive":2,"columnArticles":35,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.7864655007,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","submitted":6707,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.4575757575757576,"acs":151,"articleLive":2,"columnArticles":10,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"","submitted":330,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.9012728966159578,"acs":2903,"articleLive":2,"columnArticles":25,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":0.0,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","questionId":"1974","status":"","submitted":3221,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8025928996758875,"acs":21296,"articleLive":2,"columnArticles":215,"formTitle":"[1822]数组元素积的符号","frequency":0.0,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","submitted":26534,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7226143421795596,"acs":10238,"articleLive":2,"columnArticles":132,"formTitle":"[1823]找出游戏的获胜者","frequency":1.6786996721,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","submitted":14168,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6493243789950643,"acs":8025,"articleLive":2,"columnArticles":160,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","submitted":12359,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.2856699751861042,"acs":2763,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":0.0,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","submitted":9672,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.42606516290726815,"acs":340,"articleLive":2,"columnArticles":24,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"","submitted":798,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7920806232578086,"acs":11082,"articleLive":2,"columnArticles":156,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"ac","submitted":13991,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.8656625897098958,"acs":8564,"articleLive":2,"columnArticles":109,"formTitle":"[1828]统计一个圆中点的数目","frequency":0.0,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","questionId":"1939","status":"ac","submitted":9893,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.6909061593034505,"acs":4285,"articleLive":2,"columnArticles":88,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"ac","submitted":6202,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.4915346805024577,"acs":900,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","questionId":"1941","status":"ac","submitted":1831,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.7428010471204188,"acs":1135,"articleLive":2,"columnArticles":29,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"","submitted":1528,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8226590106007067,"acs":14900,"articleLive":2,"columnArticles":235,"formTitle":"[1832]判断句子是否为全字母句","frequency":0.0,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"ac","submitted":18112,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6828792279440014,"acs":44437,"articleLive":2,"columnArticles":394,"formTitle":"[1833]雪糕的最大数量","frequency":0.0,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"ac","submitted":65073,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.35552703353120485,"acs":6648,"articleLive":2,"columnArticles":138,"formTitle":"[1834]单线程 CPU","frequency":0.594008722,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","submitted":18699,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5154794520547945,"acs":3763,"articleLive":2,"columnArticles":63,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":0.6647595781,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","questionId":"1963","status":"","submitted":7300,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.735969387755102,"acs":577,"articleLive":2,"columnArticles":33,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":0.6647595781,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","questionId":"1982","status":"","submitted":784,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7954042081949059,"acs":8619,"articleLive":2,"columnArticles":105,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":0.4442975611,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"ac","submitted":10836,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.42873437032178957,"acs":30071,"articleLive":2,"columnArticles":314,"formTitle":"[1838]最高频元素的频数","frequency":3.2196637891,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"ac","submitted":70139,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5648522048134389,"acs":6994,"articleLive":2,"columnArticles":135,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"ac","submitted":12382,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.3900112233445567,"acs":2085,"articleLive":2,"columnArticles":48,"formTitle":"[1840]最高建筑高度","frequency":0.0,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"ac","submitted":5346,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5280312907431551,"acs":1215,"articleLive":2,"columnArticles":39,"formTitle":"[1841]联赛信息统计","frequency":0.0,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"","submitted":2301,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.6431924882629108,"acs":137,"articleLive":2,"columnArticles":15,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"","submitted":213,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.515531660692951,"acs":863,"articleLive":2,"columnArticles":28,"formTitle":"[1843]可疑银行账户","frequency":0.0,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","questionId":"1998","status":"","submitted":1674,"title":"可疑银行账户","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.7989775051124745,"acs":7814,"articleLive":2,"columnArticles":131,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","questionId":"1954","status":"","submitted":9780,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.5067350022997569,"acs":7712,"articleLive":2,"columnArticles":74,"formTitle":"[1845]座位预约管理系统","frequency":0.4442975611,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","questionId":"1955","status":"","submitted":15219,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.6329639576609718,"acs":28046,"articleLive":2,"columnArticles":379,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":2.1436281392,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","questionId":"1956","status":"ac","submitted":44309,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.3638073195428902,"acs":2515,"articleLive":2,"columnArticles":48,"formTitle":"[1847]最近的房间","frequency":0.7864655007,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1957","status":"","submitted":6913,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6809294871794872,"acs":8498,"articleLive":2,"columnArticles":108,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","questionId":"1975","status":"","submitted":12480,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.3283699059561129,"acs":5866,"articleLive":2,"columnArticles":114,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":0.6284711262,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","questionId":"1976","status":"","submitted":17864,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.611405197305101,"acs":2541,"articleLive":2,"columnArticles":52,"formTitle":"[1850]邻位交换的最小次数","frequency":0.6647595781,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","questionId":"1978","status":"","submitted":4156,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.4048152295632699,"acs":2169,"articleLive":2,"columnArticles":53,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.743540456,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","questionId":"1977","status":"","submitted":5358,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.5468549422336328,"acs":426,"articleLive":2,"columnArticles":13,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","questionId":"2003","status":"","submitted":779,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6407678244972578,"acs":1402,"articleLive":2,"columnArticles":21,"formTitle":"[1853]转换日期格式","frequency":0.0,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","questionId":"2004","status":"","submitted":2188,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7734461880637588,"acs":12519,"articleLive":2,"columnArticles":133,"formTitle":"[1854]人口最多的年份","frequency":1.3805429075,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","questionId":"1983","status":"ac","submitted":16186,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.668119363234671,"acs":11038,"articleLive":2,"columnArticles":108,"formTitle":"[1855]下标对中的最大距离","frequency":0.0,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","questionId":"1984","status":"notac","submitted":16521,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.35650094216553124,"acs":4919,"articleLive":2,"columnArticles":85,"formTitle":"[1856]子数组最小乘积的最大值","frequency":0.4442975611,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","questionId":"1985","status":"ac","submitted":13798,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.4575300629891201,"acs":2397,"articleLive":2,"columnArticles":35,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","questionId":"1986","status":"","submitted":5239,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.6207865168539326,"acs":442,"articleLive":2,"columnArticles":25,"formTitle":"[1858]包含所有前缀的最长单词","frequency":0.0,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","questionId":"2009","status":"","submitted":712,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7653169183418294,"acs":7957,"articleLive":2,"columnArticles":160,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","questionId":"1970","status":"ac","submitted":10397,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.7692172692172692,"acs":4383,"articleLive":2,"columnArticles":79,"formTitle":"[1860]增长的内存泄露","frequency":0.0,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","questionId":"1971","status":"ac","submitted":5698,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6215802888700085,"acs":3658,"articleLive":2,"columnArticles":73,"formTitle":"[1861]旋转盒子","frequency":0.0,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","questionId":"1972","status":"notac","submitted":5885,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.316288877174486,"acs":2400,"articleLive":2,"columnArticles":45,"formTitle":"[1862]向下取整数对和","frequency":0.743540456,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","questionId":"1326","status":"notac","submitted":7588,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.8869364017259709,"acs":14183,"articleLive":2,"columnArticles":166,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":0.988662914,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","questionId":"1993","status":"","submitted":15991,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.39105290015308725,"acs":4598,"articleLive":2,"columnArticles":112,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":0.743540456,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","questionId":"1994","status":"ac","submitted":11758,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.509543035419343,"acs":5553,"articleLive":2,"columnArticles":67,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.5612188992,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","questionId":"1995","status":"ac","submitted":10898,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.6043928300934107,"acs":2394,"articleLive":2,"columnArticles":51,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":1.8774694166,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","questionId":"1996","status":"","submitted":3961,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7549450549450549,"acs":687,"articleLive":2,"columnArticles":18,"formTitle":"[1867]最大数量高于平均水平的订单","frequency":1.2234585423,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","questionId":"2014","status":"","submitted":910,"title":"最大数量高于平均水平的订单","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5118577075098815,"acs":518,"articleLive":2,"columnArticles":22,"formTitle":"[1868]两个行程编码数组的积","frequency":0.0,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","questionId":"2019","status":"","submitted":1012,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.7729701775555938,"acs":13452,"articleLive":2,"columnArticles":160,"formTitle":"[1869]哪种连续子字符串更长","frequency":0.3929911054,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","questionId":"1999","status":"ac","submitted":17403,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.44954599965735825,"acs":7872,"articleLive":2,"columnArticles":76,"formTitle":"[1870]准时到达的列车最小时速","frequency":0.4442975611,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","questionId":"2000","status":"notac","submitted":17511,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.27596966413867824,"acs":6368,"articleLive":2,"columnArticles":132,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","questionId":"2001","status":"notac","submitted":23075,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.615851974592654,"acs":2230,"articleLive":2,"columnArticles":32,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","questionId":"2002","status":"","submitted":3621,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.8193887002161161,"acs":2654,"articleLive":2,"columnArticles":37,"formTitle":"[1873]计算特殊奖金","frequency":0.0,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","questionId":"2024","status":"","submitted":3239,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.840867992766727,"acs":465,"articleLive":2,"columnArticles":24,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","questionId":"2029","status":"","submitted":553,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.7272727272727273,"acs":616,"articleLive":2,"columnArticles":24,"formTitle":"[1875]将工资相同的雇员分组","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","questionId":"2030","status":"","submitted":847,"title":"将工资相同的雇员分组","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7248573115528439,"acs":7366,"articleLive":2,"columnArticles":121,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","questionId":"1987","status":"ac","submitted":10162,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8181448228501665,"acs":32167,"articleLive":2,"columnArticles":412,"formTitle":"[1877]数组中最大数对和的最小值","frequency":2.8492153347,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","questionId":"1988","status":"ac","submitted":39317,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.43410261300781994,"acs":2276,"articleLive":2,"columnArticles":58,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","questionId":"1990","status":"ac","submitted":5243,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.41806505075616324,"acs":2018,"articleLive":2,"columnArticles":40,"formTitle":"[1879]两个数组最小的异或值之和","frequency":0.0,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","questionId":"1989","status":"","submitted":4827,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.770006598171364,"acs":8169,"articleLive":2,"columnArticles":115,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":0.0,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","questionId":"2010","status":"ac","submitted":10609,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.35686643078283947,"acs":6455,"articleLive":2,"columnArticles":68,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","questionId":"2011","status":"ac","submitted":18088,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.28235882058970513,"acs":3955,"articleLive":2,"columnArticles":119,"formTitle":"[1882]使用服务器处理任务","frequency":0.5299663557,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","questionId":"2012","status":"notac","submitted":14007,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.3817427385892116,"acs":1840,"articleLive":2,"columnArticles":31,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.9327824556,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","questionId":"2013","status":"","submitted":4820,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.6946206896551724,"acs":2518,"articleLive":2,"columnArticles":46,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":2.112207242,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","questionId":"2031","status":"","submitted":3625,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5090152565880721,"acs":367,"articleLive":2,"columnArticles":18,"formTitle":"[1885]统计数对","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","questionId":"2036","status":"","submitted":721,"title":"统计数对","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.572209745142076,"acs":5860,"articleLive":2,"columnArticles":89,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":0.3929911054,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","questionId":"2015","status":"","submitted":10241,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.6475651456196203,"acs":5492,"articleLive":2,"columnArticles":73,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":0.5001312072,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","questionId":"2016","status":"","submitted":8481,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.3239389920424403,"acs":2931,"articleLive":2,"columnArticles":69,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":0.0,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","questionId":"2017","status":"","submitted":9048,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.2731689973927471,"acs":2305,"articleLive":2,"columnArticles":44,"formTitle":"[1889]装包裹的最小浪费空间","frequency":0.743540456,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","questionId":"2018","status":"","submitted":8438,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.732508073196986,"acs":1361,"articleLive":2,"columnArticles":23,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","questionId":"2041","status":"","submitted":1858,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.39165357080495894,"acs":2243,"articleLive":2,"columnArticles":25,"formTitle":"[1891]割绳子","frequency":0.5001312072,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"2045","status":"","submitted":5727,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.3600189483657035,"acs":760,"articleLive":2,"columnArticles":18,"formTitle":"[1892]页面推荐Ⅱ","frequency":0.0,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","questionId":"2046","status":"","submitted":2111,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5909190133158699,"acs":32484,"articleLive":2,"columnArticles":427,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":2.1436281392,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","questionId":"2005","status":"ac","submitted":54972,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.4575379093547882,"acs":37988,"articleLive":2,"columnArticles":523,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":2.0286164134,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","questionId":"2006","status":"ac","submitted":83027,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5387065164135227,"acs":2199,"articleLive":2,"columnArticles":42,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","questionId":"1311","status":"notac","submitted":4082,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5077010838562465,"acs":890,"articleLive":2,"columnArticles":31,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","questionId":"2008","status":"","submitted":1753,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.537276457381745,"acs":6940,"articleLive":2,"columnArticles":92,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":0.4442975611,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","questionId":"2025","status":"ac","submitted":12917,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.3140203449800973,"acs":4260,"articleLive":2,"columnArticles":63,"formTitle":"[1898]可移除字符的最大数目","frequency":0.6647595781,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","questionId":"2027","status":"notac","submitted":13566,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6340678783979411,"acs":3942,"articleLive":2,"columnArticles":45,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","questionId":"2026","status":"","submitted":6217,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.44203612479474547,"acs":1346,"articleLive":2,"columnArticles":37,"formTitle":"[1900]最佳运动员的比拼回合","frequency":1.1853732082,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","questionId":"2028","status":"","submitted":3045,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6157598499061914,"acs":1641,"articleLive":2,"columnArticles":48,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","questionId":"2047","status":"","submitted":2665,"title":"找出顶峰元素 II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.4529616724738676,"acs":130,"articleLive":2,"columnArticles":5,"formTitle":"[1902]给定二叉搜索树的插入顺序求深度","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","questionId":"2052","status":"","submitted":287,"title":"给定二叉搜索树的插入顺序求深度","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6375336290263942,"acs":8768,"articleLive":2,"columnArticles":113,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","questionId":"2032","status":"","submitted":13753,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.2877351503480966,"acs":3885,"articleLive":2,"columnArticles":76,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","questionId":"2033","status":"","submitted":13502,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.5974596058653218,"acs":6397,"articleLive":2,"columnArticles":139,"formTitle":"[1905]统计子岛屿","frequency":1.3805429075,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","questionId":"2035","status":"","submitted":10707,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.42342485319790507,"acs":2668,"articleLive":2,"columnArticles":57,"formTitle":"[1906]查询差绝对值的最小值","frequency":0.6284711262,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","questionId":"2034","status":"","submitted":6301,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.5906821963394343,"acs":710,"articleLive":2,"columnArticles":25,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","questionId":"2057","status":"","submitted":1202,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.6136986301369863,"acs":224,"articleLive":2,"columnArticles":11,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","questionId":"2062","status":"","submitted":365,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.3199976115125097,"acs":5359,"articleLive":2,"columnArticles":81,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":0.4442975611,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","questionId":"2020","status":"ac","submitted":16747,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.672273024167211,"acs":4117,"articleLive":2,"columnArticles":70,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.4716067405,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","questionId":"2021","status":"ac","submitted":6124,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.5663612178539758,"acs":3832,"articleLive":2,"columnArticles":79,"formTitle":"[1911]最大子序列交替和","frequency":1.3805429075,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","questionId":"2022","status":"notac","submitted":6766,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.2499702274621889,"acs":2099,"articleLive":2,"columnArticles":49,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","questionId":"2023","status":"","submitted":8397,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.832070069058447,"acs":9880,"articleLive":2,"columnArticles":117,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":0.988662914,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","questionId":"2042","status":"ac","submitted":11874,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.4451883943809899,"acs":3391,"articleLive":2,"columnArticles":74,"formTitle":"[1914]循环轮转矩阵","frequency":1.4459042916,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","questionId":"2043","status":"","submitted":7617,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.3962018730489074,"acs":3046,"articleLive":2,"columnArticles":61,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","questionId":"2044","status":"notac","submitted":7688,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5496083550913838,"acs":1263,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":0.0,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","questionId":"1313","status":"","submitted":2298,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.37284234752589185,"acs":648,"articleLive":2,"columnArticles":12,"formTitle":"[1917]Leetcodify 好友推荐","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","questionId":"2063","status":"","submitted":1738,"title":"Leetcodify 好友推荐","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.5055555555555555,"acs":273,"articleLive":2,"columnArticles":6,"formTitle":"[1918]第 K 小的子数组和·","frequency":1.114219448,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","questionId":"2069","status":"","submitted":540,"title":"第 K 小的子数组和·","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.3981841763942931,"acs":614,"articleLive":2,"columnArticles":21,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","questionId":"2064","status":"","submitted":1542,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.8931914112681226,"acs":14601,"articleLive":2,"columnArticles":128,"formTitle":"[1920]基于排列构建数组","frequency":2.1436281392,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","questionId":"2048","status":"ac","submitted":16347,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.34869004672068127,"acs":5896,"articleLive":2,"columnArticles":96,"formTitle":"[1921]消灭怪物的最大数量","frequency":0.5001312072,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","questionId":"2049","status":"ac","submitted":16909,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.36263173302107726,"acs":4955,"articleLive":2,"columnArticles":81,"formTitle":"[1922]统计好数字的数目","frequency":0.5001312072,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","questionId":"2050","status":"","submitted":13664,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.24189009035698414,"acs":1633,"articleLive":2,"columnArticles":34,"formTitle":"[1923]最长公共子路径","frequency":1.4459042916,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","questionId":"2051","status":"","submitted":6751,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.3568075117370892,"acs":76,"articleLive":2,"columnArticles":6,"formTitle":"[1924]安装栅栏 II","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","questionId":"2074","status":"","submitted":213,"title":"安装栅栏 II","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6913698302653598,"acs":5784,"articleLive":2,"columnArticles":74,"formTitle":"[1925]统计平方和三元组的数目","frequency":1.6459420757,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","questionId":"2037","status":"ac","submitted":8366,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.3476896990250106,"acs":4101,"articleLive":2,"columnArticles":69,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","questionId":"2038","status":"notac","submitted":11795,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.4137497380004192,"acs":1974,"articleLive":2,"columnArticles":38,"formTitle":"[1927]求和游戏","frequency":0.5001312072,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","questionId":"2039","status":"notac","submitted":4771,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.40973091364205255,"acs":2619,"articleLive":2,"columnArticles":46,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":2.2936786261,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","questionId":"2040","status":"notac","submitted":6392,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.8919374374637948,"acs":16937,"articleLive":2,"columnArticles":146,"formTitle":"[1929]数组串联","frequency":1.3496762595,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","questionId":"2058","status":"","submitted":18989,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.48487618414492273,"acs":5835,"articleLive":2,"columnArticles":106,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":1.114219448,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","questionId":"2059","status":"","submitted":12034,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5654668753260302,"acs":2168,"articleLive":2,"columnArticles":66,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":0.6647595781,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","questionId":"2061","status":"","submitted":3834,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.331807164018314,"acs":1232,"articleLive":2,"columnArticles":36,"formTitle":"[1932]合并多棵二叉搜索树","frequency":1.6786996721,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","questionId":"2060","status":"","submitted":3713,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5048975957257347,"acs":567,"articleLive":2,"columnArticles":28,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.8807415775,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","questionId":"2070","status":"","submitted":1123,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7654941373534339,"acs":457,"articleLive":2,"columnArticles":17,"formTitle":"[1934]Confirmation Rate","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","questionId":"2087","status":"","submitted":597,"title":"Confirmation Rate","titleSlug":"confirmation-rate"},{"acceptance":0.7338348728692505,"acs":7706,"articleLive":2,"columnArticles":111,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","questionId":"1264","status":"","submitted":10501,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.4513194496654387,"acs":6003,"articleLive":2,"columnArticles":69,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","questionId":"2066","status":"","submitted":13301,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.2502728264823572,"acs":3440,"articleLive":2,"columnArticles":65,"formTitle":"[1937]扣分后的最大得分","frequency":1.4459042916,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","questionId":"2067","status":"","submitted":13745,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.35504322766570606,"acs":1232,"articleLive":2,"columnArticles":43,"formTitle":"[1938]查询最大基因差","frequency":1.6143688138,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","questionId":"2068","status":"","submitted":3470,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6367634124890061,"acs":724,"articleLive":2,"columnArticles":17,"formTitle":"[1939]主动请求确认消息的用户","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","questionId":"2092","status":"","submitted":1137,"title":"主动请求确认消息的用户","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.7535545023696683,"acs":477,"articleLive":2,"columnArticles":29,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","questionId":"2071","status":"","submitted":633,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.7637007973674218,"acs":6034,"articleLive":2,"columnArticles":104,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":1.0182071603,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","questionId":"2053","status":"ac","submitted":7901,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.3994738819992484,"acs":3189,"articleLive":2,"columnArticles":74,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","questionId":"2054","status":"ac","submitted":7983,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.41088217643528707,"acs":2054,"articleLive":2,"columnArticles":57,"formTitle":"[1943]描述绘画结果","frequency":0.6647595781,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","questionId":"2055","status":"notac","submitted":4999,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.5840643274853801,"acs":2397,"articleLive":2,"columnArticles":67,"formTitle":"[1944]队列中可以看到的人数","frequency":1.0182071603,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","questionId":"1305","status":"","submitted":4104,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6590152128904492,"acs":7321,"articleLive":2,"columnArticles":91,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":0.4716067405,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","questionId":"2076","status":"ac","submitted":11109,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.30707169157461556,"acs":5671,"articleLive":2,"columnArticles":84,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":1.0489221055,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","questionId":"2077","status":"ac","submitted":18468,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5457425240750127,"acs":4307,"articleLive":2,"columnArticles":94,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","questionId":"2078","status":"ac","submitted":7892,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.5120039196472318,"acs":1045,"articleLive":2,"columnArticles":20,"formTitle":"[1948]删除系统中的重复文件夹","frequency":0.9327824556,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","questionId":"2079","status":"","submitted":2041,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.530690537084399,"acs":415,"articleLive":2,"columnArticles":16,"formTitle":"[1949]坚定的友谊","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","questionId":"2097","status":"","submitted":782,"title":"坚定的友谊","titleSlug":"strong-friendship"},{"acceptance":0.4895833333333333,"acs":188,"articleLive":2,"columnArticles":8,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","questionId":"2072","status":"","submitted":384,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.7027397260273973,"acs":513,"articleLive":2,"columnArticles":18,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","questionId":"2098","status":"","submitted":730,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5432358510414476,"acs":7746,"articleLive":2,"columnArticles":87,"formTitle":"[1952]三除数","frequency":0.4442975611,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","questionId":"2083","status":"ac","submitted":14259,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.3334304867385602,"acs":4576,"articleLive":2,"columnArticles":87,"formTitle":"[1953]你可以工作的最大周数","frequency":0.5612188992,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","questionId":"2084","status":"ac","submitted":13724,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.4796106003244997,"acs":4434,"articleLive":2,"columnArticles":73,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":0.5001312072,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","questionId":"1295","status":"ac","submitted":9245,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.49772520473157417,"acs":2735,"articleLive":2,"columnArticles":44,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.8320938533,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","questionId":"2086","status":"","submitted":5495,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.4046511627906977,"acs":174,"articleLive":2,"columnArticles":13,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":2.2098775248,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","questionId":"2073","status":"","submitted":430,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6091608157806754,"acs":5466,"articleLive":2,"columnArticles":64,"formTitle":"[1957]删除字符使字符串变好","frequency":0.4181180555,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","questionId":"1302","status":"","submitted":8973,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.4263453815261044,"acs":2654,"articleLive":2,"columnArticles":48,"formTitle":"[1958]检查操作是否合法","frequency":0.6284711262,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","questionId":"2080","status":"","submitted":6225,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.42405896288496975,"acs":1611,"articleLive":2,"columnArticles":32,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","questionId":"2081","status":"","submitted":3799,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.2850222042793702,"acs":706,"articleLive":2,"columnArticles":20,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":1.5544706722,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","questionId":"1336","status":"","submitted":2477,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5354794046382831,"acs":7735,"articleLive":2,"columnArticles":76,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":0.4716067405,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","questionId":"2093","status":"","submitted":14445,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.4385594761731539,"acs":6028,"articleLive":2,"columnArticles":82,"formTitle":"[1962]移除石子使总数最小","frequency":1.4459042916,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","questionId":"2094","status":"","submitted":13745,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6208154226911554,"acs":4766,"articleLive":2,"columnArticles":61,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":0.5001312072,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","questionId":"2095","status":"","submitted":7677,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.3906927675536279,"acs":3333,"articleLive":2,"columnArticles":50,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","questionId":"2096","status":"","submitted":8531,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.7606837606837606,"acs":712,"articleLive":2,"columnArticles":17,"formTitle":"[1965]丢失信息的雇员","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","questionId":"2110","status":"","submitted":936,"title":"丢失信息的雇员","titleSlug":"employees-with-missing-information"},{"acceptance":0.5867768595041323,"acs":71,"articleLive":2,"columnArticles":8,"formTitle":"[1966]未排序数组中的可被二分搜索的数","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","questionId":"2111","status":"","submitted":121,"title":"未排序数组中的可被二分搜索的数","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.783342526199669,"acs":7101,"articleLive":2,"columnArticles":87,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","questionId":"2099","status":"","submitted":9065,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.3639651609093593,"acs":4931,"articleLive":2,"columnArticles":72,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","questionId":"2085","status":"","submitted":13548,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.2836654870553176,"acs":3046,"articleLive":2,"columnArticles":44,"formTitle":"[1969]数组元素的最小非零乘积","frequency":2.0352188407,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","questionId":"2100","status":"","submitted":10738,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.4780507450664519,"acs":2374,"articleLive":2,"columnArticles":53,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":1.724369709,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","questionId":"2101","status":"","submitted":4966,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.48924122310305773,"acs":1296,"articleLive":2,"columnArticles":32,"formTitle":"[1971]寻找图中是否存在路径","frequency":0.4442975611,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","questionId":"2121","status":"","submitted":2649,"title":"寻找图中是否存在路径","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.4488950276243094,"acs":325,"articleLive":2,"columnArticles":13,"formTitle":"[1972]同一天的第一个电话和最后一个电话","frequency":0.594008722,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","questionId":"2120","status":"","submitted":724,"title":"同一天的第一个电话和最后一个电话","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.5323383084577115,"acs":107,"articleLive":2,"columnArticles":11,"formTitle":"[1973]值等于子节点值之和的节点数量","frequency":0.0,"frontendQuestionId":"1973","leaf":true,"level":2,"nodeType":"def","questionId":"2126","status":"","submitted":201,"title":"值等于子节点值之和的节点数量","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.7343092976171935,"acs":4715,"articleLive":2,"columnArticles":69,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":0.988662914,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","questionId":"2088","status":"ac","submitted":6421,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.38896814075130764,"acs":3272,"articleLive":2,"columnArticles":48,"formTitle":"[1975]最大方阵和","frequency":1.4805818301,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","questionId":"2089","status":"ac","submitted":8412,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.3038838565578856,"acs":2449,"articleLive":2,"columnArticles":55,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","questionId":"2090","status":"notac","submitted":8059,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.2579771222155328,"acs":857,"articleLive":2,"columnArticles":17,"formTitle":"[1977]划分数字的方案数","frequency":1.4459042916,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","questionId":"2091","status":"","submitted":3322,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.5408631772268135,"acs":589,"articleLive":2,"columnArticles":15,"formTitle":"[1978]上级经理已离职的公司员工","frequency":0.4716067405,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","questionId":"2127","status":"","submitted":1089,"title":"上级经理已离职的公司员工","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.7914882901032485,"acs":9429,"articleLive":2,"columnArticles":120,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","questionId":"2106","status":"ac","submitted":11913,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.5857369551012788,"acs":6275,"articleLive":2,"columnArticles":112,"formTitle":"[1980]找出不同的二进制字符串","frequency":1.0808941382,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","questionId":"2107","status":"ac","submitted":10713,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.3052644788856121,"acs":4865,"articleLive":2,"columnArticles":88,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":1.7849943308,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","questionId":"2108","status":"","submitted":15937,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.46765913757700206,"acs":911,"articleLive":2,"columnArticles":19,"formTitle":"[1982]从子集的和还原数组","frequency":1.1853732082,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","questionId":"2109","status":"","submitted":1948,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.5398773006134969,"acs":88,"articleLive":2,"columnArticles":4,"formTitle":"[1983]Widest Pair of Indices With Equal Range Sum","frequency":0.0,"frontendQuestionId":"1983","leaf":true,"level":2,"nodeType":"def","questionId":"519","status":"","submitted":163,"title":"Widest Pair of Indices With Equal Range Sum","titleSlug":"widest-pair-of-indices-with-equal-range-sum"},{"acceptance":0.5763093999306278,"acs":6646,"articleLive":2,"columnArticles":74,"formTitle":"[1984]学生分数的最小差值","frequency":0.0,"frontendQuestionId":"1984","leaf":true,"level":1,"nodeType":"def","questionId":"2112","status":"ac","submitted":11532,"title":"学生分数的最小差值","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores"},{"acceptance":0.41523700597280466,"acs":6535,"articleLive":2,"columnArticles":94,"formTitle":"[1985]找出数组中的第 K 大整数","frequency":0.0,"frontendQuestionId":"1985","leaf":true,"level":2,"nodeType":"def","questionId":"2113","status":"ac","submitted":15738,"title":"找出数组中的第 K 大整数","titleSlug":"find-the-kth-largest-integer-in-the-array"},{"acceptance":0.28669282911166605,"acs":4018,"articleLive":2,"columnArticles":80,"formTitle":"[1986]完成任务的最少工作时间段","frequency":0.5001312072,"frontendQuestionId":"1986","leaf":true,"level":2,"nodeType":"def","questionId":"2114","status":"notac","submitted":14015,"title":"完成任务的最少工作时间段","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks"},{"acceptance":0.47370030581039757,"acs":1549,"articleLive":2,"columnArticles":27,"formTitle":"[1987]不同的好子序列数目","frequency":0.9327824556,"frontendQuestionId":"1987","leaf":true,"level":3,"nodeType":"def","questionId":"2115","status":"","submitted":3270,"title":"不同的好子序列数目","titleSlug":"number-of-unique-good-subsequences"},{"acceptance":0.6725806451612903,"acs":417,"articleLive":2,"columnArticles":10,"formTitle":"[1988]找出每所学校的最低分数要求","frequency":1.1853732082,"frontendQuestionId":"1988","leaf":true,"level":2,"nodeType":"def","questionId":"2136","status":"","submitted":620,"title":"找出每所学校的最低分数要求","titleSlug":"find-cutoff-score-for-each-school"},{"acceptance":0.521505376344086,"acs":97,"articleLive":2,"columnArticles":3,"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":"","submitted":186,"title":"Maximum Number of People That Can Be Caught in Tag","titleSlug":"maximum-number-of-people-that-can-be-caught-in-tag"},{"acceptance":0.5503355704697986,"acs":492,"articleLive":2,"columnArticles":12,"formTitle":"[1990]统计实验的数量","frequency":0.4442975611,"frontendQuestionId":"1990","leaf":true,"level":1,"nodeType":"def","questionId":"2143","status":"","submitted":894,"title":"统计实验的数量","titleSlug":"count-the-number-of-experiments"},{"acceptance":0.6566328686100549,"acs":6217,"articleLive":2,"columnArticles":86,"formTitle":"[1991]找到数组的中间位置","frequency":0.4181180555,"frontendQuestionId":"1991","leaf":true,"level":1,"nodeType":"def","questionId":"2102","status":"ac","submitted":9468,"title":"找到数组的中间位置","titleSlug":"find-the-middle-index-in-array"},{"acceptance":0.5932596291012838,"acs":3327,"articleLive":2,"columnArticles":69,"formTitle":"[1992]找到所有的农场组","frequency":0.0,"frontendQuestionId":"1992","leaf":true,"level":2,"nodeType":"def","questionId":"2103","status":"ac","submitted":5608,"title":"找到所有的农场组","titleSlug":"find-all-groups-of-farmland"},{"acceptance":0.3851286939942803,"acs":2020,"articleLive":2,"columnArticles":46,"formTitle":"[1993]树上的操作","frequency":0.0,"frontendQuestionId":"1993","leaf":true,"level":2,"nodeType":"def","questionId":"2104","status":"","submitted":5245,"title":"树上的操作","titleSlug":"operations-on-tree"},{"acceptance":0.37341072415699283,"acs":1351,"articleLive":2,"columnArticles":38,"formTitle":"[1994]好子集的数目","frequency":0.0,"frontendQuestionId":"1994","leaf":true,"level":3,"nodeType":"def","questionId":"2105","status":"notac","submitted":3618,"title":"好子集的数目","titleSlug":"the-number-of-good-subsets"},{"acceptance":0.6632169395400824,"acs":32042,"articleLive":2,"columnArticles":227,"formTitle":"[1995]统计特殊四元组","frequency":1.0973811987,"frontendQuestionId":"1995","leaf":true,"level":1,"nodeType":"def","questionId":"2122","status":"ac","submitted":48313,"title":"统计特殊四元组","titleSlug":"count-special-quadruplets"},{"acceptance":0.2558651369702646,"acs":5464,"articleLive":2,"columnArticles":101,"formTitle":"[1996]游戏中弱角色的数量","frequency":0.0,"frontendQuestionId":"1996","leaf":true,"level":2,"nodeType":"def","questionId":"2123","status":"ac","submitted":21355,"title":"游戏中弱角色的数量","titleSlug":"the-number-of-weak-characters-in-the-game"},{"acceptance":0.3413208649912332,"acs":2336,"articleLive":2,"columnArticles":38,"formTitle":"[1997]访问完所有房间的第一天","frequency":1.3054212505,"frontendQuestionId":"1997","leaf":true,"level":2,"nodeType":"def","questionId":"2124","status":"notac","submitted":6844,"title":"访问完所有房间的第一天","titleSlug":"first-day-where-you-have-been-in-all-the-rooms"},{"acceptance":0.4228380315336837,"acs":1770,"articleLive":2,"columnArticles":34,"formTitle":"[1998]数组的最大公因数排序","frequency":0.743540456,"frontendQuestionId":"1998","leaf":true,"level":3,"nodeType":"def","questionId":"2125","status":"","submitted":4186,"title":"数组的最大公因数排序","titleSlug":"gcd-sort-of-an-array"},{"acceptance":0.4619289340101523,"acs":91,"articleLive":2,"columnArticles":9,"formTitle":"[1999]最小的仅由两个数组成的倍数","frequency":0.0,"frontendQuestionId":"1999","leaf":true,"level":2,"nodeType":"def","questionId":"2141","status":"","submitted":197,"title":"最小的仅由两个数组成的倍数","titleSlug":"smallest-greater-multiple-made-of-two-digits"},{"acceptance":0.7700474993014809,"acs":8268,"articleLive":2,"columnArticles":123,"formTitle":"[2000]反转单词前缀","frequency":0.4181180555,"frontendQuestionId":"2000","leaf":true,"level":1,"nodeType":"def","questionId":"2128","status":"ac","submitted":10737,"title":"反转单词前缀","titleSlug":"reverse-prefix-of-word"},{"acceptance":0.36315758328895203,"acs":6137,"articleLive":2,"columnArticles":133,"formTitle":"[2001]可互换矩形的组数","frequency":0.5612188992,"frontendQuestionId":"2001","leaf":true,"level":2,"nodeType":"def","questionId":"2129","status":"ac","submitted":16899,"title":"可互换矩形的组数","titleSlug":"number-of-pairs-of-interchangeable-rectangles"},{"acceptance":0.5816809707013909,"acs":3931,"articleLive":2,"columnArticles":90,"formTitle":"[2002]两个回文子序列长度的最大乘积","frequency":0.0,"frontendQuestionId":"2002","leaf":true,"level":2,"nodeType":"def","questionId":"2130","status":"","submitted":6758,"title":"两个回文子序列长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences"},{"acceptance":0.39558507521000197,"acs":2025,"articleLive":2,"columnArticles":43,"formTitle":"[2003]每棵子树内缺失的最小基因值","frequency":0.0,"frontendQuestionId":"2003","leaf":true,"level":3,"nodeType":"def","questionId":"2131","status":"","submitted":5119,"title":"每棵子树内缺失的最小基因值","titleSlug":"smallest-missing-genetic-value-in-each-subtree"},{"acceptance":0.425,"acs":221,"articleLive":2,"columnArticles":9,"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":"","submitted":520,"title":"The Number of Seniors and Juniors to Join the Company","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company"},{"acceptance":0.6181818181818182,"acs":34,"articleLive":2,"columnArticles":3,"formTitle":"[2005]斐波那契树的移除子树游戏","frequency":0.0,"frontendQuestionId":"2005","leaf":true,"level":3,"nodeType":"def","questionId":"2153","status":"","submitted":55,"title":"斐波那契树的移除子树游戏","titleSlug":"subtree-removal-game-with-fibonacci-tree"},{"acceptance":0.8465004928883256,"acs":6011,"articleLive":2,"columnArticles":82,"formTitle":"[2006]差的绝对值为 K 的数对数目","frequency":0.0,"frontendQuestionId":"2006","leaf":true,"level":1,"nodeType":"def","questionId":"2116","status":"","submitted":7101,"title":"差的绝对值为 K 的数对数目","titleSlug":"count-number-of-pairs-with-absolute-difference-k"},{"acceptance":0.32204291541053376,"acs":3632,"articleLive":2,"columnArticles":72,"formTitle":"[2007]从双倍数组中还原原数组","frequency":0.4442975611,"frontendQuestionId":"2007","leaf":true,"level":2,"nodeType":"def","questionId":"2117","status":"","submitted":11278,"title":"从双倍数组中还原原数组","titleSlug":"find-original-array-from-doubled-array"},{"acceptance":0.42674752633258856,"acs":2674,"articleLive":2,"columnArticles":47,"formTitle":"[2008]出租车的最大盈利","frequency":1.6786996721,"frontendQuestionId":"2008","leaf":true,"level":2,"nodeType":"def","questionId":"2118","status":"","submitted":6266,"title":"出租车的最大盈利","titleSlug":"maximum-earnings-from-taxi"},{"acceptance":0.4160452558498329,"acs":1618,"articleLive":2,"columnArticles":44,"formTitle":"[2009]使数组连续的最少操作数","frequency":0.0,"frontendQuestionId":"2009","leaf":true,"level":3,"nodeType":"def","questionId":"2119","status":"","submitted":3889,"title":"使数组连续的最少操作数","titleSlug":"minimum-number-of-operations-to-make-array-continuous"},{"acceptance":0.6406779661016949,"acs":189,"articleLive":2,"columnArticles":9,"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":"","submitted":295,"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.876531748978834,"acs":9442,"articleLive":2,"columnArticles":97,"formTitle":"[2011]执行操作后的变量值","frequency":1.3805429075,"frontendQuestionId":"2011","leaf":true,"level":1,"nodeType":"def","questionId":"2137","status":"ac","submitted":10772,"title":"执行操作后的变量值","titleSlug":"final-value-of-variable-after-performing-operations"},{"acceptance":0.36522160329377573,"acs":4524,"articleLive":2,"columnArticles":81,"formTitle":"[2012]数组美丽值求和","frequency":0.0,"frontendQuestionId":"2012","leaf":true,"level":2,"nodeType":"def","questionId":"2138","status":"ac","submitted":12387,"title":"数组美丽值求和","titleSlug":"sum-of-beauty-in-the-array"},{"acceptance":0.3446140234461402,"acs":3116,"articleLive":2,"columnArticles":57,"formTitle":"[2013]检测正方形","frequency":0.5001312072,"frontendQuestionId":"2013","leaf":true,"level":2,"nodeType":"def","questionId":"2139","status":"ac","submitted":9042,"title":"检测正方形","titleSlug":"detect-squares"},{"acceptance":0.5332005312084993,"acs":1606,"articleLive":2,"columnArticles":26,"formTitle":"[2014]重复 K 次的最长子序列","frequency":0.0,"frontendQuestionId":"2014","leaf":true,"level":3,"nodeType":"def","questionId":"2140","status":"","submitted":3012,"title":"重复 K 次的最长子序列","titleSlug":"longest-subsequence-repeated-k-times"},{"acceptance":0.6722689075630253,"acs":80,"articleLive":2,"columnArticles":5,"formTitle":"[2015]Average Height of Buildings in Each Segment","frequency":0.0,"frontendQuestionId":"2015","leaf":true,"level":2,"nodeType":"def","questionId":"2142","status":"","submitted":119,"title":"Average Height of Buildings in Each Segment","titleSlug":"average-height-of-buildings-in-each-segment"},{"acceptance":0.5569160614761021,"acs":6595,"articleLive":2,"columnArticles":88,"formTitle":"[2016]增量元素之间的最大差值","frequency":0.4442975611,"frontendQuestionId":"2016","leaf":true,"level":1,"nodeType":"def","questionId":"2144","status":"ac","submitted":11842,"title":"增量元素之间的最大差值","titleSlug":"maximum-difference-between-increasing-elements"},{"acceptance":0.3571043165467626,"acs":3971,"articleLive":2,"columnArticles":100,"formTitle":"[2017]网格游戏","frequency":0.0,"frontendQuestionId":"2017","leaf":true,"level":2,"nodeType":"def","questionId":"2145","status":"ac","submitted":11120,"title":"网格游戏","titleSlug":"grid-game"},{"acceptance":0.41060866246899447,"acs":2152,"articleLive":2,"columnArticles":53,"formTitle":"[2018]判断单词是否能放入填字游戏内","frequency":0.594008722,"frontendQuestionId":"2018","leaf":true,"level":2,"nodeType":"def","questionId":"2146","status":"","submitted":5241,"title":"判断单词是否能放入填字游戏内","titleSlug":"check-if-word-can-be-placed-in-crossword"},{"acceptance":0.35856115107913666,"acs":1246,"articleLive":2,"columnArticles":36,"formTitle":"[2019]解出数学表达式的学生分数","frequency":0.5612188992,"frontendQuestionId":"2019","leaf":true,"level":3,"nodeType":"def","questionId":"2147","status":"","submitted":3475,"title":"解出数学表达式的学生分数","titleSlug":"the-score-of-students-solving-math-expression"},{"acceptance":0.7641277641277642,"acs":311,"articleLive":2,"columnArticles":9,"formTitle":"[2020]Number of Accounts That Did Not Stream","frequency":0.0,"frontendQuestionId":"2020","leaf":true,"level":2,"nodeType":"def","questionId":"2167","status":"","submitted":407,"title":"Number of Accounts That Did Not Stream","titleSlug":"number-of-accounts-that-did-not-stream"},{"acceptance":0.5826446280991735,"acs":141,"articleLive":2,"columnArticles":10,"formTitle":"[2021]街上最亮的位置","frequency":0.0,"frontendQuestionId":"2021","leaf":true,"level":2,"nodeType":"def","questionId":"2075","status":"","submitted":242,"title":"街上最亮的位置","titleSlug":"brightest-position-on-street"},{"acceptance":0.7509375689388925,"acs":3404,"articleLive":2,"columnArticles":57,"formTitle":"[2023]连接后等于目标字符串的字符串对","frequency":0.0,"frontendQuestionId":"2023","leaf":true,"level":2,"nodeType":"def","questionId":"2133","status":"ac","submitted":4533,"title":"连接后等于目标字符串的字符串对","titleSlug":"number-of-pairs-of-strings-with-concatenation-equal-to-target"},{"acceptance":0.49279341111873715,"acs":2872,"articleLive":2,"columnArticles":72,"formTitle":"[2024]考试的最大困扰度","frequency":0.4716067405,"frontendQuestionId":"2024","leaf":true,"level":2,"nodeType":"def","questionId":"2134","status":"","submitted":5828,"title":"考试的最大困扰度","titleSlug":"maximize-the-confusion-of-an-exam"},{"acceptance":0.2646613696556943,"acs":1399,"articleLive":2,"columnArticles":46,"formTitle":"[2025]分割数组的最多方案数","frequency":0.7030490946,"frontendQuestionId":"2025","leaf":true,"level":3,"nodeType":"def","questionId":"2135","status":"","submitted":5286,"title":"分割数组的最多方案数","titleSlug":"maximum-number-of-ways-to-partition-an-array"},{"acceptance":0.8573388203017832,"acs":625,"articleLive":2,"columnArticles":15,"formTitle":"[2026]低质量的问题","frequency":1.4125900849,"frontendQuestionId":"2026","leaf":true,"level":1,"nodeType":"def","questionId":"2172","status":"","submitted":729,"title":"低质量的问题","titleSlug":"low-quality-problems"},{"acceptance":0.562607944732297,"acs":5212,"articleLive":2,"columnArticles":61,"formTitle":"[2027]转换字符串的最少操作次数","frequency":0.0,"frontendQuestionId":"2027","leaf":true,"level":1,"nodeType":"def","questionId":"2154","status":"ac","submitted":9264,"title":"转换字符串的最少操作次数","titleSlug":"minimum-moves-to-convert-string"},{"acceptance":0.4278526866572751,"acs":4252,"articleLive":2,"columnArticles":64,"formTitle":"[2028]找出缺失的观测数据","frequency":0.0,"frontendQuestionId":"2028","leaf":true,"level":2,"nodeType":"def","questionId":"2155","status":"ac","submitted":9938,"title":"找出缺失的观测数据","titleSlug":"find-missing-observations"},{"acceptance":0.23771742447360392,"acs":2337,"articleLive":2,"columnArticles":68,"formTitle":"[2029]石子游戏 IX","frequency":0.5612188992,"frontendQuestionId":"2029","leaf":true,"level":2,"nodeType":"def","questionId":"2156","status":"notac","submitted":9831,"title":"石子游戏 IX","titleSlug":"stone-game-ix"},{"acceptance":0.35140826533298236,"acs":1335,"articleLive":2,"columnArticles":41,"formTitle":"[2030]含特定字母的最小子序列","frequency":0.743540456,"frontendQuestionId":"2030","leaf":true,"level":3,"nodeType":"def","questionId":"2157","status":"","submitted":3799,"title":"含特定字母的最小子序列","titleSlug":"smallest-k-length-subsequence-with-occurrences-of-a-letter"},{"acceptance":0.5445026178010471,"acs":104,"articleLive":2,"columnArticles":5,"formTitle":"[2031]1 比 0 多的子数组个数","frequency":2.062116643,"frontendQuestionId":"2031","leaf":true,"level":2,"nodeType":"def","questionId":"510","status":"","submitted":191,"title":"1 比 0 多的子数组个数","titleSlug":"count-subarrays-with-more-ones-than-zeros"},{"acceptance":0.6624550490815434,"acs":6816,"articleLive":2,"columnArticles":116,"formTitle":"[2032]至少在两个数组中出现的值","frequency":0.0,"frontendQuestionId":"2032","leaf":true,"level":1,"nodeType":"def","questionId":"2159","status":"ac","submitted":10289,"title":"至少在两个数组中出现的值","titleSlug":"two-out-of-three"},{"acceptance":0.397773458208164,"acs":4502,"articleLive":2,"columnArticles":93,"formTitle":"[2033]获取单值网格的最小操作数","frequency":1.0182071603,"frontendQuestionId":"2033","leaf":true,"level":2,"nodeType":"def","questionId":"2160","status":"ac","submitted":11318,"title":"获取单值网格的最小操作数","titleSlug":"minimum-operations-to-make-a-uni-value-grid"},{"acceptance":0.3065080475857243,"acs":3504,"articleLive":2,"columnArticles":71,"formTitle":"[2034]股票价格波动","frequency":0.0,"frontendQuestionId":"2034","leaf":true,"level":2,"nodeType":"def","questionId":"2161","status":"ac","submitted":11432,"title":"股票价格波动","titleSlug":"stock-price-fluctuation"},{"acceptance":0.31991157429338385,"acs":2026,"articleLive":2,"columnArticles":47,"formTitle":"[2035]将数组分成两个数组并最小化数组和的差","frequency":0.594008722,"frontendQuestionId":"2035","leaf":true,"level":3,"nodeType":"def","questionId":"2162","status":"","submitted":6333,"title":"将数组分成两个数组并最小化数组和的差","titleSlug":"partition-array-into-two-arrays-to-minimize-sum-difference"},{"acceptance":0.44385026737967914,"acs":83,"articleLive":2,"columnArticles":9,"formTitle":"[2036]最大交替子数组和","frequency":0.0,"frontendQuestionId":"2036","leaf":true,"level":2,"nodeType":"def","questionId":"512","status":"","submitted":187,"title":"最大交替子数组和","titleSlug":"maximum-alternating-subarray-sum"},{"acceptance":0.8292733278282411,"acs":4017,"articleLive":2,"columnArticles":58,"formTitle":"[2037]使每位学生都有座位的最少移动次数","frequency":0.0,"frontendQuestionId":"2037","leaf":true,"level":1,"nodeType":"def","questionId":"2148","status":"ac","submitted":4844,"title":"使每位学生都有座位的最少移动次数","titleSlug":"minimum-number-of-moves-to-seat-everyone"},{"acceptance":0.5080593165699548,"acs":3152,"articleLive":2,"columnArticles":66,"formTitle":"[2038]如果相邻两个颜色均相同则删除当前颜色","frequency":0.0,"frontendQuestionId":"2038","leaf":true,"level":2,"nodeType":"def","questionId":"2149","status":"ac","submitted":6204,"title":"如果相邻两个颜色均相同则删除当前颜色","titleSlug":"remove-colored-pieces-if-both-neighbors-are-the-same-color"},{"acceptance":0.3642273402674591,"acs":1961,"articleLive":2,"columnArticles":45,"formTitle":"[2039]网络空闲的时刻","frequency":0.594008722,"frontendQuestionId":"2039","leaf":true,"level":2,"nodeType":"def","questionId":"2151","status":"ac","submitted":5384,"title":"网络空闲的时刻","titleSlug":"the-time-when-the-network-becomes-idle"},{"acceptance":0.3230897009966777,"acs":1167,"articleLive":2,"columnArticles":21,"formTitle":"[2040]两个有序数组的第 K 小乘积","frequency":0.0,"frontendQuestionId":"2040","leaf":true,"level":3,"nodeType":"def","questionId":"2150","status":"","submitted":3612,"title":"两个有序数组的第 K 小乘积","titleSlug":"kth-smallest-product-of-two-sorted-arrays"},{"acceptance":0.6537634408602151,"acs":304,"articleLive":2,"columnArticles":14,"formTitle":"[2041]面试中被录取的候选人","frequency":0.0,"frontendQuestionId":"2041","leaf":true,"level":2,"nodeType":"def","questionId":"2185","status":"","submitted":465,"title":"面试中被录取的候选人","titleSlug":"accepted-candidates-from-the-interviews"},{"acceptance":0.667722911715518,"acs":7586,"articleLive":2,"columnArticles":122,"formTitle":"[2042]检查句子中的数字是否递增","frequency":1.3496762595,"frontendQuestionId":"2042","leaf":true,"level":1,"nodeType":"def","questionId":"2168","status":"ac","submitted":11361,"title":"检查句子中的数字是否递增","titleSlug":"check-if-numbers-are-ascending-in-a-sentence"},{"acceptance":0.5932853717026378,"acs":6185,"articleLive":2,"columnArticles":73,"formTitle":"[2043]简易银行系统","frequency":0.4716067405,"frontendQuestionId":"2043","leaf":true,"level":2,"nodeType":"def","questionId":"2169","status":"ac","submitted":10425,"title":"简易银行系统","titleSlug":"simple-bank-system"},{"acceptance":0.7412325010824072,"acs":5136,"articleLive":2,"columnArticles":98,"formTitle":"[2044]统计按位或能得到最大值的子集数目","frequency":0.4181180555,"frontendQuestionId":"2044","leaf":true,"level":2,"nodeType":"def","questionId":"2170","status":"ac","submitted":6929,"title":"统计按位或能得到最大值的子集数目","titleSlug":"count-number-of-maximum-bitwise-or-subsets"},{"acceptance":0.3338068181818182,"acs":2350,"articleLive":2,"columnArticles":61,"formTitle":"[2045]到达目的地的第二短时间","frequency":0.594008722,"frontendQuestionId":"2045","leaf":true,"level":3,"nodeType":"def","questionId":"2171","status":"ac","submitted":7040,"title":"到达目的地的第二短时间","titleSlug":"second-minimum-time-to-reach-destination"},{"acceptance":0.6508474576271186,"acs":192,"articleLive":2,"columnArticles":18,"formTitle":"[2046]给按照绝对值排序的链表排序","frequency":0.0,"frontendQuestionId":"2046","leaf":true,"level":2,"nodeType":"def","questionId":"1992","status":"","submitted":295,"title":"给按照绝对值排序的链表排序","titleSlug":"sort-linked-list-already-sorted-using-absolute-values"},{"acceptance":0.2875565999885367,"acs":5017,"articleLive":2,"columnArticles":108,"formTitle":"[2047]句子中的有效单词数","frequency":0.4442975611,"frontendQuestionId":"2047","leaf":true,"level":1,"nodeType":"def","questionId":"2173","status":"ac","submitted":17447,"title":"句子中的有效单词数","titleSlug":"number-of-valid-words-in-a-sentence"},{"acceptance":0.41502137187054755,"acs":4078,"articleLive":2,"columnArticles":94,"formTitle":"[2048]下一个更大的数值平衡数","frequency":0.0,"frontendQuestionId":"2048","leaf":true,"level":2,"nodeType":"def","questionId":"2174","status":"ac","submitted":9826,"title":"下一个更大的数值平衡数","titleSlug":"next-greater-numerically-balanced-number"},{"acceptance":0.39650426644646297,"acs":2881,"articleLive":2,"columnArticles":96,"formTitle":"[2049]统计最高分的节点数目","frequency":0.0,"frontendQuestionId":"2049","leaf":true,"level":2,"nodeType":"def","questionId":"2175","status":"","submitted":7266,"title":"统计最高分的节点数目","titleSlug":"count-nodes-with-the-highest-score"},{"acceptance":0.5610079575596817,"acs":2115,"articleLive":2,"columnArticles":71,"formTitle":"[2050]并行课程 III","frequency":0.4716067405,"frontendQuestionId":"2050","leaf":true,"level":3,"nodeType":"def","questionId":"2176","status":"","submitted":3770,"title":"并行课程 III","titleSlug":"parallel-courses-iii"},{"acceptance":0.6737160120845922,"acs":223,"articleLive":2,"columnArticles":8,"formTitle":"[2051]The Category of Each Member in the Store","frequency":0.0,"frontendQuestionId":"2051","leaf":true,"level":2,"nodeType":"def","questionId":"2194","status":"","submitted":331,"title":"The Category of Each Member in the Store","titleSlug":"the-category-of-each-member-in-the-store"},{"acceptance":0.4094488188976378,"acs":52,"articleLive":2,"columnArticles":7,"formTitle":"[2052]将句子分隔成行的最低成本","frequency":0.0,"frontendQuestionId":"2052","leaf":true,"level":2,"nodeType":"def","questionId":"2082","status":"","submitted":127,"title":"将句子分隔成行的最低成本","titleSlug":"minimum-cost-to-separate-sentence-into-rows"},{"acceptance":0.7475945017182131,"acs":4351,"articleLive":2,"columnArticles":68,"formTitle":"[2053]数组中第 K 个独一无二的字符串","frequency":0.0,"frontendQuestionId":"2053","leaf":true,"level":1,"nodeType":"def","questionId":"2163","status":"","submitted":5820,"title":"数组中第 K 个独一无二的字符串","titleSlug":"kth-distinct-string-in-an-array"},{"acceptance":0.3342304241958221,"acs":2608,"articleLive":2,"columnArticles":60,"formTitle":"[2054]两个最好的不重叠活动","frequency":0.0,"frontendQuestionId":"2054","leaf":true,"level":2,"nodeType":"def","questionId":"2164","status":"","submitted":7803,"title":"两个最好的不重叠活动","titleSlug":"two-best-non-overlapping-events"},{"acceptance":0.3823837818944425,"acs":2188,"articleLive":2,"columnArticles":71,"formTitle":"[2055]蜡烛之间的盘子","frequency":0.988662914,"frontendQuestionId":"2055","leaf":true,"level":2,"nodeType":"def","questionId":"2165","status":"","submitted":5722,"title":"蜡烛之间的盘子","titleSlug":"plates-between-candles"},{"acceptance":0.6098020735155514,"acs":647,"articleLive":2,"columnArticles":14,"formTitle":"[2056]棋盘上有效移动组合的数目","frequency":0.0,"frontendQuestionId":"2056","leaf":true,"level":3,"nodeType":"def","questionId":"2166","status":"","submitted":1061,"title":"棋盘上有效移动组合的数目","titleSlug":"number-of-valid-move-combinations-on-chessboard"},{"acceptance":0.7742013846714442,"acs":6374,"articleLive":2,"columnArticles":44,"formTitle":"[2057]值相等的最小索引","frequency":0.0,"frontendQuestionId":"2057","leaf":true,"level":1,"nodeType":"def","questionId":"2181","status":"","submitted":8233,"title":"值相等的最小索引","titleSlug":"smallest-index-with-equal-value"},{"acceptance":0.5720533566586485,"acs":5232,"articleLive":2,"columnArticles":78,"formTitle":"[2058]找出临界点之间的最小和最大距离","frequency":0.0,"frontendQuestionId":"2058","leaf":true,"level":2,"nodeType":"def","questionId":"2182","status":"","submitted":9146,"title":"找出临界点之间的最小和最大距离","titleSlug":"find-the-minimum-and-maximum-number-of-nodes-between-critical-points"},{"acceptance":0.42689377909437154,"acs":4035,"articleLive":2,"columnArticles":93,"formTitle":"[2059]转化数字的最小运算数","frequency":0.0,"frontendQuestionId":"2059","leaf":true,"level":2,"nodeType":"def","questionId":"2183","status":"","submitted":9452,"title":"转化数字的最小运算数","titleSlug":"minimum-operations-to-convert-number"},{"acceptance":0.36538461538461536,"acs":1007,"articleLive":2,"columnArticles":20,"formTitle":"[2060]同源字符串检测","frequency":0.0,"frontendQuestionId":"2060","leaf":true,"level":3,"nodeType":"def","questionId":"2184","status":"","submitted":2756,"title":"同源字符串检测","titleSlug":"check-if-an-original-string-exists-given-two-encoded-strings"},{"acceptance":0.5121951219512195,"acs":63,"articleLive":2,"columnArticles":6,"formTitle":"[2061]扫地机器人清扫过的空间个数","frequency":0.0,"frontendQuestionId":"2061","leaf":true,"level":2,"nodeType":"def","questionId":"2203","status":"","submitted":123,"title":"扫地机器人清扫过的空间个数","titleSlug":"number-of-spaces-cleaning-robot-cleaned"},{"acceptance":0.6076253721089994,"acs":5307,"articleLive":2,"columnArticles":95,"formTitle":"[2062]统计字符串中的元音子字符串","frequency":0.4442975611,"frontendQuestionId":"2062","leaf":true,"level":1,"nodeType":"def","questionId":"2186","status":"ac","submitted":8734,"title":"统计字符串中的元音子字符串","titleSlug":"count-vowel-substrings-of-a-string"},{"acceptance":0.48622589531680444,"acs":4236,"articleLive":2,"columnArticles":101,"formTitle":"[2063]所有子字符串中的元音","frequency":0.4442975611,"frontendQuestionId":"2063","leaf":true,"level":2,"nodeType":"def","questionId":"2187","status":"ac","submitted":8712,"title":"所有子字符串中的元音","titleSlug":"vowels-of-all-substrings"},{"acceptance":0.41697772426249247,"acs":3463,"articleLive":2,"columnArticles":72,"formTitle":"[2064]分配给商店的最多商品的最小值","frequency":0.0,"frontendQuestionId":"2064","leaf":true,"level":2,"nodeType":"def","questionId":"2188","status":"notac","submitted":8305,"title":"分配给商店的最多商品的最小值","titleSlug":"minimized-maximum-of-products-distributed-to-any-store"},{"acceptance":0.5341993637327678,"acs":2015,"articleLive":2,"columnArticles":57,"formTitle":"[2065]最大化一张图中的路径价值","frequency":0.0,"frontendQuestionId":"2065","leaf":true,"level":3,"nodeType":"def","questionId":"2189","status":"ac","submitted":3772,"title":"最大化一张图中的路径价值","titleSlug":"maximum-path-quality-of-a-graph"},{"acceptance":0.8308823529411765,"acs":226,"articleLive":2,"columnArticles":10,"formTitle":"[2066]账户余额","frequency":0.0,"frontendQuestionId":"2066","leaf":true,"level":2,"nodeType":"def","questionId":"2208","status":"","submitted":272,"title":"账户余额","titleSlug":"account-balance"},{"acceptance":0.4444444444444444,"acs":48,"articleLive":2,"columnArticles":5,"formTitle":"[2067]Number of Equal Count Substrings","frequency":0.0,"frontendQuestionId":"2067","leaf":true,"level":2,"nodeType":"def","questionId":"2209","status":"","submitted":108,"title":"Number of Equal Count Substrings","titleSlug":"number-of-equal-count-substrings"},{"acceptance":0.7389777604369879,"acs":3788,"articleLive":2,"columnArticles":67,"formTitle":"[2068]检查两个字符串是否几乎相等","frequency":0.0,"frontendQuestionId":"2068","leaf":true,"level":1,"nodeType":"def","questionId":"2177","status":"ac","submitted":5126,"title":"检查两个字符串是否几乎相等","titleSlug":"check-whether-two-strings-are-almost-equivalent"},{"acceptance":0.19150766343446982,"acs":2449,"articleLive":2,"columnArticles":76,"formTitle":"[2069]模拟行走机器人 II","frequency":0.0,"frontendQuestionId":"2069","leaf":true,"level":2,"nodeType":"def","questionId":"2178","status":"notac","submitted":12788,"title":"模拟行走机器人 II","titleSlug":"walking-robot-simulation-ii"},{"acceptance":0.4259693417493237,"acs":2362,"articleLive":2,"columnArticles":79,"formTitle":"[2070]每一个查询的最大美丽值","frequency":0.0,"frontendQuestionId":"2070","leaf":true,"level":2,"nodeType":"def","questionId":"2179","status":"","submitted":5545,"title":"每一个查询的最大美丽值","titleSlug":"most-beautiful-item-for-each-query"},{"acceptance":0.36528662420382163,"acs":1147,"articleLive":2,"columnArticles":28,"formTitle":"[2071]你可以安排的最多任务数目","frequency":0.4442975611,"frontendQuestionId":"2071","leaf":true,"level":3,"nodeType":"def","questionId":"2180","status":"","submitted":3140,"title":"你可以安排的最多任务数目","titleSlug":"maximum-number-of-tasks-you-can-assign"},{"acceptance":0.6889952153110048,"acs":288,"articleLive":2,"columnArticles":6,"formTitle":"[2072]赢得比赛的大学","frequency":0.0,"frontendQuestionId":"2072","leaf":true,"level":1,"nodeType":"def","questionId":"2214","status":"","submitted":418,"title":"赢得比赛的大学","titleSlug":"the-winner-university"},{"acceptance":0.6146230007616146,"acs":6456,"articleLive":2,"columnArticles":96,"formTitle":"[2073]买票需要的时间","frequency":0.0,"frontendQuestionId":"2073","leaf":true,"level":1,"nodeType":"def","questionId":"2195","status":"","submitted":10504,"title":"买票需要的时间","titleSlug":"time-needed-to-buy-tickets"},{"acceptance":0.417162800246356,"acs":4064,"articleLive":2,"columnArticles":117,"formTitle":"[2074]反转偶数长度组的节点","frequency":0.988662914,"frontendQuestionId":"2074","leaf":true,"level":2,"nodeType":"def","questionId":"2196","status":"","submitted":9742,"title":"反转偶数长度组的节点","titleSlug":"reverse-nodes-in-even-length-groups"},{"acceptance":0.4594407530454042,"acs":3319,"articleLive":2,"columnArticles":65,"formTitle":"[2075]解码斜向换位密码","frequency":0.4716067405,"frontendQuestionId":"2075","leaf":true,"level":2,"nodeType":"def","questionId":"2197","status":"","submitted":7224,"title":"解码斜向换位密码","titleSlug":"decode-the-slanted-ciphertext"},{"acceptance":0.49314285714285716,"acs":2589,"articleLive":2,"columnArticles":68,"formTitle":"[2076]处理含限制条件的好友请求","frequency":0.0,"frontendQuestionId":"2076","leaf":true,"level":3,"nodeType":"def","questionId":"2198","status":"","submitted":5250,"title":"处理含限制条件的好友请求","titleSlug":"process-restricted-friend-requests"},{"acceptance":0.6493506493506493,"acs":50,"articleLive":2,"columnArticles":4,"formTitle":"[2077]Paths in Maze That Lead to Same Room","frequency":0.0,"frontendQuestionId":"2077","leaf":true,"level":2,"nodeType":"def","questionId":"2218","status":"","submitted":77,"title":"Paths in Maze That Lead to Same Room","titleSlug":"paths-in-maze-that-lead-to-same-room"},{"acceptance":0.7525298988040479,"acs":6544,"articleLive":2,"columnArticles":88,"formTitle":"[2078]两栋颜色不同且距离最远的房子","frequency":0.3688470065,"frontendQuestionId":"2078","leaf":true,"level":1,"nodeType":"def","questionId":"2199","status":"","submitted":8696,"title":"两栋颜色不同且距离最远的房子","titleSlug":"two-furthest-houses-with-different-colors"},{"acceptance":0.7718392408596149,"acs":5531,"articleLive":2,"columnArticles":103,"formTitle":"[2079]给植物浇水","frequency":0.0,"frontendQuestionId":"2079","leaf":true,"level":2,"nodeType":"def","questionId":"1310","status":"","submitted":7166,"title":"给植物浇水","titleSlug":"watering-plants"},{"acceptance":0.26878456033828474,"acs":4958,"articleLive":2,"columnArticles":134,"formTitle":"[2080]区间内查询数字的频率","frequency":0.4181180555,"frontendQuestionId":"2080","leaf":true,"level":2,"nodeType":"def","questionId":"1294","status":"","submitted":18446,"title":"区间内查询数字的频率","titleSlug":"range-frequency-queries"},{"acceptance":0.40721370604147883,"acs":2258,"articleLive":2,"columnArticles":64,"formTitle":"[2081]k 镜像数字的和","frequency":0.0,"frontendQuestionId":"2081","leaf":true,"level":3,"nodeType":"def","questionId":"2202","status":"","submitted":5545,"title":"k 镜像数字的和","titleSlug":"sum-of-k-mirror-numbers"},{"acceptance":0.774617067833698,"acs":354,"articleLive":2,"columnArticles":10,"formTitle":"[2082]富有客户的数量","frequency":0.0,"frontendQuestionId":"2082","leaf":true,"level":1,"nodeType":"def","questionId":"2223","status":"","submitted":457,"title":"富有客户的数量","titleSlug":"the-number-of-rich-customers"},{"acceptance":0.6783216783216783,"acs":97,"articleLive":2,"columnArticles":8,"formTitle":"[2083]求以相同字母开头和结尾的子串总数","frequency":0.0,"frontendQuestionId":"2083","leaf":true,"level":2,"nodeType":"def","questionId":"2225","status":"","submitted":143,"title":"求以相同字母开头和结尾的子串总数","titleSlug":"substrings-that-begin-and-end-with-the-same-letter"},{"acceptance":0.8256880733944955,"acs":180,"articleLive":2,"columnArticles":9,"formTitle":"[2084]为订单类型为 0 的客户删除类型为 1 的订单","frequency":0.0,"frontendQuestionId":"2084","leaf":true,"level":2,"nodeType":"def","questionId":"2224","status":"","submitted":218,"title":"为订单类型为 0 的客户删除类型为 1 的订单","titleSlug":"drop-type-1-orders-for-customers-with-type-0-orders"},{"acceptance":0.7359905288082084,"acs":3730,"articleLive":2,"columnArticles":61,"formTitle":"[2085]统计出现过一次的公共字符串","frequency":0.0,"frontendQuestionId":"2085","leaf":true,"level":1,"nodeType":"def","questionId":"2190","status":"ac","submitted":5068,"title":"统计出现过一次的公共字符串","titleSlug":"count-common-words-with-one-occurrence"},{"acceptance":0.44745815251084936,"acs":2887,"articleLive":2,"columnArticles":67,"formTitle":"[2086]从房屋收集雨水需要的最少水桶数","frequency":0.0,"frontendQuestionId":"2086","leaf":true,"level":2,"nodeType":"def","questionId":"2191","status":"ac","submitted":6452,"title":"从房屋收集雨水需要的最少水桶数","titleSlug":"minimum-number-of-buckets-required-to-collect-rainwater-from-houses"},{"acceptance":0.46609825416159156,"acs":2296,"articleLive":2,"columnArticles":58,"formTitle":"[2087]网格图中机器人回家的最小代价","frequency":0.4442975611,"frontendQuestionId":"2087","leaf":true,"level":2,"nodeType":"def","questionId":"2192","status":"ac","submitted":4926,"title":"网格图中机器人回家的最小代价","titleSlug":"minimum-cost-homecoming-of-a-robot-in-a-grid"},{"acceptance":0.6175670423630004,"acs":1589,"articleLive":2,"columnArticles":43,"formTitle":"[2088]统计农场中肥沃金字塔的数目","frequency":0.0,"frontendQuestionId":"2088","leaf":true,"level":3,"nodeType":"def","questionId":"2193","status":"","submitted":2573,"title":"统计农场中肥沃金字塔的数目","titleSlug":"count-fertile-pyramids-in-a-land"},{"acceptance":0.8403859567542432,"acs":7229,"articleLive":2,"columnArticles":82,"formTitle":"[2089]找出数组排序后的目标下标","frequency":0.8807415775,"frontendQuestionId":"2089","leaf":true,"level":1,"nodeType":"def","questionId":"2210","status":"","submitted":8602,"title":"找出数组排序后的目标下标","titleSlug":"find-target-indices-after-sorting-array"},{"acceptance":0.3475481107346078,"acs":5436,"articleLive":2,"columnArticles":89,"formTitle":"[2090]半径为 k 的子数组平均值","frequency":0.3688470065,"frontendQuestionId":"2090","leaf":true,"level":2,"nodeType":"def","questionId":"2211","status":"","submitted":15641,"title":"半径为 k 的子数组平均值","titleSlug":"k-radius-subarray-averages"},{"acceptance":0.5711851772974124,"acs":5364,"articleLive":2,"columnArticles":108,"formTitle":"[2091]从数组中移除最大值和最小值","frequency":0.0,"frontendQuestionId":"2091","leaf":true,"level":2,"nodeType":"def","questionId":"2212","status":"","submitted":9391,"title":"从数组中移除最大值和最小值","titleSlug":"removing-minimum-and-maximum-from-array"},{"acceptance":0.2648743346135705,"acs":3931,"articleLive":2,"columnArticles":108,"formTitle":"[2092]找出知晓秘密的所有专家","frequency":0.4716067405,"frontendQuestionId":"2092","leaf":true,"level":3,"nodeType":"def","questionId":"2213","status":"","submitted":14841,"title":"找出知晓秘密的所有专家","titleSlug":"find-all-people-with-secret"},{"acceptance":0.6461538461538462,"acs":42,"articleLive":2,"columnArticles":3,"formTitle":"[2093]Minimum Cost to Reach City With Discounts","frequency":0.0,"frontendQuestionId":"2093","leaf":true,"level":2,"nodeType":"def","questionId":"2230","status":"","submitted":65,"title":"Minimum Cost to Reach City With Discounts","titleSlug":"minimum-cost-to-reach-city-with-discounts"},{"acceptance":0.5518152978498414,"acs":6262,"articleLive":2,"columnArticles":104,"formTitle":"[2094]找出 3 位偶数","frequency":0.0760722799,"frontendQuestionId":"2094","leaf":true,"level":1,"nodeType":"def","questionId":"2215","status":"","submitted":11348,"title":"找出 3 位偶数","titleSlug":"finding-3-digit-even-numbers"},{"acceptance":0.596066105647369,"acs":5879,"articleLive":2,"columnArticles":92,"formTitle":"[2095]删除链表的中间节点","frequency":0.0,"frontendQuestionId":"2095","leaf":true,"level":2,"nodeType":"def","questionId":"2216","status":"","submitted":9863,"title":"删除链表的中间节点","titleSlug":"delete-the-middle-node-of-a-linked-list"},{"acceptance":0.40665184182538916,"acs":4206,"articleLive":2,"columnArticles":152,"formTitle":"[2096]从二叉树一个节点到另一个节点每一步的方向","frequency":0.1531289197,"frontendQuestionId":"2096","leaf":true,"level":2,"nodeType":"def","questionId":"2217","status":"","submitted":10343,"title":"从二叉树一个节点到另一个节点每一步的方向","titleSlug":"step-by-step-directions-from-a-binary-tree-node-to-another"},{"acceptance":0.33851055356431703,"acs":1700,"articleLive":2,"columnArticles":45,"formTitle":"[2097]合法重新排列数对","frequency":0.3929911054,"frontendQuestionId":"2097","leaf":true,"level":3,"nodeType":"def","questionId":"2201","status":"","submitted":5022,"title":"合法重新排列数对","titleSlug":"valid-arrangement-of-pairs"},{"acceptance":0.41379310344827586,"acs":36,"articleLive":2,"columnArticles":2,"formTitle":"[2098]Subsequence of Size K With the Largest Even Sum","frequency":0.988662914,"frontendQuestionId":"2098","leaf":true,"level":2,"nodeType":"def","questionId":"2242","status":"","submitted":87,"title":"Subsequence of Size K With the Largest Even Sum","titleSlug":"subsequence-of-size-k-with-the-largest-even-sum"},{"acceptance":0.4904642904116796,"acs":3729,"articleLive":2,"columnArticles":86,"formTitle":"[2099]找到和最大的长度为 K 的子序列","frequency":0.280916934,"frontendQuestionId":"2099","leaf":true,"level":1,"nodeType":"def","questionId":"2204","status":"ac","submitted":7603,"title":"找到和最大的长度为 K 的子序列","titleSlug":"find-subsequence-of-length-k-with-the-largest-sum"},{"acceptance":0.35521978021978023,"acs":2586,"articleLive":2,"columnArticles":56,"formTitle":"[2100]适合打劫银行的日子","frequency":0.0,"frontendQuestionId":"2100","leaf":true,"level":2,"nodeType":"def","questionId":"2205","status":"ac","submitted":7280,"title":"适合打劫银行的日子","titleSlug":"find-good-days-to-rob-the-bank"},{"acceptance":0.37234716503009185,"acs":2351,"articleLive":2,"columnArticles":60,"formTitle":"[2101]引爆最多的炸弹","frequency":0.0,"frontendQuestionId":"2101","leaf":true,"level":2,"nodeType":"def","questionId":"2206","status":"notac","submitted":6314,"title":"引爆最多的炸弹","titleSlug":"detonate-the-maximum-bombs"},{"acceptance":0.5299705207992139,"acs":1618,"articleLive":2,"columnArticles":56,"formTitle":"[2102]序列顺序查询","frequency":0.0,"frontendQuestionId":"2102","leaf":true,"level":3,"nodeType":"def","questionId":"2207","status":"","submitted":3053,"title":"序列顺序查询","titleSlug":"sequentially-ordinal-rank-tracker"},{"acceptance":0.8110309829059829,"acs":6073,"articleLive":2,"columnArticles":108,"formTitle":"[2103]环和杆","frequency":0.1146005998,"frontendQuestionId":"2103","leaf":true,"level":1,"nodeType":"def","questionId":"2226","status":"","submitted":7488,"title":"环和杆","titleSlug":"rings-and-rods"},{"acceptance":0.5574529029415005,"acs":5060,"articleLive":2,"columnArticles":89,"formTitle":"[2104]子数组范围和","frequency":0.0,"frontendQuestionId":"2104","leaf":true,"level":2,"nodeType":"def","questionId":"2227","status":"","submitted":9077,"title":"子数组范围和","titleSlug":"sum-of-subarray-ranges"},{"acceptance":0.5489021956087824,"acs":4400,"articleLive":2,"columnArticles":75,"formTitle":"[2105]给植物浇水 II","frequency":0.1837873601,"frontendQuestionId":"2105","leaf":true,"level":2,"nodeType":"def","questionId":"2228","status":"","submitted":8016,"title":"给植物浇水 II","titleSlug":"watering-plants-ii"},{"acceptance":0.31618556701030925,"acs":3067,"articleLive":2,"columnArticles":74,"formTitle":"[2106]摘水果","frequency":1.1853732082,"frontendQuestionId":"2106","leaf":true,"level":3,"nodeType":"def","questionId":"2229","status":"","submitted":9700,"title":"摘水果","titleSlug":"maximum-fruits-harvested-after-at-most-k-steps"},{"acceptance":0.5789473684210527,"acs":44,"articleLive":2,"columnArticles":5,"formTitle":"[2107]Number of Unique Flavors After Sharing K Candies","frequency":0.0,"frontendQuestionId":"2107","leaf":true,"level":2,"nodeType":"def","questionId":"2247","status":"","submitted":76,"title":"Number of Unique Flavors After Sharing K Candies","titleSlug":"number-of-unique-flavors-after-sharing-k-candies"},{"acceptance":0.8196764091858038,"acs":6282,"articleLive":2,"columnArticles":79,"formTitle":"[2108]找出数组中的第一个回文字符串","frequency":0.0,"frontendQuestionId":"2108","leaf":true,"level":1,"nodeType":"def","questionId":"2231","status":"ac","submitted":7664,"title":"找出数组中的第一个回文字符串","titleSlug":"find-first-palindromic-string-in-the-array"},{"acceptance":0.6079817085844939,"acs":5850,"articleLive":2,"columnArticles":74,"formTitle":"[2109]向字符串添加空格","frequency":0.0,"frontendQuestionId":"2109","leaf":true,"level":2,"nodeType":"def","questionId":"2232","status":"ac","submitted":9622,"title":"向字符串添加空格","titleSlug":"adding-spaces-to-a-string"},{"acceptance":0.4990270652750752,"acs":5642,"articleLive":2,"columnArticles":102,"formTitle":"[2110]股票平滑下跌阶段的数目","frequency":0.0,"frontendQuestionId":"2110","leaf":true,"level":2,"nodeType":"def","questionId":"2233","status":"ac","submitted":11306,"title":"股票平滑下跌阶段的数目","titleSlug":"number-of-smooth-descent-periods-of-a-stock"},{"acceptance":0.3177108090122635,"acs":3342,"articleLive":2,"columnArticles":82,"formTitle":"[2111]使数组 K 递增的最少操作次数","frequency":0.0,"frontendQuestionId":"2111","leaf":true,"level":3,"nodeType":"def","questionId":"2234","status":"notac","submitted":10519,"title":"使数组 K 递增的最少操作次数","titleSlug":"minimum-operations-to-make-the-array-k-increasing"},{"acceptance":0.780952380952381,"acs":82,"articleLive":2,"columnArticles":4,"formTitle":"[2112]The Airport With the Most Traffic","frequency":0.0,"frontendQuestionId":"2112","leaf":true,"level":2,"nodeType":"def","questionId":"2252","status":"","submitted":105,"title":"The Airport With the Most Traffic","titleSlug":"the-airport-with-the-most-traffic"},{"acceptance":0.9122807017543859,"acs":52,"articleLive":2,"columnArticles":4,"formTitle":"[2113]Elements in Array After Removing and Replacing Elements","frequency":0.0,"frontendQuestionId":"2113","leaf":true,"level":2,"nodeType":"def","questionId":"2258","status":"","submitted":57,"title":"Elements in Array After Removing and Replacing Elements","titleSlug":"elements-in-array-after-removing-and-replacing-elements"},{"acceptance":0.9047395588925388,"acs":3856,"articleLive":2,"columnArticles":53,"formTitle":"[2114]句子中的最多单词数","frequency":0.0,"frontendQuestionId":"2114","leaf":true,"level":1,"nodeType":"def","questionId":"2219","status":"ac","submitted":4262,"title":"句子中的最多单词数","titleSlug":"maximum-number-of-words-found-in-sentences"},{"acceptance":0.350439322551891,"acs":2752,"articleLive":2,"columnArticles":73,"formTitle":"[2115]从给定原材料中找到所有可以做出的菜","frequency":0.0,"frontendQuestionId":"2115","leaf":true,"level":2,"nodeType":"def","questionId":"2220","status":"ac","submitted":7853,"title":"从给定原材料中找到所有可以做出的菜","titleSlug":"find-all-possible-recipes-from-given-supplies"},{"acceptance":0.26429720637706594,"acs":1807,"articleLive":2,"columnArticles":43,"formTitle":"[2116]判断一个括号字符串是否有效","frequency":0.6284711262,"frontendQuestionId":"2116","leaf":true,"level":2,"nodeType":"def","questionId":"2221","status":"ac","submitted":6837,"title":"判断一个括号字符串是否有效","titleSlug":"check-if-a-parentheses-string-can-be-valid"},{"acceptance":0.3628727425451491,"acs":864,"articleLive":2,"columnArticles":13,"formTitle":"[2117]一个区间内所有数乘积的缩写","frequency":0.0,"frontendQuestionId":"2117","leaf":true,"level":3,"nodeType":"def","questionId":"2222","status":"","submitted":2381,"title":"一个区间内所有数乘积的缩写","titleSlug":"abbreviating-the-product-of-a-range"},{"acceptance":0.6,"acs":36,"articleLive":2,"columnArticles":1,"formTitle":"[2118]Build the Equation","frequency":0.0,"frontendQuestionId":"2118","leaf":true,"level":3,"nodeType":"def","questionId":"2253","status":"","submitted":60,"title":"Build the Equation","titleSlug":"build-the-equation"},{"acceptance":0.8043710021321961,"acs":6036,"articleLive":2,"columnArticles":47,"formTitle":"[2119]反转两次的数字","frequency":0.0,"frontendQuestionId":"2119","leaf":true,"level":1,"nodeType":"def","questionId":"2238","status":"ac","submitted":7504,"title":"反转两次的数字","titleSlug":"a-number-after-a-double-reversal"},{"acceptance":0.8261685431593313,"acs":4843,"articleLive":2,"columnArticles":64,"formTitle":"[2120]执行所有后缀指令","frequency":1.0700913973,"frontendQuestionId":"2120","leaf":true,"level":2,"nodeType":"def","questionId":"2239","status":"ac","submitted":5862,"title":"执行所有后缀指令","titleSlug":"execution-of-all-suffix-instructions-staying-in-a-grid"},{"acceptance":0.33666666666666667,"acs":3838,"articleLive":2,"columnArticles":113,"formTitle":"[2121]相同元素的间隔之和","frequency":0.7230058535,"frontendQuestionId":"2121","leaf":true,"level":2,"nodeType":"def","questionId":"2240","status":"ac","submitted":11400,"title":"相同元素的间隔之和","titleSlug":"intervals-between-identical-elements"},{"acceptance":0.392991239048811,"acs":2512,"articleLive":2,"columnArticles":50,"formTitle":"[2122]还原原数组","frequency":0.0,"frontendQuestionId":"2122","leaf":true,"level":3,"nodeType":"def","questionId":"2241","status":"notac","submitted":6392,"title":"还原原数组","titleSlug":"recover-the-original-array"},{"acceptance":0.3076923076923077,"acs":8,"articleLive":2,"columnArticles":1,"formTitle":"[2123]Minimum Operations to Remove Adjacent Ones in Matrix","frequency":0.0,"frontendQuestionId":"2123","leaf":true,"level":3,"nodeType":"def","questionId":"2259","status":"","submitted":26,"title":"Minimum Operations to Remove Adjacent Ones in Matrix","titleSlug":"minimum-operations-to-remove-adjacent-ones-in-matrix"},{"acceptance":0.8451117770937956,"acs":83470,"articleLive":2,"columnArticles":642,"formTitle":"[LCP 01]猜数字","frequency":0.4442975611,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","submitted":98768,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.691415089797294,"acs":14360,"articleLive":2,"columnArticles":247,"formTitle":"[LCP 02]分式化简","frequency":1.3805429075,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","submitted":20769,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.22152243800642965,"acs":11783,"articleLive":2,"columnArticles":188,"formTitle":"[LCP 03]机器人大冒险","frequency":0.5001312072,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","submitted":53191,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.38587401145350425,"acs":2830,"articleLive":2,"columnArticles":64,"formTitle":"[LCP 04]覆盖","frequency":0.0,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","submitted":7334,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.20256122639745747,"acs":2167,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","submitted":10698,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.8392912822582125,"acs":45759,"articleLive":2,"columnArticles":692,"formTitle":"[LCP 06]拿硬币","frequency":0.4716067405,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"1000056","status":"","submitted":54521,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7662571784340327,"acs":41230,"articleLive":2,"columnArticles":493,"formTitle":"[LCP 07]传递信息","frequency":2.4526082093,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"1000063","status":"ac","submitted":53807,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.29315263908701855,"acs":5343,"articleLive":2,"columnArticles":109,"formTitle":"[LCP 08]剧情触发时间","frequency":1.1490055641,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"1000057","status":"","submitted":18226,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.28032979976442873,"acs":6902,"articleLive":2,"columnArticles":112,"formTitle":"[LCP 09]最小跳跃次数","frequency":2.1761588888,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"1000090","status":"","submitted":24621,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5900452488687783,"acs":1956,"articleLive":2,"columnArticles":39,"formTitle":"[LCP 10]二叉树任务调度","frequency":1.9057438474,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"1000062","status":"","submitted":3315,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6940093040919016,"acs":7310,"articleLive":2,"columnArticles":74,"formTitle":"[LCP 11]期望个数统计","frequency":1.0182071603,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"1000086","status":"","submitted":10533,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.41567230632235086,"acs":7002,"articleLive":2,"columnArticles":115,"formTitle":"[LCP 12]小张刷题计划","frequency":0.5299663557,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"1000087","status":"","submitted":16845,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6114955786236063,"acs":9543,"articleLive":2,"columnArticles":86,"formTitle":"[LCP 13]寻宝","frequency":0.0,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"1000093","status":"","submitted":15606,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.21562312762133012,"acs":2879,"articleLive":2,"columnArticles":45,"formTitle":"[LCP 14]切分数组","frequency":1.8234606116,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"1000059","status":"","submitted":13352,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5830280830280831,"acs":955,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 15]游乐园的迷宫","frequency":1.114219448,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"1000088","status":"","submitted":1638,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.3134191176470588,"acs":682,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 16]游乐园的游览计划","frequency":1.0489221055,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"1000085","status":"","submitted":2176,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7988430017676362,"acs":24856,"articleLive":2,"columnArticles":270,"formTitle":"[LCP 17]速算机器人","frequency":0.4442975611,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"1000139","status":"","submitted":31115,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.2903497026126491,"acs":18648,"articleLive":2,"columnArticles":249,"formTitle":"[LCP 18]早餐组合","frequency":1.6786996721,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"1000146","status":"ac","submitted":64226,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5171171638116464,"acs":19954,"articleLive":2,"columnArticles":206,"formTitle":"[LCP 19]秋叶收藏集","frequency":1.114219448,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"1000130","status":"","submitted":38587,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.3202888814242526,"acs":1907,"articleLive":2,"columnArticles":34,"formTitle":"[LCP 20]快速公交","frequency":0.0,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"1000133","status":"","submitted":5954,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.33227959255356515,"acs":946,"articleLive":2,"columnArticles":27,"formTitle":"[LCP 21]追逐游戏","frequency":0.0,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"1000134","status":"","submitted":2847,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.3360188713482127,"acs":9259,"articleLive":2,"columnArticles":190,"formTitle":"[LCP 22]黑白方格画","frequency":0.0,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"1000140","status":"ac","submitted":27555,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.3411808209047208,"acs":2768,"articleLive":2,"columnArticles":56,"formTitle":"[LCP 23]魔术排列","frequency":0.0,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"1000058","status":"","submitted":8113,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.28751465416178196,"acs":981,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"1000131","status":"","submitted":3412,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.33864434242506075,"acs":1254,"articleLive":2,"columnArticles":30,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"1000138","status":"","submitted":3703,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.3448471121177803,"acs":609,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 26]导航装置","frequency":1.114219448,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"1000132","status":"","submitted":1766,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.32812105926860025,"acs":1301,"articleLive":2,"columnArticles":26,"formTitle":"[LCP 27]黑盒光线反射","frequency":0.0,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"1000147","status":"","submitted":3965,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.28897969291728576,"acs":11669,"articleLive":2,"columnArticles":190,"formTitle":"[LCP 28]采购方案","frequency":0.4442975611,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"1000215","status":"ac","submitted":40380,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.19261213720316622,"acs":5694,"articleLive":2,"columnArticles":134,"formTitle":"[LCP 29]乐团站位","frequency":1.4125900849,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"1000216","status":"ac","submitted":29562,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.3558504221954162,"acs":6195,"articleLive":2,"columnArticles":108,"formTitle":"[LCP 30]魔塔游戏","frequency":0.0,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"1000224","status":"ac","submitted":17409,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.25685071574642127,"acs":1884,"articleLive":2,"columnArticles":38,"formTitle":"[LCP 31]变换的迷宫","frequency":1.9057438474,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"1000218","status":"","submitted":7335,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.4154228855721393,"acs":1169,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 32]批量处理任务","frequency":1.3054212505,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"1000219","status":"","submitted":2814,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.22595581426114567,"acs":5124,"articleLive":2,"columnArticles":88,"formTitle":"[LCP 33]蓄水","frequency":1.0808941382,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"1000221","status":"","submitted":22677,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.5003675119441382,"acs":2723,"articleLive":2,"columnArticles":65,"formTitle":"[LCP 34]二叉树染色","frequency":1.9963034245,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"1000089","status":"","submitted":5442,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.41442006269592474,"acs":1322,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 35]电动车游城市","frequency":1.1490055641,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"1000220","status":"","submitted":3190,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.2741635687732342,"acs":885,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 36]最多牌组数","frequency":2.9339190408,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"1000222","status":"notac","submitted":3228,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.19986263736263737,"acs":873,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 37]最小矩形面积","frequency":0.7030490946,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"1000091","status":"","submitted":4368,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5701849836779108,"acs":524,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 38]守卫城堡","frequency":0.0,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"1000223","status":"","submitted":919,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5139498990858364,"acs":4329,"articleLive":2,"columnArticles":33,"formTitle":"[LCP 39]无人机方阵","frequency":0.4181180555,"frontendQuestionId":"LCP 39","leaf":true,"level":1,"nodeType":"def","questionId":"1000369","status":"ac","submitted":8423,"title":"无人机方阵","titleSlug":"0jQkd0"},{"acceptance":0.2534423407917384,"acs":3534,"articleLive":2,"columnArticles":74,"formTitle":"[LCP 40]心算挑战","frequency":0.0,"frontendQuestionId":"LCP 40","leaf":true,"level":1,"nodeType":"def","questionId":"1000368","status":"ac","submitted":13944,"title":"心算挑战","titleSlug":"uOAnQW"},{"acceptance":0.43381906496660594,"acs":1429,"articleLive":2,"columnArticles":30,"formTitle":"[LCP 41]黑白翻转棋","frequency":0.6284711262,"frontendQuestionId":"LCP 41","leaf":true,"level":2,"nodeType":"def","questionId":"1000370","status":"","submitted":3294,"title":"黑白翻转棋","titleSlug":"fHi6rV"},{"acceptance":0.2083941605839416,"acs":1142,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 42]玩具套圈","frequency":0.0,"frontendQuestionId":"LCP 42","leaf":true,"level":3,"nodeType":"def","questionId":"1000371","status":"notac","submitted":5480,"title":"玩具套圈","titleSlug":"vFjcfV"},{"acceptance":0.42910101946246526,"acs":463,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 43]十字路口的交通","frequency":0.0,"frontendQuestionId":"LCP 43","leaf":true,"level":3,"nodeType":"def","questionId":"1000367","status":"","submitted":1079,"title":"十字路口的交通","titleSlug":"Y1VbOX"},{"acceptance":0.8171611868484362,"acs":4076,"articleLive":2,"columnArticles":56,"formTitle":"[LCP 44]开幕式焰火","frequency":0.0,"frontendQuestionId":"LCP 44","leaf":true,"level":1,"nodeType":"def","questionId":"1000362","status":"ac","submitted":4988,"title":"开幕式焰火","titleSlug":"sZ59z6"},{"acceptance":0.20574482297929192,"acs":1232,"articleLive":2,"columnArticles":31,"formTitle":"[LCP 45]自行车炫技赛场","frequency":0.0,"frontendQuestionId":"LCP 45","leaf":true,"level":2,"nodeType":"def","questionId":"1000375","status":"notac","submitted":5988,"title":"自行车炫技赛场","titleSlug":"kplEvH"},{"acceptance":0.39187056037884765,"acs":993,"articleLive":2,"columnArticles":25,"formTitle":"[LCP 46]志愿者调配","frequency":0.0,"frontendQuestionId":"LCP 46","leaf":true,"level":2,"nodeType":"def","questionId":"1000373","status":"notac","submitted":2534,"title":"志愿者调配","titleSlug":"05ZEDJ"},{"acceptance":0.36643414033647925,"acs":893,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 47]入场安检","frequency":0.0,"frontendQuestionId":"LCP 47","leaf":true,"level":3,"nodeType":"def","questionId":"1000361","status":"","submitted":2437,"title":"入场安检","titleSlug":"oPs9Bm"},{"acceptance":0.17623956799214532,"acs":359,"articleLive":2,"columnArticles":10,"formTitle":"[LCP 48]无限棋局","frequency":0.988662914,"frontendQuestionId":"LCP 48","leaf":true,"level":3,"nodeType":"def","questionId":"1000374","status":"","submitted":2037,"title":"无限棋局","titleSlug":"fsa7oZ"},{"acceptance":0.2501776830135039,"acs":352,"articleLive":2,"columnArticles":10,"formTitle":"[LCP 49]环形闯关游戏","frequency":0.0,"frontendQuestionId":"LCP 49","leaf":true,"level":3,"nodeType":"def","questionId":"1000359","status":"","submitted":1407,"title":"环形闯关游戏","titleSlug":"K8GULz"},{"acceptance":0.5428543151227236,"acs":5485,"articleLive":2,"columnArticles":117,"formTitle":"[LCS 01]下载插件","frequency":1.8554735886,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","questionId":"1000225","status":"ac","submitted":10104,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.6743083003952569,"acs":4265,"articleLive":2,"columnArticles":82,"formTitle":"[LCS 02]完成一半题目","frequency":1.0808941382,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","questionId":"1000226","status":"","submitted":6325,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.4095315024232633,"acs":2028,"articleLive":2,"columnArticles":65,"formTitle":"[LCS 03]主题空间","frequency":1.3805429075,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","questionId":"1000227","status":"","submitted":4952,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.678591673872836,"acs":446514,"articleLive":2,"columnArticles":3026,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":4.1579355259,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"100275","status":"ac","submitted":658001,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.4030424822704764,"acs":293822,"articleLive":2,"columnArticles":2322,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":3.3817263258,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"100276","status":"","submitted":729010,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.7599152078774617,"acs":333390,"articleLive":2,"columnArticles":2163,"formTitle":"[剑指 Offer 05]替换空格","frequency":3.3996473789,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"100280","status":"","submitted":438720,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7498656479652951,"acs":347439,"articleLive":2,"columnArticles":2335,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":3.5881970272,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"100282","status":"ac","submitted":463335,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6995262557270908,"acs":206575,"articleLive":2,"columnArticles":1548,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":3.1205581437,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"100283","status":"","submitted":295307,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7131676012146446,"acs":310715,"articleLive":2,"columnArticles":1920,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":4.6396172696,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"100273","status":"ac","submitted":435683,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.36082258447513177,"acs":294787,"articleLive":2,"columnArticles":1998,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":3.651250741,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"100274","status":"ac","submitted":816986,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.44708573560815157,"acs":220462,"articleLive":2,"columnArticles":1430,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":3.1663746771,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"100277","status":"","submitted":493109,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.4924355144168913,"acs":293561,"articleLive":2,"columnArticles":1781,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":3.9779703622,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"100278","status":"","submitted":596141,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.45267166915531026,"acs":191596,"articleLive":2,"columnArticles":1250,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":2.8160133283,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"100279","status":"","submitted":423256,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5286376963574884,"acs":197609,"articleLive":2,"columnArticles":1853,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":3.5669015036,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"100281","status":"","submitted":373808,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.5706049495572856,"acs":172903,"articleLive":2,"columnArticles":1420,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":2.8160133283,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"100284","status":"","submitted":303017,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.3141789575829572,"acs":90979,"articleLive":2,"columnArticles":524,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":0.3232602621,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"100285","status":"","submitted":289577,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7481954026973616,"acs":215802,"articleLive":2,"columnArticles":1347,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":1.5260111533,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"100292","status":"ac","submitted":288430,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.3416966066373367,"acs":137238,"articleLive":2,"columnArticles":832,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":1.2634159152,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"100295","status":"","submitted":401637,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.7782476966012922,"acs":162853,"articleLive":2,"columnArticles":1186,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":2.9112326857,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"100296","status":"","submitted":209256,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.5978347853230795,"acs":210671,"articleLive":2,"columnArticles":1596,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":2.2342333317,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"100299","status":"ac","submitted":352390,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.3802283145320798,"acs":73243,"articleLive":2,"columnArticles":481,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":2.5805565168,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"100297","status":"","submitted":192629,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.24542732755752902,"acs":84843,"articleLive":2,"columnArticles":930,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":2.8514701779,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"100290","status":"","submitted":345695,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.644927536231884,"acs":217961,"articleLive":2,"columnArticles":1799,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":2.7327185853,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"100291","status":"","submitted":337962,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7989444661059433,"acs":286869,"articleLive":2,"columnArticles":2619,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":4.0164986821,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"100294","status":"ac","submitted":359060,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7424852007487404,"acs":332003,"articleLive":2,"columnArticles":2017,"formTitle":"[剑指 Offer 24]反转链表","frequency":4.1141542148,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"100298","status":"ac","submitted":447151,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7275512584386239,"acs":208968,"articleLive":2,"columnArticles":1300,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":3.4598188209,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"100286","status":"","submitted":287221,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.4663754750273342,"acs":166781,"articleLive":2,"columnArticles":1347,"formTitle":"[剑指 Offer 26]树的子结构","frequency":3.539013472,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"100287","status":"","submitted":357611,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7928910092392547,"acs":215059,"articleLive":2,"columnArticles":1551,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":2.3770115678,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"100288","status":"","submitted":271234,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5790988156290651,"acs":170057,"articleLive":2,"columnArticles":1226,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":2.1861459886,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"100289","status":"","submitted":293658,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.4394878252177323,"acs":159157,"articleLive":2,"columnArticles":1584,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":3.4390544942,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"100293","status":"","submitted":362142,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.5603304612984434,"acs":173833,"articleLive":2,"columnArticles":1151,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":3.1205581437,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"100302","status":"ac","submitted":310233,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6167523575255963,"acs":125115,"articleLive":2,"columnArticles":1044,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":2.1761588888,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"100306","status":"","submitted":202861,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.6406795202622653,"acs":157907,"articleLive":2,"columnArticles":1107,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":2.2849502823,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100311","status":"","submitted":246468,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.6880253257074422,"acs":156265,"articleLive":2,"columnArticles":1227,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":2.157944776,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100312","status":"","submitted":227121,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5885329337504617,"acs":138646,"articleLive":2,"columnArticles":1294,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":2.3385896309,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"100314","status":"","submitted":235579,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.5549920231351056,"acs":126279,"articleLive":2,"columnArticles":1058,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":2.3954958944,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"100315","status":"","submitted":227533,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5801263841382109,"acs":150099,"articleLive":2,"columnArticles":964,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":2.8836066195,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"100317","status":"","submitted":258735,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7184111567675259,"acs":144239,"articleLive":2,"columnArticles":995,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":2.6439160053,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"100300","status":"ac","submitted":200775,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6538819102429306,"acs":118163,"articleLive":2,"columnArticles":1023,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":3.1340773438,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"100305","status":"","submitted":180710,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.563420083248002,"acs":84735,"articleLive":2,"columnArticles":601,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":2.6984412663,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"100307","status":"ac","submitted":150394,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5802667567111262,"acs":171846,"articleLive":2,"columnArticles":1195,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":3.8224778523,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"100308","status":"ac","submitted":296150,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6938705349969545,"acs":185686,"articleLive":2,"columnArticles":1102,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":1.7925558035,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"100310","status":"ac","submitted":267609,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.5717360564935826,"acs":273331,"articleLive":2,"columnArticles":1933,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":3.3389414794,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"100301","status":"","submitted":478072,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5820304340141083,"acs":72443,"articleLive":2,"columnArticles":529,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":2.112207242,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"100303","status":"","submitted":124466,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.6062702558714279,"acs":245805,"articleLive":2,"columnArticles":1632,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":3.9595550485,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"100304","status":"ac","submitted":405438,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.49043905468093657,"acs":53707,"articleLive":2,"columnArticles":546,"formTitle":"[剑指 Offer 43]1~n 整数中 1 出现的次数","frequency":2.7766672155,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"100309","status":"","submitted":109508,"title":"1~n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.4195134240754989,"acs":61611,"articleLive":2,"columnArticles":516,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":2.4560782663,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"100313","status":"","submitted":146863,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5584402114111514,"acs":123833,"articleLive":2,"columnArticles":917,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":3.2718464213,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"100323","status":"","submitted":221748,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.53073199070488,"acs":137035,"articleLive":2,"columnArticles":1584,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":3.4302169037,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"100325","status":"","submitted":258200,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.6901112935595695,"acs":136170,"articleLive":2,"columnArticles":1121,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":2.42529903,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"100327","status":"","submitted":197316,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.46467882572646724,"acs":171440,"articleLive":2,"columnArticles":1162,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":3.3541635428,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"100332","status":"","submitted":368943,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.6515861716987214,"acs":97029,"articleLive":2,"columnArticles":569,"formTitle":"[剑指 Offer 49]丑数","frequency":2.8836066195,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"100334","status":"","submitted":148912,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.6176637304780551,"acs":177616,"articleLive":2,"columnArticles":1194,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":3.1393861277,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"100316","status":"","submitted":287561,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.4851100449646092,"acs":112742,"articleLive":2,"columnArticles":919,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":3.7763229138,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"100318","status":"","submitted":232405,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.6517698026889817,"acs":193472,"articleLive":2,"columnArticles":1129,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":2.9992086292,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"100326","status":"ac","submitted":296841,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5351853444568676,"acs":217791,"articleLive":2,"columnArticles":1761,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":2.9742483374,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100329","status":"ac","submitted":406945,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.4477229273686393,"acs":194361,"articleLive":2,"columnArticles":1649,"formTitle":"[剑指 Offer 53 - II]0~n-1中缺失的数字","frequency":2.9366413161,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100331","status":"","submitted":434110,"title":"0~n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.7584827915429615,"acs":181131,"articleLive":2,"columnArticles":1268,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":1.8234606116,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"100333","status":"","submitted":238807,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.7904081227488017,"acs":195083,"articleLive":2,"columnArticles":1373,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":2.1803070674,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100319","status":"","submitted":246813,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.5898491987229162,"acs":152233,"articleLive":2,"columnArticles":1017,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":1.2365614551,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100342","status":"","submitted":258088,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.6962125762526933,"acs":126341,"articleLive":2,"columnArticles":1110,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":3.0064602926,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100320","status":"","submitted":181469,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.802845236384538,"acs":100566,"articleLive":2,"columnArticles":758,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":1.6459420757,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100321","status":"","submitted":125262,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.6693589873239623,"acs":152237,"articleLive":2,"columnArticles":940,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":2.6213576886,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"100322","status":"","submitted":227437,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7092205194671988,"acs":152120,"articleLive":2,"columnArticles":1949,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":2.7766672155,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100324","status":"","submitted":214489,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.4427235077412054,"acs":147094,"articleLive":2,"columnArticles":1083,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":2.3047053119,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100328","status":"","submitted":332248,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.858642839200488,"acs":239278,"articleLive":2,"columnArticles":1988,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":2.1184061213,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100330","status":"","submitted":278670,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.44507684963016697,"acs":143572,"articleLive":2,"columnArticles":1276,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":3.0835870647,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"100336","status":"","submitted":322578,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.4762520697737353,"acs":103832,"articleLive":2,"columnArticles":1119,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":2.1803070674,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100337","status":"ac","submitted":218019,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.56532079516206,"acs":72261,"articleLive":2,"columnArticles":640,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":2.761054444,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"100339","status":"","submitted":127823,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.4602616478513067,"acs":118070,"articleLive":2,"columnArticles":1102,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":1.9963034245,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"100341","status":"","submitted":256528,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.6559236684580766,"acs":120097,"articleLive":2,"columnArticles":813,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":3.6308210213,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"100343","status":"","submitted":183096,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.6352001555920107,"acs":150235,"articleLive":2,"columnArticles":1066,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":2.912882715,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"100344","status":"","submitted":236516,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.8569557229052307,"acs":151119,"articleLive":2,"columnArticles":1380,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":2.2098775248,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"100345","status":"","submitted":176344,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.5879387833890577,"acs":80714,"articleLive":2,"columnArticles":557,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":2.5724789284,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"100335","status":"","submitted":137283,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.5990469112053513,"acs":82212,"articleLive":2,"columnArticles":600,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":2.7327185853,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"100338","status":"","submitted":137238,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.28855017279013956,"acs":77068,"articleLive":2,"columnArticles":618,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":1.6786996721,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"100340","status":"","submitted":267087,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.6951518442180062,"acs":131871,"articleLive":2,"columnArticles":766,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":1.748123795,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100346","status":"","submitted":189701,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.70155807212818,"acs":130219,"articleLive":2,"columnArticles":758,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":2.6504607454,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100347","status":"","submitted":185614,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.20672587360307293,"acs":16038,"articleLive":2,"columnArticles":178,"formTitle":"[剑指 Offer II 001]整数除法","frequency":2.9802067653,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","questionId":"1000228","status":"ac","submitted":77581,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5585991541167635,"acs":14132,"articleLive":2,"columnArticles":183,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":1.5839018723,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","questionId":"1000231","status":"ac","submitted":25299,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7852763422965753,"acs":17931,"articleLive":2,"columnArticles":221,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":1.2365614551,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","questionId":"1000230","status":"ac","submitted":22834,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.7012766759315966,"acs":14886,"articleLive":2,"columnArticles":158,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":1.2365614551,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","questionId":"1000233","status":"","submitted":21227,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7138247704144949,"acs":11504,"articleLive":2,"columnArticles":137,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":1.0182071603,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","questionId":"1000236","status":"","submitted":16116,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6441012317167052,"acs":13387,"articleLive":2,"columnArticles":155,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":0.9327824556,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","questionId":"1000237","status":"ac","submitted":20784,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.4477284753193741,"acs":11846,"articleLive":2,"columnArticles":120,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":2.2936786261,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","questionId":"1000239","status":"","submitted":26458,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.49722281110875555,"acs":11727,"articleLive":2,"columnArticles":142,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.9327824556,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","questionId":"1000242","status":"","submitted":23585,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.5534230879404182,"acs":9660,"articleLive":2,"columnArticles":126,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.988662914,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","questionId":"1000244","status":"","submitted":17455,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.44101786316144254,"acs":10468,"articleLive":2,"columnArticles":113,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":1.8234606116,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","questionId":"1000246","status":"","submitted":23736,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5600738059754453,"acs":7892,"articleLive":2,"columnArticles":99,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":1.8774694166,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","questionId":"1000247","status":"","submitted":14091,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.668762663313072,"acs":9572,"articleLive":2,"columnArticles":123,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":0.2608439999,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","questionId":"1000248","status":"","submitted":14313,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6557556462043578,"acs":6591,"articleLive":2,"columnArticles":96,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":0.9602114928,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","questionId":"1000249","status":"","submitted":10051,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5100752455044,"acs":7999,"articleLive":2,"columnArticles":111,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.4181180555,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","questionId":"1000250","status":"","submitted":15682,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.6269306930693069,"acs":6332,"articleLive":2,"columnArticles":93,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.4181180555,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","questionId":"1000251","status":"","submitted":10100,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.4858443139122612,"acs":9181,"articleLive":2,"columnArticles":136,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":1.7058163011,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","questionId":"1000252","status":"","submitted":18897,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.5141757416447615,"acs":5477,"articleLive":2,"columnArticles":85,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.4181180555,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","questionId":"1000253","status":"","submitted":10652,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5204010258801586,"acs":8928,"articleLive":2,"columnArticles":116,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","questionId":"1000254","status":"","submitted":17156,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.4673006134969325,"acs":7617,"articleLive":2,"columnArticles":111,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":1.3496762595,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","questionId":"1000255","status":"","submitted":16300,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.7163693702572189,"acs":7269,"articleLive":2,"columnArticles":100,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":1.1853732082,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","questionId":"1000256","status":"","submitted":10147,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5231377257491621,"acs":10457,"articleLive":2,"columnArticles":139,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":1.8554735886,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","questionId":"1000257","status":"","submitted":19989,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5453407261670542,"acs":12196,"articleLive":2,"columnArticles":111,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":1.7058163011,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","questionId":"1000258","status":"","submitted":22364,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.6970888468809073,"acs":9219,"articleLive":2,"columnArticles":92,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":0.9602114928,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","questionId":"1000259","status":"","submitted":13225,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7394132653061225,"acs":23188,"articleLive":2,"columnArticles":188,"formTitle":"[剑指 Offer II 024]反转链表","frequency":1.9963034245,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","questionId":"1000260","status":"","submitted":31360,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6017879548306148,"acs":7674,"articleLive":2,"columnArticles":130,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":2.3954958944,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","questionId":"1000261","status":"","submitted":12752,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.6626868031944335,"acs":8381,"articleLive":2,"columnArticles":126,"formTitle":"[剑指 Offer II 026]重排链表","frequency":2.0239294907,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","questionId":"1000262","status":"","submitted":12647,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.611824120835843,"acs":13205,"articleLive":2,"columnArticles":153,"formTitle":"[剑指 Offer II 027]回文链表","frequency":1.8234606116,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","questionId":"1000263","status":"","submitted":21583,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6281081081081081,"acs":4648,"articleLive":2,"columnArticles":92,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":0.988662914,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","questionId":"1000264","status":"","submitted":7400,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.30522013746981236,"acs":4929,"articleLive":2,"columnArticles":118,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.3456225535,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","questionId":"1000265","status":"","submitted":16149,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.5474515611501913,"acs":4436,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.3929911054,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","questionId":"1000267","status":"","submitted":8103,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.5451396406148517,"acs":5036,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","questionId":"1000270","status":"","submitted":9238,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.5992548306039338,"acs":6916,"articleLive":2,"columnArticles":103,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","questionId":"1000273","status":"","submitted":11541,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.7656420021762785,"acs":5629,"articleLive":2,"columnArticles":89,"formTitle":"[剑指 Offer II 033]变位词组","frequency":1.0182071603,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","questionId":"1000275","status":"","submitted":7352,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.5721280152854072,"acs":4791,"articleLive":2,"columnArticles":91,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","questionId":"1000276","status":"","submitted":8374,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.6634727437524278,"acs":5124,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.4442975611,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","questionId":"1000278","status":"","submitted":7723,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.5693079657118963,"acs":5446,"articleLive":2,"columnArticles":93,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.3929911054,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","questionId":"1000279","status":"","submitted":9566,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.44430816404752776,"acs":5796,"articleLive":2,"columnArticles":107,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","questionId":"1000281","status":"","submitted":13045,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.7787167797175581,"acs":7003,"articleLive":2,"columnArticles":110,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.4442975611,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","questionId":"1000282","status":"","submitted":8993,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.5055395524041657,"acs":4563,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","questionId":"1000283","status":"","submitted":9026,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.5769580228966018,"acs":3175,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":1.6786996721,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","questionId":"1000284","status":"","submitted":5503,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.7794802647707771,"acs":6359,"articleLive":2,"columnArticles":94,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","questionId":"1000292","status":"","submitted":8158,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.8352272727272727,"acs":5292,"articleLive":2,"columnArticles":76,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.4181180555,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","questionId":"1000293","status":"","submitted":6336,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.6466746863722289,"acs":3763,"articleLive":2,"columnArticles":72,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.9602114928,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","questionId":"1000295","status":"","submitted":5819,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6389604810996563,"acs":5950,"articleLive":2,"columnArticles":110,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.3688470065,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","questionId":"1000297","status":"","submitted":9312,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.804602510460251,"acs":5769,"articleLive":2,"columnArticles":117,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","questionId":"1000298","status":"","submitted":7170,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7203321725154032,"acs":5378,"articleLive":2,"columnArticles":109,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.9063118788,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","questionId":"1000299","status":"","submitted":7466,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.689918533604888,"acs":5420,"articleLive":2,"columnArticles":103,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":1.3199121576,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","questionId":"1000301","status":"","submitted":7856,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.687687125748503,"acs":3675,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":0.4442975611,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","questionId":"1000304","status":"","submitted":5344,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7542764051045343,"acs":5556,"articleLive":2,"columnArticles":94,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":1.0489221055,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","questionId":"1000306","status":"","submitted":7366,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6008420480782289,"acs":4424,"articleLive":2,"columnArticles":72,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","questionId":"1000307","status":"","submitted":7363,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.41565386485172584,"acs":3420,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":1.712728134,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","questionId":"1000309","status":"","submitted":8228,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.746448087431694,"acs":6147,"articleLive":2,"columnArticles":87,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":1.0808941382,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","questionId":"1000311","status":"","submitted":8235,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6433566433566433,"acs":5980,"articleLive":2,"columnArticles":92,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":0.4181180555,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","questionId":"1000313","status":"","submitted":9295,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8563436202851471,"acs":4745,"articleLive":2,"columnArticles":89,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","questionId":"1000315","status":"","submitted":5541,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.8831335616438356,"acs":4126,"articleLive":2,"columnArticles":68,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","questionId":"1000316","status":"","submitted":4672,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7216763347934178,"acs":6096,"articleLive":2,"columnArticles":102,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":1.3805429075,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","questionId":"1000319","status":"","submitted":8447,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.35878773416060133,"acs":3007,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","questionId":"1000321","status":"","submitted":8381,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.6064282673478075,"acs":2849,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.4716067405,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","questionId":"1000322","status":"","submitted":4698,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.6303282340709936,"acs":4244,"articleLive":2,"columnArticles":63,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","questionId":"1000323","status":"","submitted":6733,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.6819740569554197,"acs":4574,"articleLive":2,"columnArticles":91,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.3929911054,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","questionId":"1000324","status":"","submitted":6707,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.5478060046189377,"acs":3558,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":0.4181180555,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","questionId":"1000326","status":"","submitted":6495,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.768363855906621,"acs":3818,"articleLive":2,"columnArticles":69,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","questionId":"1000325","status":"","submitted":4969,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.7239547239547239,"acs":3134,"articleLive":2,"columnArticles":79,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.4181180555,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","questionId":"1000327","status":"","submitted":4329,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.6202712348322627,"acs":2607,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","questionId":"1000328","status":"","submitted":4203,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.6474722898080563,"acs":2395,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.4442975611,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","questionId":"1000329","status":"","submitted":3699,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6496012348855158,"acs":2525,"articleLive":2,"columnArticles":78,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","questionId":"1000330","status":"","submitted":3887,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.6740315638450503,"acs":2349,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","questionId":"1000331","status":"","submitted":3485,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.500792532581895,"acs":5687,"articleLive":2,"columnArticles":85,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","questionId":"1000332","status":"","submitted":11356,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7210226323313715,"acs":38835,"articleLive":2,"columnArticles":412,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":1.7058163011,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","questionId":"1000333","status":"ac","submitted":53861,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.6510286001003512,"acs":5190,"articleLive":2,"columnArticles":91,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.3688470065,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","questionId":"1000334","status":"","submitted":7972,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.5082644628099173,"acs":2460,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":1.0489221055,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","questionId":"1000335","status":"","submitted":4840,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.4195712843655365,"acs":7066,"articleLive":2,"columnArticles":87,"formTitle":"[剑指 Offer II 072]求平方根","frequency":1.3199121576,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","questionId":"1000336","status":"","submitted":16841,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.5243273386309772,"acs":3761,"articleLive":2,"columnArticles":69,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.4442975611,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","questionId":"1000337","status":"","submitted":7173,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.5723589001447178,"acs":4746,"articleLive":2,"columnArticles":75,"formTitle":"[剑指 Offer II 074]合并区间","frequency":1.3199121576,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","questionId":"1000338","status":"","submitted":8292,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.715752929263706,"acs":4948,"articleLive":2,"columnArticles":94,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.3456225535,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","questionId":"1000339","status":"","submitted":6913,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.6830038212327629,"acs":8222,"articleLive":2,"columnArticles":94,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":1.6143688138,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","questionId":"1000340","status":"","submitted":12038,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.5864491641766939,"acs":7262,"articleLive":2,"columnArticles":121,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.3929911054,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","questionId":"1000341","status":"","submitted":12383,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6422273781902552,"acs":5536,"articleLive":2,"columnArticles":95,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":1.5544706722,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","questionId":"1000342","status":"","submitted":8620,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8546942557134033,"acs":5535,"articleLive":2,"columnArticles":104,"formTitle":"[剑指 Offer II 079]所有子集","frequency":1.3199121576,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","questionId":"1000343","status":"","submitted":6476,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.8236749116607773,"acs":4662,"articleLive":2,"columnArticles":69,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","questionId":"1000344","status":"","submitted":5660,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.7845757149554617,"acs":6694,"articleLive":2,"columnArticles":89,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.4442975611,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","questionId":"1000229","status":"","submitted":8532,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.6466470154753132,"acs":5265,"articleLive":2,"columnArticles":60,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":0.988662914,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","questionId":"1000232","status":"","submitted":8142,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.860545193687231,"acs":5998,"articleLive":2,"columnArticles":98,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":0.9063118788,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","questionId":"1000234","status":"","submitted":6970,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6847841081528486,"acs":4964,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":1.3199121576,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","questionId":"1000235","status":"","submitted":7249,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.85106998264893,"acs":5886,"articleLive":2,"columnArticles":96,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":1.5839018723,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","questionId":"1000238","status":"","submitted":6916,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7480257116620753,"acs":4073,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":0.988662914,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","questionId":"1000240","status":"","submitted":5445,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6321663354227183,"acs":4135,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":1.6143688138,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","questionId":"1000241","status":"","submitted":6541,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.74039136979428,"acs":7378,"articleLive":2,"columnArticles":90,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":0.9602114928,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","questionId":"1000243","status":"ac","submitted":9965,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.6156339608527615,"acs":4938,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.988662914,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","questionId":"1000245","status":"","submitted":8021,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.4984984984984985,"acs":3154,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":1.0808941382,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","questionId":"1000266","status":"","submitted":6327,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7732536421367202,"acs":4140,"articleLive":2,"columnArticles":101,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":0.4442975611,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","questionId":"1000268","status":"","submitted":5354,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6791537267080745,"acs":3499,"articleLive":2,"columnArticles":81,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.4442975611,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","questionId":"1000269","status":"","submitted":5152,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5724749421742482,"acs":2970,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.4442975611,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","questionId":"1000271","status":"","submitted":5188,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.5989505247376312,"acs":2397,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.4716067405,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","questionId":"1000272","status":"","submitted":4002,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.6523702031602708,"acs":9248,"articleLive":2,"columnArticles":76,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":2.6653530534,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","questionId":"1000274","status":"","submitted":14176,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.48894018080400076,"acs":2542,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":1.748123795,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","questionId":"1000277","status":"","submitted":5199,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5473112719751809,"acs":2117,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":1.0489221055,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","questionId":"1000280","status":"","submitted":3868,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.7544144509843719,"acs":3717,"articleLive":2,"columnArticles":71,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","questionId":"1000345","status":"","submitted":4927,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.7160175784209729,"acs":4725,"articleLive":2,"columnArticles":70,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":2.0286164134,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","questionId":"1000285","status":"","submitted":6599,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.750202922077922,"acs":3697,"articleLive":2,"columnArticles":66,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":1.0182071603,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","questionId":"1000286","status":"","submitted":4928,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.48778195488721804,"acs":4152,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 101]分割等和子集","frequency":1.114219448,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","questionId":"1000287","status":"","submitted":8512,"title":"分割等和子集","titleSlug":"NUPfPr"},{"acceptance":0.5934570499330399,"acs":3102,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","questionId":"1000288","status":"","submitted":5227,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.5002432616522331,"acs":5141,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":2.1761588888,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","questionId":"1000289","status":"","submitted":10277,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5914500850133593,"acs":2435,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.5001312072,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","questionId":"1000290","status":"","submitted":4117,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.6968188440990772,"acs":5739,"articleLive":2,"columnArticles":83,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":1.6143688138,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","questionId":"1000291","status":"","submitted":8236,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.549154092363969,"acs":2402,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 106]二分图","frequency":1.0489221055,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","questionId":"1000294","status":"","submitted":4374,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5427491733585262,"acs":2298,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","questionId":"1000296","status":"","submitted":4234,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.5933656354826686,"acs":1592,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","questionId":"1000300","status":"","submitted":2683,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.5914696813977389,"acs":2302,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":1.4805818301,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","questionId":"1000302","status":"","submitted":3892,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8187986931389797,"acs":3258,"articleLive":2,"columnArticles":76,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","questionId":"1000303","status":"","submitted":3979,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.6832844574780058,"acs":1398,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.4716067405,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","questionId":"1000305","status":"","submitted":2046,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.562605548854041,"acs":2332,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":0.4442975611,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","questionId":"1000308","status":"","submitted":4145,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.587173860034138,"acs":2408,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":1.114219448,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","questionId":"1000310","status":"","submitted":4101,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.42437395659432386,"acs":1271,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.5001312072,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","questionId":"1000312","status":"","submitted":2995,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.30939226519337015,"acs":1568,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 115]重建序列","frequency":0.4442975611,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","questionId":"1000314","status":"","submitted":5068,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6489513822688274,"acs":5446,"articleLive":2,"columnArticles":95,"formTitle":"[剑指 Offer II 116]省份数量","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","questionId":"1000346","status":"","submitted":8392,"title":"省份数量","titleSlug":"bLyHh0"},{"acceptance":0.6379025598678778,"acs":1545,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","questionId":"1000317","status":"","submitted":2422,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.6963577353047241,"acs":1931,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","questionId":"1000318","status":"","submitted":2773,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.48353421277403436,"acs":5095,"articleLive":2,"columnArticles":71,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":1.4125900849,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","questionId":"1000320","status":"","submitted":10537,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.716611447503713,"acs":100360,"articleLive":2,"columnArticles":1642,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":3.9239064261,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"100158","status":"","submitted":140048,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.642123407794915,"acs":64073,"articleLive":2,"columnArticles":1188,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":1.3199121576,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"100159","status":"","submitted":99783,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.5784847952188433,"acs":49365,"articleLive":2,"columnArticles":536,"formTitle":"[面试题 01.03]URL化","frequency":2.0286164134,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"100160","status":"","submitted":85335,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5489948191666046,"acs":44294,"articleLive":2,"columnArticles":845,"formTitle":"[面试题 01.04]回文排列","frequency":1.7925558035,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"100184","status":"","submitted":80682,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.32884697970633114,"acs":35990,"articleLive":2,"columnArticles":614,"formTitle":"[面试题 01.05]一次编辑","frequency":1.3805429075,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000006","status":"","submitted":109443,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.4709353933258163,"acs":78520,"articleLive":2,"columnArticles":1225,"formTitle":"[面试题 01.06]字符串压缩","frequency":3.0064602926,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"100161","status":"","submitted":166732,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7494521084560575,"acs":70788,"articleLive":2,"columnArticles":1007,"formTitle":"[面试题 01.07]旋转矩阵","frequency":2.9689826731,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"100185","status":"","submitted":94453,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6227593872570939,"acs":48744,"articleLive":2,"columnArticles":541,"formTitle":"[面试题 01.08]零矩阵","frequency":0.988662914,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"100186","status":"","submitted":78271,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5489705483375034,"acs":36422,"articleLive":2,"columnArticles":457,"formTitle":"[面试题 01.09]字符串轮转","frequency":1.9650996448,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"100162","status":"","submitted":66346,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.677982036766618,"acs":67786,"articleLive":2,"columnArticles":726,"formTitle":"[面试题 02.01]移除重复节点","frequency":1.6786996721,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"100163","status":"ac","submitted":99982,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7796870413439609,"acs":69060,"articleLive":2,"columnArticles":988,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":2.5805565168,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","questionId":"1000007","status":"ac","submitted":88574,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.8553675545901452,"acs":74819,"articleLive":2,"columnArticles":716,"formTitle":"[面试题 02.03]删除中间节点","frequency":1.7925558035,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"100187","status":"ac","submitted":87470,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6489586265128061,"acs":27669,"articleLive":2,"columnArticles":399,"formTitle":"[面试题 02.04]分割链表","frequency":0.988662914,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"1000008","status":"ac","submitted":42636,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.4673732408279004,"acs":40217,"articleLive":2,"columnArticles":564,"formTitle":"[面试题 02.05]链表求和","frequency":2.7114796006,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"100188","status":"ac","submitted":86049,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.48398996772125563,"acs":43033,"articleLive":2,"columnArticles":534,"formTitle":"[面试题 02.06]回文链表","frequency":0.4181180555,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"100164","status":"ac","submitted":88913,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6805517146017699,"acs":59061,"articleLive":2,"columnArticles":521,"formTitle":"[面试题 02.07]链表相交","frequency":0.9327824556,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","questionId":"100167","status":"ac","submitted":86784,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5348887254989868,"acs":29827,"articleLive":2,"columnArticles":310,"formTitle":"[面试题 02.08]环路检测","frequency":1.3496762595,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"100168","status":"ac","submitted":55763,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5331607756608817,"acs":12565,"articleLive":2,"columnArticles":204,"formTitle":"[面试题 03.01]三合一","frequency":1.0182071603,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"100172","status":"","submitted":23567,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6137736431374278,"acs":27842,"articleLive":2,"columnArticles":315,"formTitle":"[面试题 03.02]栈的最小值","frequency":1.8554735886,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"100169","status":"ac","submitted":45362,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.38792356267283007,"acs":9399,"articleLive":2,"columnArticles":147,"formTitle":"[面试题 03.03]堆盘子","frequency":1.0182071603,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"100195","status":"","submitted":24229,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.714112197051014,"acs":25281,"articleLive":2,"columnArticles":361,"formTitle":"[面试题 03.04]化栈为队","frequency":1.6459420757,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"100170","status":"ac","submitted":35402,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5406994023049235,"acs":16374,"articleLive":2,"columnArticles":226,"formTitle":"[面试题 03.05]栈排序","frequency":1.3805429075,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"100173","status":"","submitted":30283,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5886926142793879,"acs":11964,"articleLive":2,"columnArticles":195,"formTitle":"[面试题 03.06]动物收容所","frequency":1.0182071603,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"100228","status":"","submitted":20323,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5311589665405243,"acs":19510,"articleLive":2,"columnArticles":266,"formTitle":"[面试题 04.01]节点间通路","frequency":1.6459420757,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"100171","status":"","submitted":36731,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7889695956804011,"acs":36822,"articleLive":2,"columnArticles":447,"formTitle":"[面试题 04.02]最小高度树","frequency":2.1761588888,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"100174","status":"","submitted":46671,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8055790628428146,"acs":25702,"articleLive":2,"columnArticles":567,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":1.8554735886,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"100175","status":"","submitted":31905,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5876076250460652,"acs":35079,"articleLive":2,"columnArticles":400,"formTitle":"[面试题 04.04]检查平衡性","frequency":0.0,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"100176","status":"","submitted":59698,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.3528770706190061,"acs":27523,"articleLive":2,"columnArticles":348,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":1.0182071603,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"100177","status":"","submitted":77996,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5931968066643527,"acs":22217,"articleLive":2,"columnArticles":269,"formTitle":"[面试题 04.06]后继者","frequency":0.0,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"100178","status":"","submitted":37453,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7155633665299747,"acs":18322,"articleLive":2,"columnArticles":194,"formTitle":"[面试题 04.08]首个共同祖先","frequency":1.4125900849,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"100179","status":"","submitted":25605,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.47672436401783375,"acs":7271,"articleLive":2,"columnArticles":120,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":1.0489221055,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"1000010","status":"","submitted":15252,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7165905139298856,"acs":17722,"articleLive":2,"columnArticles":287,"formTitle":"[面试题 04.10]检查子树","frequency":1.3805429075,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"100229","status":"","submitted":24731,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.48666260966580455,"acs":19193,"articleLive":2,"columnArticles":281,"formTitle":"[面试题 04.12]求和路径","frequency":2.0286164134,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"1000009","status":"","submitted":39438,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5059489262913522,"acs":10461,"articleLive":2,"columnArticles":214,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"100180","status":"","submitted":20676,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6973618715778994,"acs":8406,"articleLive":2,"columnArticles":141,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":0.4181180555,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"100203","status":"","submitted":12054,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.3837536786810544,"acs":12127,"articleLive":2,"columnArticles":253,"formTitle":"[面试题 05.03]翻转数位","frequency":1.3496762595,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"100230","status":"","submitted":31601,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.3779035721257076,"acs":5808,"articleLive":2,"columnArticles":147,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"100183","status":"","submitted":15369,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.5309063645451516,"acs":12746,"articleLive":2,"columnArticles":248,"formTitle":"[面试题 05.06]整数转换","frequency":1.0182071603,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"100181","status":"","submitted":24008,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7059122767352476,"acs":12489,"articleLive":2,"columnArticles":230,"formTitle":"[面试题 05.07]配对交换","frequency":0.988662914,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"100182","status":"","submitted":17692,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5575418994413408,"acs":3992,"articleLive":2,"columnArticles":80,"formTitle":"[面试题 05.08]绘制直线","frequency":1.0182071603,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"100196","status":"","submitted":7160,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.3633963014515808,"acs":45688,"articleLive":2,"columnArticles":499,"formTitle":"[面试题 08.01]三步问题","frequency":1.6786996721,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"100197","status":"","submitted":125725,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.3625904273778063,"acs":13583,"articleLive":2,"columnArticles":214,"formTitle":"[面试题 08.02]迷路的机器人","frequency":0.0,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000011","status":"","submitted":37461,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.675649711800991,"acs":53452,"articleLive":2,"columnArticles":443,"formTitle":"[面试题 08.03]魔术索引","frequency":0.0,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"100240","status":"","submitted":79112,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.8214492963876396,"acs":22649,"articleLive":2,"columnArticles":353,"formTitle":"[面试题 08.04]幂集","frequency":1.8886727603,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"100198","status":"","submitted":27572,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.678396871945259,"acs":24290,"articleLive":2,"columnArticles":538,"formTitle":"[面试题 08.05]递归乘法","frequency":0.0,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"100199","status":"","submitted":35805,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6535566706021252,"acs":26571,"articleLive":2,"columnArticles":284,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":1.3199121576,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"1000015","status":"","submitted":40656,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.8141454944899189,"acs":22976,"articleLive":2,"columnArticles":339,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":1.8234606116,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"100241","status":"","submitted":28221,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.7175047534285367,"acs":17736,"articleLive":2,"columnArticles":259,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":0.5001312072,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"100348","status":"ac","submitted":24719,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8157583761990824,"acs":23471,"articleLive":2,"columnArticles":388,"formTitle":"[面试题 08.09]括号","frequency":2.5486512584,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"100200","status":"","submitted":28772,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5589527781915686,"acs":15009,"articleLive":2,"columnArticles":238,"formTitle":"[面试题 08.10]颜色填充","frequency":1.0182071603,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"100201","status":"","submitted":26852,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.4949431188542412,"acs":35284,"articleLive":2,"columnArticles":341,"formTitle":"[面试题 08.11]硬币","frequency":1.6459420757,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"100231","status":"","submitted":71289,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.7615310765120842,"acs":18244,"articleLive":2,"columnArticles":312,"formTitle":"[面试题 08.12]八皇后","frequency":2.062116643,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"100233","status":"","submitted":23957,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5028240989779451,"acs":7478,"articleLive":2,"columnArticles":97,"formTitle":"[面试题 08.13]堆箱子","frequency":1.0808941382,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"100202","status":"","submitted":14872,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5358226371061844,"acs":4592,"articleLive":2,"columnArticles":81,"formTitle":"[面试题 08.14]布尔运算","frequency":1.4125900849,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000031","status":"ac","submitted":8570,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.556477244130449,"acs":59705,"articleLive":2,"columnArticles":2402,"formTitle":"[面试题 10.01]合并排序的数组","frequency":3.1997834966,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000012","status":"","submitted":107291,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7395356509546785,"acs":35866,"articleLive":2,"columnArticles":439,"formTitle":"[面试题 10.02]变位词组","frequency":3.0626548509,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000040","status":"ac","submitted":48498,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.3941015162920744,"acs":14659,"articleLive":2,"columnArticles":220,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":2.7114796006,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"100232","status":"","submitted":37196,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.5566171825647505,"acs":21147,"articleLive":2,"columnArticles":277,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":0.3929911054,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"100242","status":"","submitted":37992,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.4534808067664281,"acs":13940,"articleLive":2,"columnArticles":188,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":1.4125900849,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000016","status":"","submitted":30740,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6245932124593212,"acs":5374,"articleLive":2,"columnArticles":104,"formTitle":"[面试题 10.10]数字流的秩","frequency":0.0,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"1000041","status":"","submitted":8604,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6638589923568866,"acs":8512,"articleLive":2,"columnArticles":114,"formTitle":"[面试题 10.11]峰与谷","frequency":1.0489221055,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000013","status":"","submitted":12822,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8282148835793639,"acs":27211,"articleLive":2,"columnArticles":435,"formTitle":"[面试题 16.01]交换数字","frequency":1.0182071603,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"100258","status":"","submitted":32855,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7653328347045625,"acs":16372,"articleLive":2,"columnArticles":215,"formTitle":"[面试题 16.02]单词频率","frequency":0.0,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"100259","status":"","submitted":21392,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.4409795551561447,"acs":9814,"articleLive":2,"columnArticles":238,"formTitle":"[面试题 16.03]交点","frequency":0.0,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"100260","status":"","submitted":22255,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.4607215007215007,"acs":7982,"articleLive":2,"columnArticles":169,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"100261","status":"","submitted":17325,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.46019233801040516,"acs":11676,"articleLive":2,"columnArticles":137,"formTitle":"[面试题 16.05]阶乘尾数","frequency":0.988662914,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"1000017","status":"","submitted":25372,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.42477584190481904,"acs":14165,"articleLive":2,"columnArticles":212,"formTitle":"[面试题 16.06]最小差","frequency":2.0286164134,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"100262","status":"","submitted":33347,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7329590740548221,"acs":21151,"articleLive":2,"columnArticles":317,"formTitle":"[面试题 16.07]最大数值","frequency":1.3805429075,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"100349","status":"","submitted":28857,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.3785896857615396,"acs":2518,"articleLive":2,"columnArticles":67,"formTitle":"[面试题 16.08]整数的英语表示","frequency":0.0,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"1000018","status":"","submitted":6651,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5452684258416742,"acs":2397,"articleLive":2,"columnArticles":42,"formTitle":"[面试题 16.09]运算","frequency":0.5001312072,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"100350","status":"","submitted":4396,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.680209147184326,"acs":11318,"articleLive":2,"columnArticles":214,"formTitle":"[面试题 16.10]生存人数","frequency":1.3805429075,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"100351","status":"","submitted":16639,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.4408119639994232,"acs":51966,"articleLive":2,"columnArticles":605,"formTitle":"[面试题 16.11]跳水板","frequency":1.6786996721,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"100352","status":"","submitted":117887,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.4278723820708554,"acs":2186,"articleLive":2,"columnArticles":60,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"100353","status":"","submitted":5109,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.553083638411715,"acs":3928,"articleLive":2,"columnArticles":68,"formTitle":"[面试题 16.14]最佳直线","frequency":1.3805429075,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"100354","status":"","submitted":7102,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.5030027024321889,"acs":10051,"articleLive":2,"columnArticles":255,"formTitle":"[面试题 16.15]珠玑妙算","frequency":0.5299663557,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"100355","status":"","submitted":19982,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.4570702841511751,"acs":16375,"articleLive":2,"columnArticles":231,"formTitle":"[面试题 16.16]部分排序","frequency":1.3805429075,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"100356","status":"","submitted":35826,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.5969842357779301,"acs":36582,"articleLive":2,"columnArticles":396,"formTitle":"[面试题 16.17]连续数列","frequency":1.7925558035,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"1000003","status":"","submitted":61278,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.3437866808406972,"acs":15523,"articleLive":2,"columnArticles":319,"formTitle":"[面试题 16.18]模式匹配","frequency":0.4716067405,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000004","status":"","submitted":45153,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.6149151959660784,"acs":21463,"articleLive":2,"columnArticles":388,"formTitle":"[面试题 16.19]水域大小","frequency":1.8554735886,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"1000005","status":"","submitted":34904,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7203940004477278,"acs":9654,"articleLive":2,"columnArticles":189,"formTitle":"[面试题 16.20]T9键盘","frequency":1.0182071603,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"1000047","status":"","submitted":13401,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.4654452377744847,"acs":10365,"articleLive":2,"columnArticles":196,"formTitle":"[面试题 16.21]交换和","frequency":0.0,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"1000048","status":"","submitted":22269,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5860519632740769,"acs":3000,"articleLive":2,"columnArticles":63,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":0.0,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000050","status":"","submitted":5119,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.47320493190426305,"acs":11744,"articleLive":2,"columnArticles":179,"formTitle":"[面试题 16.24]数对和","frequency":0.4442975611,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"1000042","status":"","submitted":24818,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5455972621234242,"acs":34754,"articleLive":2,"columnArticles":278,"formTitle":"[面试题 16.25]LRU 缓存","frequency":3.9690608235,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"1000026","status":"","submitted":63699,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.3904670552645171,"acs":15876,"articleLive":2,"columnArticles":222,"formTitle":"[面试题 16.26]计算器","frequency":2.4878976863,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"1000027","status":"","submitted":40659,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.5976192583414461,"acs":13505,"articleLive":2,"columnArticles":187,"formTitle":"[面试题 17.01]不用加号的加法","frequency":1.3805429075,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000025","status":"","submitted":22598,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6387223892979363,"acs":30796,"articleLive":2,"columnArticles":491,"formTitle":"[面试题 17.04]消失的数字","frequency":1.3496762595,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"1000032","status":"","submitted":48215,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.39012012590736816,"acs":6073,"articleLive":2,"columnArticles":104,"formTitle":"[面试题 17.05] 字母与数字","frequency":0.0,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000033","status":"","submitted":15567,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.4539249146757679,"acs":5054,"articleLive":2,"columnArticles":116,"formTitle":"[面试题 17.06]2出现的次数","frequency":1.0808941382,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","questionId":"1000034","status":"","submitted":11134,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.410295029680163,"acs":9262,"articleLive":2,"columnArticles":222,"formTitle":"[面试题 17.07]婴儿名字","frequency":0.4716067405,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"1000035","status":"","submitted":22574,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.2725283530571992,"acs":8843,"articleLive":2,"columnArticles":126,"formTitle":"[面试题 17.08]马戏团人塔","frequency":1.4125900849,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"1000036","status":"","submitted":32448,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5490726708522768,"acs":15217,"articleLive":2,"columnArticles":167,"formTitle":"[面试题 17.09]第 k 个数","frequency":1.8554735886,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000037","status":"","submitted":27714,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5699676804508162,"acs":68778,"articleLive":2,"columnArticles":952,"formTitle":"[面试题 17.10]主要元素","frequency":2.8836066195,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"1000038","status":"ac","submitted":120670,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6851818830242511,"acs":15370,"articleLive":2,"columnArticles":283,"formTitle":"[面试题 17.11]单词距离","frequency":1.0489221055,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000039","status":"","submitted":22432,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.6313548569011702,"acs":22391,"articleLive":2,"columnArticles":309,"formTitle":"[面试题 17.12]BiNode","frequency":1.0182071603,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"1000019","status":"","submitted":35465,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5519783031867195,"acs":25237,"articleLive":2,"columnArticles":277,"formTitle":"[面试题 17.13]恢复空格","frequency":1.0808941382,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"1000020","status":"","submitted":45721,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5963186570460904,"acs":80992,"articleLive":2,"columnArticles":801,"formTitle":"[面试题 17.14]最小K个数","frequency":3.6677255782,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000021","status":"ac","submitted":135820,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.40410456877595896,"acs":6616,"articleLive":2,"columnArticles":129,"formTitle":"[面试题 17.15]最长单词","frequency":1.8554735886,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"1000022","status":"","submitted":16372,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.517024804188208,"acs":63304,"articleLive":2,"columnArticles":1170,"formTitle":"[面试题 17.16]按摩师","frequency":1.748123795,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"1000023","status":"","submitted":122439,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.4484651351900793,"acs":8824,"articleLive":2,"columnArticles":195,"formTitle":"[面试题 17.17]多次搜索","frequency":0.4442975611,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"1000024","status":"","submitted":19676,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.4425888439046334,"acs":7871,"articleLive":2,"columnArticles":134,"formTitle":"[面试题 17.18]最短超串","frequency":1.6786996721,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000043","status":"","submitted":17784,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5780575095643589,"acs":9368,"articleLive":2,"columnArticles":197,"formTitle":"[面试题 17.19]消失的两个数字","frequency":0.4181180555,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"1000044","status":"","submitted":16206,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5745526838966203,"acs":4335,"articleLive":2,"columnArticles":76,"formTitle":"[面试题 17.20]连续中值","frequency":0.5001312072,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"1000028","status":"","submitted":7545,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.6361653934354732,"acs":45218,"articleLive":2,"columnArticles":543,"formTitle":"[面试题 17.21]直方图的水量","frequency":2.5208278926,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"1000029","status":"","submitted":71079,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.3815624017604527,"acs":9710,"articleLive":2,"columnArticles":164,"formTitle":"[面试题 17.22]单词转换","frequency":0.988662914,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000030","status":"","submitted":25448,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.37635216346153844,"acs":5010,"articleLive":2,"columnArticles":108,"formTitle":"[面试题 17.23]最大黑方阵","frequency":1.4125900849,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"1000045","status":"","submitted":13312,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5224493214943877,"acs":12474,"articleLive":2,"columnArticles":132,"formTitle":"[面试题 17.24]最大子矩阵","frequency":3.85210526,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"1000046","status":"","submitted":23876,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.5053131991051454,"acs":1807,"articleLive":2,"columnArticles":40,"formTitle":"[面试题 17.25]单词矩阵","frequency":0.594008722,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"1000049","status":"","submitted":3576,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.3461331419343262,"acs":3858,"articleLive":2,"columnArticles":59,"formTitle":"[面试题 17.26]稀疏相似度","frequency":1.0489221055,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"1000051","status":"","submitted":11146,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}] \ No newline at end of file diff --git a/src/main/java/leetcode/editor/cn/doc/content/Convert1dArrayInto2dArray.md b/src/main/java/leetcode/editor/cn/doc/content/Convert1dArrayInto2dArray.md new file mode 100644 index 0000000..1916b3f --- /dev/null +++ b/src/main/java/leetcode/editor/cn/doc/content/Convert1dArrayInto2dArray.md @@ -0,0 +1,55 @@ +
给你一个下标从 0 开始的一维整数数组 original
和两个整数 m
和 n
。你需要使用 original
中 所有 元素创建一个 m
行 n
列的二维数组。
original
中下标从 0
到 n - 1
(都 包含 )的元素构成二维数组的第一行,下标从 n
到 2 * n - 1
(都 包含 )的元素构成二维数组的第二行,依此类推。
请你根据上述过程返回一个 m x n
的二维数组。如果无法构成这样的二维数组,请你返回一个空的二维数组。
+ +
示例 1:
+输入:original = [1,2,3,4], m = 2, n = 2 +输出:[[1,2],[3,4]] +解释: +构造出的二维数组应该包含 2 行 2 列。 +original 中第一个 n=2 的部分为 [1,2] ,构成二维数组的第一行。 +original 中第二个 n=2 的部分为 [3,4] ,构成二维数组的第二行。 ++ +
示例 2:
+ +输入:original = [1,2,3], m = 1, n = 3 +输出:[[1,2,3]] +解释: +构造出的二维数组应该包含 1 行 3 列。 +将 original 中所有三个元素放入第一行中,构成要求的二维数组。 ++ +
示例 3:
+ +输入:original = [1,2], m = 1, n = 1 +输出:[] +解释: +original 中有 2 个元素。 +无法将 2 个元素放入到一个 1x1 的二维数组中,所以返回一个空的二维数组。 ++ +
示例 4:
+ +输入:original = [3], m = 1, n = 2 +输出:[] +解释: +original 中只有 1 个元素。 +无法将 1 个元素放满一个 1x2 的二维数组,所以返回一个空的二维数组。 ++ +
+ +
提示:
+ +1 <= original.length <= 5 * 104
1 <= original[i] <= 105
1 <= m, n <= 4 * 104